./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix023_power.opt_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 28f58acc3eb15266c6a84eca373e682a200492b696916dc340e2c03025141f5c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:22:47,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:22:47,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:22:47,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:22:47,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:22:47,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:22:47,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:22:47,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:22:47,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:22:47,779 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:22:47,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:22:47,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:22:47,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:22:47,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:22:47,781 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:22:47,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:22:47,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:22:47,782 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:22:47,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:22:47,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:22:47,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:22:47,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:22:47,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:22:47,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:22:47,785 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:22:47,785 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:22:47,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:22:47,786 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:22:47,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:22:47,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:22:47,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:22:47,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:22:47,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:22:47,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:22:47,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:22:47,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:22:47,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:22:47,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:22:47,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:22:47,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:22:47,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:22:47,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:22:47,790 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 -> 28f58acc3eb15266c6a84eca373e682a200492b696916dc340e2c03025141f5c [2024-10-14 14:22:48,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:22:48,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:22:48,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:22:48,077 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:22:48,077 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:22:48,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2024-10-14 14:22:49,637 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:22:49,952 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:22:49,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2024-10-14 14:22:49,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf7c5515/fa1a78c97f92478b80c486068a7e8665/FLAG51afb4147 [2024-10-14 14:22:49,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf7c5515/fa1a78c97f92478b80c486068a7e8665 [2024-10-14 14:22:49,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:22:49,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:22:49,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:22:49,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:22:50,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:22:50,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:22:49" (1/1) ... [2024-10-14 14:22:50,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467bd0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50, skipping insertion in model container [2024-10-14 14:22:50,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:22:49" (1/1) ... [2024-10-14 14:22:50,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:22:50,249 WARN L248 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/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2024-10-14 14:22:50,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:22:50,478 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:22:50,488 WARN L248 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/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2024-10-14 14:22:50,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:22:50,625 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:22:50,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50 WrapperNode [2024-10-14 14:22:50,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:22:50,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:22:50,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:22:50,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:22:50,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50" (1/1) ... [2024-10-14 14:22:50,652 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50" (1/1) ... [2024-10-14 14:22:50,686 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-10-14 14:22:50,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:22:50,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:22:50,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:22:50,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:22:50,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50" (1/1) ... [2024-10-14 14:22:50,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50" (1/1) ... [2024-10-14 14:22:50,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50" (1/1) ... [2024-10-14 14:22:50,729 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-10-14 14:22:50,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50" (1/1) ... [2024-10-14 14:22:50,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50" (1/1) ... [2024-10-14 14:22:50,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50" (1/1) ... [2024-10-14 14:22:50,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50" (1/1) ... [2024-10-14 14:22:50,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50" (1/1) ... [2024-10-14 14:22:50,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50" (1/1) ... [2024-10-14 14:22:50,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:22:50,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:22:50,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:22:50,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:22:50,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50" (1/1) ... [2024-10-14 14:22:50,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:22:50,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:22:50,794 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-10-14 14:22:50,797 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-10-14 14:22:50,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 14:22:50,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:22:50,847 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-14 14:22:50,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-14 14:22:50,847 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-14 14:22:50,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-14 14:22:50,848 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-14 14:22:50,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-14 14:22:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-14 14:22:50,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-14 14:22:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:22:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 14:22:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:22:50,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:22:50,852 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 14:22:51,000 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:22:51,002 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:22:51,308 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 14:22:51,308 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:22:51,513 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:22:51,514 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 14:22:51,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:22:51 BoogieIcfgContainer [2024-10-14 14:22:51,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:22:51,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:22:51,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:22:51,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:22:51,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:22:49" (1/3) ... [2024-10-14 14:22:51,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9ab11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:22:51, skipping insertion in model container [2024-10-14 14:22:51,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:50" (2/3) ... [2024-10-14 14:22:51,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9ab11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:22:51, skipping insertion in model container [2024-10-14 14:22:51,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:22:51" (3/3) ... [2024-10-14 14:22:51,525 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.opt_pso.opt_rmo.opt.i [2024-10-14 14:22:51,547 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:22:51,547 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 14:22:51,547 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 14:22:51,607 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 14:22:51,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2024-10-14 14:22:51,677 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-10-14 14:22:51,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 14:22:51,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2024-10-14 14:22:51,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2024-10-14 14:22:51,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2024-10-14 14:22:51,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:22:51,706 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;@5875d79f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:22:51,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 14:22:51,715 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 14:22:51,716 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-10-14 14:22:51,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 14:22:51,716 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:22:51,717 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:22:51,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:22:51,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:22:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash -190799045, now seen corresponding path program 1 times [2024-10-14 14:22:51,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:22:51,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740827746] [2024-10-14 14:22:51,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:22:51,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:22:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:22:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:22:52,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:22:52,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740827746] [2024-10-14 14:22:52,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740827746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:22:52,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:22:52,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 14:22:52,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660446157] [2024-10-14 14:22:52,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:22:52,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:22:52,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:22:52,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:22:52,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:22:52,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 50 [2024-10-14 14:22:52,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-10-14 14:22:52,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:22:52,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 50 [2024-10-14 14:22:52,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:22:52,815 INFO L124 PetriNetUnfolderBase]: 1153/1995 cut-off events. [2024-10-14 14:22:52,815 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-10-14 14:22:52,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3717 conditions, 1995 events. 1153/1995 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13651 event pairs, 355 based on Foata normal form. 72/1998 useless extension candidates. Maximal degree in co-relation 3705. Up to 1303 conditions per place. [2024-10-14 14:22:52,840 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 29 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-10-14 14:22:52,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 193 flow [2024-10-14 14:22:52,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:22:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 14:22:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-10-14 14:22:52,852 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.78 [2024-10-14 14:22:52,854 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 117 transitions. [2024-10-14 14:22:52,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 193 flow [2024-10-14 14:22:52,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 14:22:52,863 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2024-10-14 14:22:52,866 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-10-14 14:22:52,870 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2024-10-14 14:22:52,871 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2024-10-14 14:22:52,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-10-14 14:22:52,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:22:52,885 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:22:52,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:22:52,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:22:52,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:22:52,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1812778184, now seen corresponding path program 1 times [2024-10-14 14:22:52,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:22:52,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180068925] [2024-10-14 14:22:52,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:22:52,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:22:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:22:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:22:53,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:22:53,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180068925] [2024-10-14 14:22:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180068925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:22:53,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:22:53,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:22:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333072165] [2024-10-14 14:22:53,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:22:53,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:22:53,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:22:53,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:22:53,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:22:53,125 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-10-14 14:22:53,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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-10-14 14:22:53,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:22:53,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-10-14 14:22:53,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:22:54,111 INFO L124 PetriNetUnfolderBase]: 4629/7360 cut-off events. [2024-10-14 14:22:54,111 INFO L125 PetriNetUnfolderBase]: For 344/344 co-relation queries the response was YES. [2024-10-14 14:22:54,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14272 conditions, 7360 events. 4629/7360 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 52768 event pairs, 663 based on Foata normal form. 240/7332 useless extension candidates. Maximal degree in co-relation 14262. Up to 3569 conditions per place. [2024-10-14 14:22:54,164 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 46 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2024-10-14 14:22:54,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 270 flow [2024-10-14 14:22:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:22:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 14:22:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2024-10-14 14:22:54,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.715 [2024-10-14 14:22:54,229 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 143 transitions. [2024-10-14 14:22:54,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 270 flow [2024-10-14 14:22:54,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 14:22:54,233 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2024-10-14 14:22:54,233 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-10-14 14:22:54,234 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2024-10-14 14:22:54,234 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2024-10-14 14:22:54,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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-10-14 14:22:54,235 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:22:54,235 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] [2024-10-14 14:22:54,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:22:54,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:22:54,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:22:54,236 INFO L85 PathProgramCache]: Analyzing trace with hash 394738512, now seen corresponding path program 1 times [2024-10-14 14:22:54,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:22:54,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913144689] [2024-10-14 14:22:54,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:22:54,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:22:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:22:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:22:54,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:22:54,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913144689] [2024-10-14 14:22:54,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913144689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:22:54,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:22:54,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:22:54,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360202436] [2024-10-14 14:22:54,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:22:54,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:22:54,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:22:54,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:22:54,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:22:54,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-10-14 14:22:54,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 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-10-14 14:22:54,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:22:54,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-10-14 14:22:54,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:22:55,306 INFO L124 PetriNetUnfolderBase]: 3853/6124 cut-off events. [2024-10-14 14:22:55,306 INFO L125 PetriNetUnfolderBase]: For 1604/1604 co-relation queries the response was YES. [2024-10-14 14:22:55,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13906 conditions, 6124 events. 3853/6124 cut-off events. For 1604/1604 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 42130 event pairs, 249 based on Foata normal form. 228/6147 useless extension candidates. Maximal degree in co-relation 13894. Up to 2561 conditions per place. [2024-10-14 14:22:55,350 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 59 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2024-10-14 14:22:55,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 387 flow [2024-10-14 14:22:55,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:22:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 14:22:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2024-10-14 14:22:55,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.728 [2024-10-14 14:22:55,354 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 182 transitions. [2024-10-14 14:22:55,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 387 flow [2024-10-14 14:22:55,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 376 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-14 14:22:55,362 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2024-10-14 14:22:55,362 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-10-14 14:22:55,364 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2024-10-14 14:22:55,364 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2024-10-14 14:22:55,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 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-10-14 14:22:55,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:22:55,365 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] [2024-10-14 14:22:55,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:22:55,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:22:55,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:22:55,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1828909669, now seen corresponding path program 1 times [2024-10-14 14:22:55,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:22:55,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438676607] [2024-10-14 14:22:55,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:22:55,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:22:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:22:55,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-10-14 14:22:55,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:22:55,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438676607] [2024-10-14 14:22:55,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438676607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:22:55,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:22:55,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:22:55,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690064433] [2024-10-14 14:22:55,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:22:55,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:22:55,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:22:55,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:22:55,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:22:55,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-10-14 14:22:55,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 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-10-14 14:22:55,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:22:55,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-10-14 14:22:55,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:22:56,278 INFO L124 PetriNetUnfolderBase]: 2645/4124 cut-off events. [2024-10-14 14:22:56,279 INFO L125 PetriNetUnfolderBase]: For 3362/3362 co-relation queries the response was YES. [2024-10-14 14:22:56,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10686 conditions, 4124 events. 2645/4124 cut-off events. For 3362/3362 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 24978 event pairs, 115 based on Foata normal form. 172/4185 useless extension candidates. Maximal degree in co-relation 10672. Up to 1100 conditions per place. [2024-10-14 14:22:56,311 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 70 selfloop transitions, 14 changer transitions 1/103 dead transitions. [2024-10-14 14:22:56,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 510 flow [2024-10-14 14:22:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:22:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 14:22:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2024-10-14 14:22:56,313 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.73 [2024-10-14 14:22:56,313 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 219 transitions. [2024-10-14 14:22:56,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 510 flow [2024-10-14 14:22:56,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 480 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 14:22:56,328 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2024-10-14 14:22:56,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-10-14 14:22:56,329 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-10-14 14:22:56,330 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2024-10-14 14:22:56,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 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-10-14 14:22:56,330 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:22:56,330 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, 1, 1] [2024-10-14 14:22:56,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:22:56,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:22:56,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:22:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash 488953054, now seen corresponding path program 1 times [2024-10-14 14:22:56,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:22:56,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452605267] [2024-10-14 14:22:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:22:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:22:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:22:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:22:56,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:22:56,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452605267] [2024-10-14 14:22:56,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452605267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:22:56,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:22:56,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:22:56,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966733671] [2024-10-14 14:22:56,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:22:56,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:22:56,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:22:56,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:22:56,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:22:56,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-10-14 14:22:56,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 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-10-14 14:22:56,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:22:56,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-10-14 14:22:56,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:22:57,336 INFO L124 PetriNetUnfolderBase]: 1793/2668 cut-off events. [2024-10-14 14:22:57,337 INFO L125 PetriNetUnfolderBase]: For 3624/3624 co-relation queries the response was YES. [2024-10-14 14:22:57,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7751 conditions, 2668 events. 1793/2668 cut-off events. For 3624/3624 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13919 event pairs, 77 based on Foata normal form. 80/2701 useless extension candidates. Maximal degree in co-relation 7736. Up to 828 conditions per place. [2024-10-14 14:22:57,358 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 63 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2024-10-14 14:22:57,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 508 flow [2024-10-14 14:22:57,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:22:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 14:22:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2024-10-14 14:22:57,361 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-10-14 14:22:57,362 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 238 transitions. [2024-10-14 14:22:57,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 508 flow [2024-10-14 14:22:57,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 462 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-14 14:22:57,380 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2024-10-14 14:22:57,381 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-10-14 14:22:57,381 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2024-10-14 14:22:57,381 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2024-10-14 14:22:57,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 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-10-14 14:22:57,382 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:22:57,382 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:22:57,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:22:57,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:22:57,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:22:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash -13977731, now seen corresponding path program 1 times [2024-10-14 14:22:57,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:22:57,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049692205] [2024-10-14 14:22:57,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:22:57,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:22:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:22:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:22:57,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:22:57,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049692205] [2024-10-14 14:22:57,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049692205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:22:57,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:22:57,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:22:57,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221321504] [2024-10-14 14:22:57,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:22:57,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:22:57,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:22:57,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:22:57,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:22:57,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2024-10-14 14:22:57,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 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-10-14 14:22:57,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:22:57,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2024-10-14 14:22:57,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:22:58,345 INFO L124 PetriNetUnfolderBase]: 2380/4142 cut-off events. [2024-10-14 14:22:58,345 INFO L125 PetriNetUnfolderBase]: For 1846/2008 co-relation queries the response was YES. [2024-10-14 14:22:58,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9443 conditions, 4142 events. 2380/4142 cut-off events. For 1846/2008 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 27043 event pairs, 1098 based on Foata normal form. 16/3790 useless extension candidates. Maximal degree in co-relation 9427. Up to 1714 conditions per place. [2024-10-14 14:22:58,375 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 36 selfloop transitions, 2 changer transitions 14/83 dead transitions. [2024-10-14 14:22:58,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 83 transitions, 424 flow [2024-10-14 14:22:58,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:22:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 14:22:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-10-14 14:22:58,377 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.672 [2024-10-14 14:22:58,377 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 5 states and 168 transitions. [2024-10-14 14:22:58,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 83 transitions, 424 flow [2024-10-14 14:22:58,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 318 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-10-14 14:22:58,394 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 168 flow [2024-10-14 14:22:58,395 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2024-10-14 14:22:58,395 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-10-14 14:22:58,396 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 168 flow [2024-10-14 14:22:58,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 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-10-14 14:22:58,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:22:58,397 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:22:58,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 14:22:58,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:22:58,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:22:58,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1546374583, now seen corresponding path program 2 times [2024-10-14 14:22:58,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:22:58,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836716704] [2024-10-14 14:22:58,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:22:58,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:22:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:22:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:22:58,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:22:58,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836716704] [2024-10-14 14:22:58,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836716704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:22:58,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:22:58,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:22:58,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057001474] [2024-10-14 14:22:58,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:22:58,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:22:58,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:22:58,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:22:58,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:22:58,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2024-10-14 14:22:58,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 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-10-14 14:22:58,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:22:58,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2024-10-14 14:22:58,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:22:59,506 INFO L124 PetriNetUnfolderBase]: 3846/6680 cut-off events. [2024-10-14 14:22:59,506 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-10-14 14:22:59,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13264 conditions, 6680 events. 3846/6680 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 49253 event pairs, 870 based on Foata normal form. 16/6146 useless extension candidates. Maximal degree in co-relation 13251. Up to 2720 conditions per place. [2024-10-14 14:22:59,554 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 30 selfloop transitions, 1 changer transitions 29/92 dead transitions. [2024-10-14 14:22:59,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 370 flow [2024-10-14 14:22:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:22:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 14:22:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2024-10-14 14:22:59,556 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6633333333333333 [2024-10-14 14:22:59,556 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 168 flow. Second operand 6 states and 199 transitions. [2024-10-14 14:22:59,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 370 flow [2024-10-14 14:22:59,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 92 transitions, 362 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-14 14:22:59,569 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 173 flow [2024-10-14 14:22:59,569 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2024-10-14 14:22:59,571 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2024-10-14 14:22:59,571 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 173 flow [2024-10-14 14:22:59,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 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-10-14 14:22:59,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:22:59,571 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:22:59,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:22:59,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:22:59,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:22:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash -590433207, now seen corresponding path program 3 times [2024-10-14 14:22:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:22:59,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639884471] [2024-10-14 14:22:59,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:22:59,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:22:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:23:00,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:23:00,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:23:00,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639884471] [2024-10-14 14:23:00,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639884471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:23:00,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:23:00,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 14:23:00,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180221511] [2024-10-14 14:23:00,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:23:00,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:23:00,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:23:00,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:23:00,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:23:00,611 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2024-10-14 14:23:00,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 173 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 0 states have call successors, (0), 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-10-14 14:23:00,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:23:00,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2024-10-14 14:23:00,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:23:01,405 INFO L124 PetriNetUnfolderBase]: 2680/4776 cut-off events. [2024-10-14 14:23:01,405 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-10-14 14:23:01,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9491 conditions, 4776 events. 2680/4776 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 33809 event pairs, 406 based on Foata normal form. 16/4339 useless extension candidates. Maximal degree in co-relation 9476. Up to 1234 conditions per place. [2024-10-14 14:23:01,437 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 45 selfloop transitions, 5 changer transitions 16/100 dead transitions. [2024-10-14 14:23:01,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 405 flow [2024-10-14 14:23:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 14:23:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-14 14:23:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 292 transitions. [2024-10-14 14:23:01,440 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6488888888888888 [2024-10-14 14:23:01,440 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 173 flow. Second operand 9 states and 292 transitions. [2024-10-14 14:23:01,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 405 flow [2024-10-14 14:23:01,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 394 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 14:23:01,444 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 189 flow [2024-10-14 14:23:01,444 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=189, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2024-10-14 14:23:01,445 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2024-10-14 14:23:01,445 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 189 flow [2024-10-14 14:23:01,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 0 states have call successors, (0), 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-10-14 14:23:01,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:23:01,446 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:23:01,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 14:23:01,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:23:01,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:23:01,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1316090609, now seen corresponding path program 4 times [2024-10-14 14:23:01,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:23:01,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215966837] [2024-10-14 14:23:01,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:23:01,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:23:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:23:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:23:01,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:23:01,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215966837] [2024-10-14 14:23:01,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215966837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:23:01,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:23:01,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:23:01,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293441503] [2024-10-14 14:23:01,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:23:01,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:23:01,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:23:01,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:23:01,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:23:01,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2024-10-14 14:23:01,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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-10-14 14:23:01,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:23:01,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2024-10-14 14:23:01,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:23:03,510 INFO L124 PetriNetUnfolderBase]: 10868/17813 cut-off events. [2024-10-14 14:23:03,511 INFO L125 PetriNetUnfolderBase]: For 3939/3939 co-relation queries the response was YES. [2024-10-14 14:23:03,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39397 conditions, 17813 events. 10868/17813 cut-off events. For 3939/3939 co-relation queries the response was YES. Maximal size of possible extension queue 1008. Compared 139505 event pairs, 3807 based on Foata normal form. 16/16761 useless extension candidates. Maximal degree in co-relation 39380. Up to 8431 conditions per place. [2024-10-14 14:23:03,616 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 35 selfloop transitions, 11 changer transitions 19/91 dead transitions. [2024-10-14 14:23:03,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 418 flow [2024-10-14 14:23:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:23:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 14:23:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-10-14 14:23:03,618 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.608 [2024-10-14 14:23:03,618 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 189 flow. Second operand 5 states and 152 transitions. [2024-10-14 14:23:03,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 418 flow [2024-10-14 14:23:03,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 91 transitions, 398 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-10-14 14:23:03,634 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 270 flow [2024-10-14 14:23:03,634 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-10-14 14:23:03,636 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2024-10-14 14:23:03,636 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 270 flow [2024-10-14 14:23:03,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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-10-14 14:23:03,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:23:03,637 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:23:03,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 14:23:03,637 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:23:03,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:23:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash -33176823, now seen corresponding path program 5 times [2024-10-14 14:23:03,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:23:03,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615925038] [2024-10-14 14:23:03,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:23:03,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:23:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:23:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:23:03,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:23:03,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615925038] [2024-10-14 14:23:03,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615925038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:23:03,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:23:03,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:23:03,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930351716] [2024-10-14 14:23:03,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:23:03,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:23:03,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:23:03,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:23:03,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:23:03,943 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2024-10-14 14:23:03,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 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-10-14 14:23:03,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:23:03,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2024-10-14 14:23:03,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:23:06,290 INFO L124 PetriNetUnfolderBase]: 15102/24988 cut-off events. [2024-10-14 14:23:06,290 INFO L125 PetriNetUnfolderBase]: For 11849/11891 co-relation queries the response was YES. [2024-10-14 14:23:06,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61832 conditions, 24988 events. 15102/24988 cut-off events. For 11849/11891 co-relation queries the response was YES. Maximal size of possible extension queue 1503. Compared 210577 event pairs, 3903 based on Foata normal form. 36/23300 useless extension candidates. Maximal degree in co-relation 61814. Up to 10414 conditions per place. [2024-10-14 14:23:06,399 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 32 selfloop transitions, 5 changer transitions 52/115 dead transitions. [2024-10-14 14:23:06,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 115 transitions, 636 flow [2024-10-14 14:23:06,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:23:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 14:23:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-10-14 14:23:06,401 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.62 [2024-10-14 14:23:06,401 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 270 flow. Second operand 6 states and 186 transitions. [2024-10-14 14:23:06,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 115 transitions, 636 flow [2024-10-14 14:23:06,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 115 transitions, 592 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-10-14 14:23:06,418 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 206 flow [2024-10-14 14:23:06,418 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2024-10-14 14:23:06,419 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2024-10-14 14:23:06,419 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 206 flow [2024-10-14 14:23:06,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 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-10-14 14:23:06,420 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:23:06,420 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:23:06,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 14:23:06,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:23:06,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:23:06,421 INFO L85 PathProgramCache]: Analyzing trace with hash 884972759, now seen corresponding path program 6 times [2024-10-14 14:23:06,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:23:06,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015043532] [2024-10-14 14:23:06,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:23:06,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:23:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:23:06,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 14:23:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:23:06,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 14:23:06,572 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 14:23:06,573 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-10-14 14:23:06,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-10-14 14:23:06,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-10-14 14:23:06,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-14 14:23:06,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-14 14:23:06,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-14 14:23:06,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-10-14 14:23:06,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 14:23:06,576 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-10-14 14:23:06,691 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 14:23:06,691 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 14:23:06,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:23:06 BasicIcfg [2024-10-14 14:23:06,700 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 14:23:06,701 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 14:23:06,701 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 14:23:06,701 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 14:23:06,702 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:22:51" (3/4) ... [2024-10-14 14:23:06,703 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 14:23:06,807 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 14:23:06,807 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 14:23:06,808 INFO L158 Benchmark]: Toolchain (without parser) took 16813.79ms. Allocated memory was 178.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 109.6MB in the beginning and 878.7MB in the end (delta: -769.1MB). Peak memory consumption was 522.9MB. Max. memory is 16.1GB. [2024-10-14 14:23:06,808 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:23:06,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.77ms. Allocated memory is still 178.3MB. Free memory was 109.4MB in the beginning and 142.6MB in the end (delta: -33.3MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-10-14 14:23:06,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.34ms. Allocated memory is still 178.3MB. Free memory was 142.6MB in the beginning and 139.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 14:23:06,810 INFO L158 Benchmark]: Boogie Preprocessor took 66.07ms. Allocated memory is still 178.3MB. Free memory was 139.9MB in the beginning and 136.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 14:23:06,810 INFO L158 Benchmark]: RCFGBuilder took 757.48ms. Allocated memory is still 178.3MB. Free memory was 136.4MB in the beginning and 83.3MB in the end (delta: 53.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-14 14:23:06,810 INFO L158 Benchmark]: TraceAbstraction took 15183.99ms. Allocated memory was 178.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 82.6MB in the beginning and 897.6MB in the end (delta: -815.0MB). Peak memory consumption was 477.9MB. Max. memory is 16.1GB. [2024-10-14 14:23:06,811 INFO L158 Benchmark]: Witness Printer took 106.23ms. Allocated memory is still 1.5GB. Free memory was 897.6MB in the beginning and 878.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 14:23:06,812 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.16ms. Allocated memory is still 104.9MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.77ms. Allocated memory is still 178.3MB. Free memory was 109.4MB in the beginning and 142.6MB in the end (delta: -33.3MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.34ms. Allocated memory is still 178.3MB. Free memory was 142.6MB in the beginning and 139.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.07ms. Allocated memory is still 178.3MB. Free memory was 139.9MB in the beginning and 136.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 757.48ms. Allocated memory is still 178.3MB. Free memory was 136.4MB in the beginning and 83.3MB in the end (delta: 53.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15183.99ms. Allocated memory was 178.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 82.6MB in the beginning and 897.6MB in the end (delta: -815.0MB). Peak memory consumption was 477.9MB. Max. memory is 16.1GB. * Witness Printer took 106.23ms. Allocated memory is still 1.5GB. Free memory was 897.6MB in the beginning and 878.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L859] 0 pthread_t t605; [L860] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t605=-3, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L861] 0 pthread_t t606; [L862] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t605=-3, t606=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L863] 0 pthread_t t607; [L864] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t605=-3, t606=-2, t607=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 y$w_buff1 = y$w_buff0 [L799] 3 y$w_buff0 = 1 [L800] 3 y$w_buff1_used = y$w_buff0_used [L801] 3 y$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L803] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L804] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L805] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L806] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L807] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L808] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L865] 0 pthread_t t608; [L866] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t605=-3, t606=-2, t607=-1, t608=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L811] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L828] 4 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L834] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L770] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 y$flush_delayed = weak$$choice2 [L776] 2 y$mem_tmp = y [L777] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = y [L785] 2 y = y$flush_delayed ? y$mem_tmp : y [L786] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L837] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L838] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L839] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L840] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L841] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L814] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t605=-3, t606=-2, t607=-1, t608=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L873] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L874] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L875] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L876] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t605=-3, t606=-2, t607=-1, t608=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t605=-3, t606=-2, t607=-1, t608=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: 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: 862]: 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: 860]: 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: 866]: 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: 864]: 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 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 608 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 585 mSDsluCounter, 182 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1444 IncrementalHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 12 mSDtfsCounter, 1444 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=9, InterpolantAutomatonStates: 56, 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.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 1542 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-10-14 14:23:06,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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