./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/mix005.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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/mix005.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 0c4e58b38f229da1b25a4c7b1c830f1f36e4dc5c1e18903f04a209f4b4cfa3c5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:21:36,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:21:36,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:21:36,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:21:36,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:21:36,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:21:36,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:21:36,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:21:36,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:21:36,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:21:36,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:21:36,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:21:36,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:21:36,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:21:36,580 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:21:36,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:21:36,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:21:36,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:21:36,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:21:36,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:21:36,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:21:36,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:21:36,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:21:36,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:21:36,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:21:36,583 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:21:36,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:21:36,584 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:21:36,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:21:36,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:21:36,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:21:36,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:21:36,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:21:36,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:21:36,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:21:36,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:21:36,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:21:36,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:21:36,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:21:36,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:21:36,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:21:36,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:21:36,589 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 -> 0c4e58b38f229da1b25a4c7b1c830f1f36e4dc5c1e18903f04a209f4b4cfa3c5 [2024-11-20 09:21:36,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:21:36,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:21:36,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:21:36,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:21:36,809 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:21:36,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix005.opt.i [2024-11-20 09:21:38,042 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:21:38,231 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:21:38,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix005.opt.i [2024-11-20 09:21:38,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9784fbf6c/06d1bfa63f614157811cd3e8e19c766d/FLAG230a1f3ab [2024-11-20 09:21:38,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9784fbf6c/06d1bfa63f614157811cd3e8e19c766d [2024-11-20 09:21:38,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:21:38,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:21:38,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:21:38,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:21:38,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:21:38,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:21:38" (1/1) ... [2024-11-20 09:21:38,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dbbc482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38, skipping insertion in model container [2024-11-20 09:21:38,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:21:38" (1/1) ... [2024-11-20 09:21:38,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:21:38,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix005.opt.i[944,957] [2024-11-20 09:21:38,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:21:38,631 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:21:38,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix005.opt.i[944,957] [2024-11-20 09:21:38,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:21:38,772 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:21:38,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38 WrapperNode [2024-11-20 09:21:38,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:21:38,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:21:38,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:21:38,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:21:38,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38" (1/1) ... [2024-11-20 09:21:38,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38" (1/1) ... [2024-11-20 09:21:38,824 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2024-11-20 09:21:38,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:21:38,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:21:38,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:21:38,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:21:38,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38" (1/1) ... [2024-11-20 09:21:38,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38" (1/1) ... [2024-11-20 09:21:38,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38" (1/1) ... [2024-11-20 09:21:38,863 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 09:21:38,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38" (1/1) ... [2024-11-20 09:21:38,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38" (1/1) ... [2024-11-20 09:21:38,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38" (1/1) ... [2024-11-20 09:21:38,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38" (1/1) ... [2024-11-20 09:21:38,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38" (1/1) ... [2024-11-20 09:21:38,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38" (1/1) ... [2024-11-20 09:21:38,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:21:38,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:21:38,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:21:38,890 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:21:38,891 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38" (1/1) ... [2024-11-20 09:21:38,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:21:38,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:21:38,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 09:21:38,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 09:21:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 09:21:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:21:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-20 09:21:38,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-20 09:21:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-20 09:21:38,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-20 09:21:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-20 09:21:38,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-20 09:21:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-20 09:21:38,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-20 09:21:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 09:21:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 09:21:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:21:38,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:21:38,958 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 09:21:39,066 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:21:39,068 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:21:39,329 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 09:21:39,329 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:21:39,482 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:21:39,483 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 09:21:39,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:21:39 BoogieIcfgContainer [2024-11-20 09:21:39,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:21:39,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:21:39,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:21:39,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:21:39,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:21:38" (1/3) ... [2024-11-20 09:21:39,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d02d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:21:39, skipping insertion in model container [2024-11-20 09:21:39,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:38" (2/3) ... [2024-11-20 09:21:39,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d02d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:21:39, skipping insertion in model container [2024-11-20 09:21:39,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:21:39" (3/3) ... [2024-11-20 09:21:39,492 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005.opt.i [2024-11-20 09:21:39,506 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:21:39,506 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 09:21:39,506 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 09:21:39,560 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 09:21:39,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2024-11-20 09:21:39,636 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-11-20 09:21:39,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 09:21:39,639 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 5. Compared 97 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-11-20 09:21:39,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2024-11-20 09:21:39,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2024-11-20 09:21:39,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:21:39,656 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;@71c96528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:21:39,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-20 09:21:39,666 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 09:21:39,666 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-20 09:21:39,666 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 09:21:39,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:21:39,667 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:21:39,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:21:39,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:21:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1282439787, now seen corresponding path program 1 times [2024-11-20 09:21:39,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:21:39,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872415297] [2024-11-20 09:21:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:21:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:21:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:21:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:21:40,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:21:40,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872415297] [2024-11-20 09:21:40,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872415297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:21:40,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:21:40,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 09:21:40,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897650697] [2024-11-20 09:21:40,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:21:40,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:21:40,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:21:40,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:21:40,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:21:40,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 50 [2024-11-20 09:21:40,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:40,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:21:40,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 50 [2024-11-20 09:21:40,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:21:40,393 INFO L124 PetriNetUnfolderBase]: 879/1527 cut-off events. [2024-11-20 09:21:40,393 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 09:21:40,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1527 events. 879/1527 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10676 event pairs, 159 based on Foata normal form. 60/1531 useless extension candidates. Maximal degree in co-relation 2835. Up to 1009 conditions per place. [2024-11-20 09:21:40,409 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 26 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-20 09:21:40,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 178 flow [2024-11-20 09:21:40,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:21:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:21:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-20 09:21:40,420 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.76 [2024-11-20 09:21:40,421 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 114 transitions. [2024-11-20 09:21:40,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 178 flow [2024-11-20 09:21:40,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 09:21:40,427 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2024-11-20 09:21:40,430 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-11-20 09:21:40,433 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2024-11-20 09:21:40,433 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2024-11-20 09:21:40,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:40,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:21:40,434 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:21:40,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:21:40,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:21:40,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:21:40,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1465234930, now seen corresponding path program 1 times [2024-11-20 09:21:40,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:21:40,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329094727] [2024-11-20 09:21:40,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:21:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:21:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:21:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:21:40,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:21:40,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329094727] [2024-11-20 09:21:40,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329094727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:21:40,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:21:40,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:21:40,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003989598] [2024-11-20 09:21:40,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:21:40,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:21:40,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:21:40,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:21:40,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:21:40,704 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-11-20 09:21:40,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:40,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:21:40,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-11-20 09:21:40,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:21:42,790 INFO L124 PetriNetUnfolderBase]: 14679/22002 cut-off events. [2024-11-20 09:21:42,790 INFO L125 PetriNetUnfolderBase]: For 846/846 co-relation queries the response was YES. [2024-11-20 09:21:42,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43142 conditions, 22002 events. 14679/22002 cut-off events. For 846/846 co-relation queries the response was YES. Maximal size of possible extension queue 1258. Compared 163695 event pairs, 3992 based on Foata normal form. 0/21321 useless extension candidates. Maximal degree in co-relation 43132. Up to 9077 conditions per place. [2024-11-20 09:21:42,899 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 41 selfloop transitions, 8 changer transitions 84/148 dead transitions. [2024-11-20 09:21:42,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 148 transitions, 592 flow [2024-11-20 09:21:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:21:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-20 09:21:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 306 transitions. [2024-11-20 09:21:42,903 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-11-20 09:21:42,903 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 9 states and 306 transitions. [2024-11-20 09:21:42,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 148 transitions, 592 flow [2024-11-20 09:21:42,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 148 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 09:21:42,923 INFO L231 Difference]: Finished difference. Result has 68 places, 49 transitions, 204 flow [2024-11-20 09:21:42,923 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=204, PETRI_PLACES=68, PETRI_TRANSITIONS=49} [2024-11-20 09:21:42,925 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2024-11-20 09:21:42,925 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 49 transitions, 204 flow [2024-11-20 09:21:42,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:42,926 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:21:42,926 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:21:42,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:21:42,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:21:42,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:21:42,927 INFO L85 PathProgramCache]: Analyzing trace with hash -239089613, now seen corresponding path program 1 times [2024-11-20 09:21:42,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:21:42,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857175103] [2024-11-20 09:21:42,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:21:42,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:21:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:21:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:21:43,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:21:43,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857175103] [2024-11-20 09:21:43,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857175103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:21:43,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:21:43,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:21:43,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988555086] [2024-11-20 09:21:43,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:21:43,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:21:43,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:21:43,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:21:43,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:21:43,132 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-11-20 09:21:43,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 49 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:43,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:21:43,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-11-20 09:21:43,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:21:44,749 INFO L124 PetriNetUnfolderBase]: 10337/16473 cut-off events. [2024-11-20 09:21:44,749 INFO L125 PetriNetUnfolderBase]: For 25213/25273 co-relation queries the response was YES. [2024-11-20 09:21:44,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51067 conditions, 16473 events. 10337/16473 cut-off events. For 25213/25273 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 126479 event pairs, 1897 based on Foata normal form. 450/16837 useless extension candidates. Maximal degree in co-relation 51049. Up to 6057 conditions per place. [2024-11-20 09:21:44,826 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 50 selfloop transitions, 9 changer transitions 76/150 dead transitions. [2024-11-20 09:21:44,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 150 transitions, 1006 flow [2024-11-20 09:21:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 09:21:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 09:21:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 312 transitions. [2024-11-20 09:21:44,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.624 [2024-11-20 09:21:44,828 INFO L175 Difference]: Start difference. First operand has 68 places, 49 transitions, 204 flow. Second operand 10 states and 312 transitions. [2024-11-20 09:21:44,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 150 transitions, 1006 flow [2024-11-20 09:21:44,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 150 transitions, 856 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-11-20 09:21:44,894 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 270 flow [2024-11-20 09:21:44,895 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=270, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2024-11-20 09:21:44,895 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2024-11-20 09:21:44,895 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 270 flow [2024-11-20 09:21:44,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:44,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:21:44,896 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:21:44,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:21:44,896 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:21:44,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:21:44,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1980847414, now seen corresponding path program 1 times [2024-11-20 09:21:44,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:21:44,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602215782] [2024-11-20 09:21:44,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:21:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:21:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:21:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:21:45,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:21:45,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602215782] [2024-11-20 09:21:45,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602215782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:21:45,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:21:45,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:21:45,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892614543] [2024-11-20 09:21:45,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:21:45,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:21:45,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:21:45,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:21:45,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:21:45,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-11-20 09:21:45,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 54 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:45,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:21:45,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-11-20 09:21:45,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:21:46,614 INFO L124 PetriNetUnfolderBase]: 7635/13292 cut-off events. [2024-11-20 09:21:46,614 INFO L125 PetriNetUnfolderBase]: For 26047/26335 co-relation queries the response was YES. [2024-11-20 09:21:46,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40394 conditions, 13292 events. 7635/13292 cut-off events. For 26047/26335 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 110558 event pairs, 3711 based on Foata normal form. 330/13317 useless extension candidates. Maximal degree in co-relation 40369. Up to 7913 conditions per place. [2024-11-20 09:21:46,702 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 45 selfloop transitions, 6 changer transitions 35/109 dead transitions. [2024-11-20 09:21:46,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 109 transitions, 724 flow [2024-11-20 09:21:46,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:21:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 09:21:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2024-11-20 09:21:46,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6514285714285715 [2024-11-20 09:21:46,703 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 270 flow. Second operand 7 states and 228 transitions. [2024-11-20 09:21:46,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 109 transitions, 724 flow [2024-11-20 09:21:46,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 109 transitions, 691 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-11-20 09:21:46,835 INFO L231 Difference]: Finished difference. Result has 75 places, 58 transitions, 331 flow [2024-11-20 09:21:46,835 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=331, PETRI_PLACES=75, PETRI_TRANSITIONS=58} [2024-11-20 09:21:46,836 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2024-11-20 09:21:46,836 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 58 transitions, 331 flow [2024-11-20 09:21:46,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:46,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:21:46,837 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-11-20 09:21:46,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:21:46,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:21:46,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:21:46,837 INFO L85 PathProgramCache]: Analyzing trace with hash 70593429, now seen corresponding path program 1 times [2024-11-20 09:21:46,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:21:46,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137366083] [2024-11-20 09:21:46,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:21:46,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:21:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:21:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:21:47,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:21:47,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137366083] [2024-11-20 09:21:47,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137366083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:21:47,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:21:47,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:21:47,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960672496] [2024-11-20 09:21:47,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:21:47,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:21:47,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:21:47,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:21:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:21:47,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-11-20 09:21:47,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 58 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:47,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:21:47,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-11-20 09:21:47,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:21:48,281 INFO L124 PetriNetUnfolderBase]: 8358/13610 cut-off events. [2024-11-20 09:21:48,281 INFO L125 PetriNetUnfolderBase]: For 30096/30141 co-relation queries the response was YES. [2024-11-20 09:21:48,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45329 conditions, 13610 events. 8358/13610 cut-off events. For 30096/30141 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 103257 event pairs, 1215 based on Foata normal form. 272/13799 useless extension candidates. Maximal degree in co-relation 45302. Up to 5878 conditions per place. [2024-11-20 09:21:48,374 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 64 selfloop transitions, 16 changer transitions 64/159 dead transitions. [2024-11-20 09:21:48,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 159 transitions, 1215 flow [2024-11-20 09:21:48,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 09:21:48,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 09:21:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 311 transitions. [2024-11-20 09:21:48,376 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.622 [2024-11-20 09:21:48,376 INFO L175 Difference]: Start difference. First operand has 75 places, 58 transitions, 331 flow. Second operand 10 states and 311 transitions. [2024-11-20 09:21:48,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 159 transitions, 1215 flow [2024-11-20 09:21:48,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 159 transitions, 1153 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-11-20 09:21:48,525 INFO L231 Difference]: Finished difference. Result has 82 places, 67 transitions, 478 flow [2024-11-20 09:21:48,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=478, PETRI_PLACES=82, PETRI_TRANSITIONS=67} [2024-11-20 09:21:48,527 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 24 predicate places. [2024-11-20 09:21:48,527 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 478 flow [2024-11-20 09:21:48,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:48,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:21:48,528 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] [2024-11-20 09:21:48,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:21:48,529 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:21:48,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:21:48,531 INFO L85 PathProgramCache]: Analyzing trace with hash -983708820, now seen corresponding path program 1 times [2024-11-20 09:21:48,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:21:48,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080704280] [2024-11-20 09:21:48,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:21:48,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:21:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:21:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:21:48,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:21:48,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080704280] [2024-11-20 09:21:48,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080704280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:21:48,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:21:48,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:21:48,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572797389] [2024-11-20 09:21:48,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:21:48,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:21:48,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:21:48,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:21:48,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:21:48,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-11-20 09:21:48,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 478 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:48,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:21:48,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-11-20 09:21:48,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:21:51,133 INFO L124 PetriNetUnfolderBase]: 16074/24503 cut-off events. [2024-11-20 09:21:51,133 INFO L125 PetriNetUnfolderBase]: For 51626/55004 co-relation queries the response was YES. [2024-11-20 09:21:51,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71216 conditions, 24503 events. 16074/24503 cut-off events. For 51626/55004 co-relation queries the response was YES. Maximal size of possible extension queue 1297. Compared 184085 event pairs, 2794 based on Foata normal form. 1113/24733 useless extension candidates. Maximal degree in co-relation 71185. Up to 12116 conditions per place. [2024-11-20 09:21:51,335 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 59 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2024-11-20 09:21:51,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 103 transitions, 784 flow [2024-11-20 09:21:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:21:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 09:21:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2024-11-20 09:21:51,337 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.715 [2024-11-20 09:21:51,337 INFO L175 Difference]: Start difference. First operand has 82 places, 67 transitions, 478 flow. Second operand 4 states and 143 transitions. [2024-11-20 09:21:51,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 103 transitions, 784 flow [2024-11-20 09:21:51,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 103 transitions, 762 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-20 09:21:51,559 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 502 flow [2024-11-20 09:21:51,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=502, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2024-11-20 09:21:51,560 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2024-11-20 09:21:51,560 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 502 flow [2024-11-20 09:21:51,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:51,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:21:51,561 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] [2024-11-20 09:21:51,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:21:51,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:21:51,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:21:51,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1875437511, now seen corresponding path program 1 times [2024-11-20 09:21:51,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:21:51,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400791195] [2024-11-20 09:21:51,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:21:51,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:21:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:21:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:21:51,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:21:51,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400791195] [2024-11-20 09:21:51,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400791195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:21:51,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:21:51,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:21:51,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688551390] [2024-11-20 09:21:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:21:51,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:21:51,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:21:51,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:21:51,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:21:51,817 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-11-20 09:21:51,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:51,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:21:51,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-11-20 09:21:51,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:21:54,513 INFO L124 PetriNetUnfolderBase]: 19384/30042 cut-off events. [2024-11-20 09:21:54,513 INFO L125 PetriNetUnfolderBase]: For 71212/72525 co-relation queries the response was YES. [2024-11-20 09:21:54,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99998 conditions, 30042 events. 19384/30042 cut-off events. For 71212/72525 co-relation queries the response was YES. Maximal size of possible extension queue 1434. Compared 236681 event pairs, 8089 based on Foata normal form. 408/27854 useless extension candidates. Maximal degree in co-relation 99968. Up to 13378 conditions per place. [2024-11-20 09:21:54,807 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 90 selfloop transitions, 21 changer transitions 8/139 dead transitions. [2024-11-20 09:21:54,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 139 transitions, 1058 flow [2024-11-20 09:21:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:21:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:21:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 251 transitions. [2024-11-20 09:21:54,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6275 [2024-11-20 09:21:54,809 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 502 flow. Second operand 8 states and 251 transitions. [2024-11-20 09:21:54,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 139 transitions, 1058 flow [2024-11-20 09:21:54,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 139 transitions, 1042 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-11-20 09:21:54,904 INFO L231 Difference]: Finished difference. Result has 86 places, 75 transitions, 599 flow [2024-11-20 09:21:54,904 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=599, PETRI_PLACES=86, PETRI_TRANSITIONS=75} [2024-11-20 09:21:54,905 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 28 predicate places. [2024-11-20 09:21:54,905 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 75 transitions, 599 flow [2024-11-20 09:21:54,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:54,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:21:54,905 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] [2024-11-20 09:21:54,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:21:54,906 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:21:54,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:21:54,906 INFO L85 PathProgramCache]: Analyzing trace with hash 719110203, now seen corresponding path program 1 times [2024-11-20 09:21:54,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:21:54,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489726779] [2024-11-20 09:21:54,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:21:54,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:21:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:21:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:21:55,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:21:55,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489726779] [2024-11-20 09:21:55,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489726779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:21:55,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:21:55,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:21:55,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019349644] [2024-11-20 09:21:55,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:21:55,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:21:55,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:21:55,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:21:55,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:21:55,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-11-20 09:21:55,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 75 transitions, 599 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:55,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:21:55,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-11-20 09:21:55,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:21:57,708 INFO L124 PetriNetUnfolderBase]: 19266/29660 cut-off events. [2024-11-20 09:21:57,708 INFO L125 PetriNetUnfolderBase]: For 58503/62883 co-relation queries the response was YES. [2024-11-20 09:21:57,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92024 conditions, 29660 events. 19266/29660 cut-off events. For 58503/62883 co-relation queries the response was YES. Maximal size of possible extension queue 1519. Compared 227664 event pairs, 1974 based on Foata normal form. 1511/30447 useless extension candidates. Maximal degree in co-relation 91989. Up to 11568 conditions per place. [2024-11-20 09:21:57,905 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 76 selfloop transitions, 10 changer transitions 3/126 dead transitions. [2024-11-20 09:21:57,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 126 transitions, 1040 flow [2024-11-20 09:21:57,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:21:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:21:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2024-11-20 09:21:57,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.732 [2024-11-20 09:21:57,906 INFO L175 Difference]: Start difference. First operand has 86 places, 75 transitions, 599 flow. Second operand 5 states and 183 transitions. [2024-11-20 09:21:57,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 126 transitions, 1040 flow [2024-11-20 09:21:58,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 126 transitions, 1014 flow, removed 13 selfloop flow, removed 0 redundant places. [2024-11-20 09:21:58,075 INFO L231 Difference]: Finished difference. Result has 92 places, 77 transitions, 612 flow [2024-11-20 09:21:58,075 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=612, PETRI_PLACES=92, PETRI_TRANSITIONS=77} [2024-11-20 09:21:58,076 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 34 predicate places. [2024-11-20 09:21:58,076 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 77 transitions, 612 flow [2024-11-20 09:21:58,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:58,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:21:58,076 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:21:58,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:21:58,076 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:21:58,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:21:58,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1307192201, now seen corresponding path program 1 times [2024-11-20 09:21:58,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:21:58,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595898934] [2024-11-20 09:21:58,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:21:58,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:21:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:21:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:21:58,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:21:58,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595898934] [2024-11-20 09:21:58,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595898934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:21:58,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:21:58,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:21:58,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643500078] [2024-11-20 09:21:58,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:21:58,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:21:58,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:21:58,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:21:58,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:21:58,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2024-11-20 09:21:58,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 77 transitions, 612 flow. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:21:58,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:21:58,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2024-11-20 09:21:58,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:22:02,224 INFO L124 PetriNetUnfolderBase]: 25893/42609 cut-off events. [2024-11-20 09:22:02,225 INFO L125 PetriNetUnfolderBase]: For 128127/134524 co-relation queries the response was YES. [2024-11-20 09:22:02,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145490 conditions, 42609 events. 25893/42609 cut-off events. For 128127/134524 co-relation queries the response was YES. Maximal size of possible extension queue 2328. Compared 378661 event pairs, 6424 based on Foata normal form. 661/40019 useless extension candidates. Maximal degree in co-relation 145451. Up to 13218 conditions per place. [2024-11-20 09:22:02,569 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 101 selfloop transitions, 36 changer transitions 15/176 dead transitions. [2024-11-20 09:22:02,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 176 transitions, 1579 flow [2024-11-20 09:22:02,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:22:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:22:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 261 transitions. [2024-11-20 09:22:02,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6525 [2024-11-20 09:22:02,571 INFO L175 Difference]: Start difference. First operand has 92 places, 77 transitions, 612 flow. Second operand 8 states and 261 transitions. [2024-11-20 09:22:02,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 176 transitions, 1579 flow [2024-11-20 09:22:03,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 176 transitions, 1548 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-11-20 09:22:03,077 INFO L231 Difference]: Finished difference. Result has 98 places, 96 transitions, 970 flow [2024-11-20 09:22:03,077 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=970, PETRI_PLACES=98, PETRI_TRANSITIONS=96} [2024-11-20 09:22:03,078 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 40 predicate places. [2024-11-20 09:22:03,078 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 96 transitions, 970 flow [2024-11-20 09:22:03,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:22:03,078 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:03,078 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:22:03,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:22:03,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:03,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:03,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1587463403, now seen corresponding path program 2 times [2024-11-20 09:22:03,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:03,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039769301] [2024-11-20 09:22:03,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:03,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:22:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:22:03,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:22:03,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039769301] [2024-11-20 09:22:03,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039769301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:22:03,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:22:03,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:22:03,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128562391] [2024-11-20 09:22:03,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:22:03,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:22:03,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:22:03,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:22:03,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:22:03,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-11-20 09:22:03,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 96 transitions, 970 flow. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:22:03,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:22:03,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-11-20 09:22:03,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:22:07,671 INFO L124 PetriNetUnfolderBase]: 27120/41126 cut-off events. [2024-11-20 09:22:07,671 INFO L125 PetriNetUnfolderBase]: For 106364/116771 co-relation queries the response was YES. [2024-11-20 09:22:07,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138429 conditions, 41126 events. 27120/41126 cut-off events. For 106364/116771 co-relation queries the response was YES. Maximal size of possible extension queue 2337. Compared 323845 event pairs, 1859 based on Foata normal form. 2222/42001 useless extension candidates. Maximal degree in co-relation 138387. Up to 13584 conditions per place. [2024-11-20 09:22:07,967 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 93 selfloop transitions, 14 changer transitions 11/168 dead transitions. [2024-11-20 09:22:07,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 168 transitions, 1704 flow [2024-11-20 09:22:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:22:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:22:07,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2024-11-20 09:22:07,968 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7366666666666667 [2024-11-20 09:22:07,968 INFO L175 Difference]: Start difference. First operand has 98 places, 96 transitions, 970 flow. Second operand 6 states and 221 transitions. [2024-11-20 09:22:07,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 168 transitions, 1704 flow [2024-11-20 09:22:08,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 168 transitions, 1628 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-11-20 09:22:08,091 INFO L231 Difference]: Finished difference. Result has 104 places, 98 transitions, 962 flow [2024-11-20 09:22:08,092 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=962, PETRI_PLACES=104, PETRI_TRANSITIONS=98} [2024-11-20 09:22:08,093 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 46 predicate places. [2024-11-20 09:22:08,093 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 98 transitions, 962 flow [2024-11-20 09:22:08,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:22:08,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:08,093 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] [2024-11-20 09:22:08,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:22:08,093 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:08,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:08,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1173829625, now seen corresponding path program 1 times [2024-11-20 09:22:08,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:08,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603082458] [2024-11-20 09:22:08,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:08,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:22:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:22:08,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:22:08,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603082458] [2024-11-20 09:22:08,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603082458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:22:08,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:22:08,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:22:08,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205690417] [2024-11-20 09:22:08,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:22:08,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:22:08,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:22:08,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:22:08,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:22:08,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-11-20 09:22:08,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 98 transitions, 962 flow. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:22:08,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:22:08,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-11-20 09:22:08,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:22:12,238 INFO L124 PetriNetUnfolderBase]: 23795/35969 cut-off events. [2024-11-20 09:22:12,238 INFO L125 PetriNetUnfolderBase]: For 124587/135958 co-relation queries the response was YES. [2024-11-20 09:22:12,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135923 conditions, 35969 events. 23795/35969 cut-off events. For 124587/135958 co-relation queries the response was YES. Maximal size of possible extension queue 2317. Compared 283471 event pairs, 1759 based on Foata normal form. 1336/35985 useless extension candidates. Maximal degree in co-relation 135878. Up to 13484 conditions per place. [2024-11-20 09:22:12,472 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 75 selfloop transitions, 18 changer transitions 22/155 dead transitions. [2024-11-20 09:22:12,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 155 transitions, 1489 flow [2024-11-20 09:22:12,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:22:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 09:22:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 241 transitions. [2024-11-20 09:22:12,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6885714285714286 [2024-11-20 09:22:12,474 INFO L175 Difference]: Start difference. First operand has 104 places, 98 transitions, 962 flow. Second operand 7 states and 241 transitions. [2024-11-20 09:22:12,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 155 transitions, 1489 flow [2024-11-20 09:22:13,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 155 transitions, 1392 flow, removed 28 selfloop flow, removed 10 redundant places. [2024-11-20 09:22:13,082 INFO L231 Difference]: Finished difference. Result has 99 places, 86 transitions, 752 flow [2024-11-20 09:22:13,082 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=752, PETRI_PLACES=99, PETRI_TRANSITIONS=86} [2024-11-20 09:22:13,083 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 41 predicate places. [2024-11-20 09:22:13,083 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 86 transitions, 752 flow [2024-11-20 09:22:13,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:22:13,083 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:13,083 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-11-20 09:22:13,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 09:22:13,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:13,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2114408251, now seen corresponding path program 1 times [2024-11-20 09:22:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:13,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439598808] [2024-11-20 09:22:13,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:13,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:22:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:22:13,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:22:13,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439598808] [2024-11-20 09:22:13,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439598808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:22:13,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:22:13,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:22:13,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25761817] [2024-11-20 09:22:13,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:22:13,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:22:13,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:22:13,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:22:13,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:22:13,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-11-20 09:22:13,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 86 transitions, 752 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:22:13,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:22:13,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-11-20 09:22:13,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:22:15,642 INFO L124 PetriNetUnfolderBase]: 10909/20254 cut-off events. [2024-11-20 09:22:15,642 INFO L125 PetriNetUnfolderBase]: For 53952/59030 co-relation queries the response was YES. [2024-11-20 09:22:15,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65903 conditions, 20254 events. 10909/20254 cut-off events. For 53952/59030 co-relation queries the response was YES. Maximal size of possible extension queue 1648. Compared 195641 event pairs, 2838 based on Foata normal form. 243/17988 useless extension candidates. Maximal degree in co-relation 65863. Up to 6816 conditions per place. [2024-11-20 09:22:15,770 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 51 selfloop transitions, 5 changer transitions 12/122 dead transitions. [2024-11-20 09:22:15,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 122 transitions, 1034 flow [2024-11-20 09:22:15,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:22:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:22:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2024-11-20 09:22:15,772 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6366666666666667 [2024-11-20 09:22:15,772 INFO L175 Difference]: Start difference. First operand has 99 places, 86 transitions, 752 flow. Second operand 6 states and 191 transitions. [2024-11-20 09:22:15,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 122 transitions, 1034 flow [2024-11-20 09:22:16,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 122 transitions, 912 flow, removed 40 selfloop flow, removed 8 redundant places. [2024-11-20 09:22:16,139 INFO L231 Difference]: Finished difference. Result has 99 places, 87 transitions, 682 flow [2024-11-20 09:22:16,139 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=682, PETRI_PLACES=99, PETRI_TRANSITIONS=87} [2024-11-20 09:22:16,140 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 41 predicate places. [2024-11-20 09:22:16,140 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 87 transitions, 682 flow [2024-11-20 09:22:16,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:22:16,140 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:16,140 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-11-20 09:22:16,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 09:22:16,140 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:16,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:16,141 INFO L85 PathProgramCache]: Analyzing trace with hash -182953301, now seen corresponding path program 2 times [2024-11-20 09:22:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:16,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040720583] [2024-11-20 09:22:16,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:16,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:22:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:22:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:22:17,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040720583] [2024-11-20 09:22:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040720583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:22:17,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:22:17,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 09:22:17,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706990205] [2024-11-20 09:22:17,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:22:17,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 09:22:17,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:22:17,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 09:22:17,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:22:17,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2024-11-20 09:22:17,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 87 transitions, 682 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:22:17,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:22:17,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2024-11-20 09:22:17,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:22:20,175 INFO L124 PetriNetUnfolderBase]: 13114/26142 cut-off events. [2024-11-20 09:22:20,175 INFO L125 PetriNetUnfolderBase]: For 36289/39341 co-relation queries the response was YES. [2024-11-20 09:22:20,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73371 conditions, 26142 events. 13114/26142 cut-off events. For 36289/39341 co-relation queries the response was YES. Maximal size of possible extension queue 2154. Compared 276586 event pairs, 2142 based on Foata normal form. 262/23588 useless extension candidates. Maximal degree in co-relation 73332. Up to 6895 conditions per place. [2024-11-20 09:22:20,342 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 46 selfloop transitions, 18 changer transitions 16/140 dead transitions. [2024-11-20 09:22:20,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 140 transitions, 1008 flow [2024-11-20 09:22:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 09:22:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-20 09:22:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 362 transitions. [2024-11-20 09:22:20,345 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6033333333333334 [2024-11-20 09:22:20,345 INFO L175 Difference]: Start difference. First operand has 99 places, 87 transitions, 682 flow. Second operand 12 states and 362 transitions. [2024-11-20 09:22:20,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 140 transitions, 1008 flow [2024-11-20 09:22:21,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 140 transitions, 1001 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-20 09:22:21,262 INFO L231 Difference]: Finished difference. Result has 110 places, 96 transitions, 784 flow [2024-11-20 09:22:21,262 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=784, PETRI_PLACES=110, PETRI_TRANSITIONS=96} [2024-11-20 09:22:21,263 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 52 predicate places. [2024-11-20 09:22:21,263 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 96 transitions, 784 flow [2024-11-20 09:22:21,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:22:21,263 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:21,264 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-11-20 09:22:21,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 09:22:21,264 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:21,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:21,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1449993345, now seen corresponding path program 3 times [2024-11-20 09:22:21,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:21,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798345640] [2024-11-20 09:22:21,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:21,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:22:21,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 09:22:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:22:21,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 09:22:21,406 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 09:22:21,407 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-20 09:22:21,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-20 09:22:21,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-20 09:22:21,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-20 09:22:21,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-20 09:22:21,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-20 09:22:21,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-20 09:22:21,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 09:22:21,410 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:22:21,495 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 09:22:21,496 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 09:22:21,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:22:21 BasicIcfg [2024-11-20 09:22:21,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 09:22:21,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 09:22:21,501 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 09:22:21,501 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 09:22:21,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:21:39" (3/4) ... [2024-11-20 09:22:21,502 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-20 09:22:21,585 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 09:22:21,585 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 09:22:21,585 INFO L158 Benchmark]: Toolchain (without parser) took 43326.53ms. Allocated memory was 207.6MB in the beginning and 10.7GB in the end (delta: 10.5GB). Free memory was 138.3MB in the beginning and 8.5GB in the end (delta: -8.3GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-20 09:22:21,586 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 109.1MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:22:21,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.40ms. Allocated memory is still 207.6MB. Free memory was 138.1MB in the beginning and 172.1MB in the end (delta: -34.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-20 09:22:21,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.84ms. Allocated memory is still 207.6MB. Free memory was 171.3MB in the beginning and 168.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 09:22:21,586 INFO L158 Benchmark]: Boogie Preprocessor took 59.20ms. Allocated memory is still 207.6MB. Free memory was 168.8MB in the beginning and 165.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:22:21,587 INFO L158 Benchmark]: RCFGBuilder took 593.92ms. Allocated memory is still 207.6MB. Free memory was 165.0MB in the beginning and 105.0MB in the end (delta: 60.0MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-11-20 09:22:21,587 INFO L158 Benchmark]: TraceAbstraction took 42015.40ms. Allocated memory was 207.6MB in the beginning and 10.7GB in the end (delta: 10.5GB). Free memory was 104.2MB in the beginning and 8.5GB in the end (delta: -8.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-11-20 09:22:21,587 INFO L158 Benchmark]: Witness Printer took 84.59ms. Allocated memory is still 10.7GB. Free memory was 8.5GB in the beginning and 8.5GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 09:22:21,588 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.42ms. Allocated memory is still 109.1MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.40ms. Allocated memory is still 207.6MB. Free memory was 138.1MB in the beginning and 172.1MB in the end (delta: -34.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.84ms. Allocated memory is still 207.6MB. Free memory was 171.3MB in the beginning and 168.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.20ms. Allocated memory is still 207.6MB. Free memory was 168.8MB in the beginning and 165.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 593.92ms. Allocated memory is still 207.6MB. Free memory was 165.0MB in the beginning and 105.0MB in the end (delta: 60.0MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * TraceAbstraction took 42015.40ms. Allocated memory was 207.6MB in the beginning and 10.7GB in the end (delta: 10.5GB). Free memory was 104.2MB in the beginning and 8.5GB in the end (delta: -8.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 84.59ms. Allocated memory is still 10.7GB. Free memory was 8.5GB in the beginning and 8.5GB 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_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t125; [L870] FCALL, FORK 0 pthread_create(&t125, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t125=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t126; [L872] FCALL, FORK 0 pthread_create(&t126, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t125=-3, t126=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t127; [L874] FCALL, FORK 0 pthread_create(&t127, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t125=-3, t126=-2, t127=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t128; [L876] FCALL, FORK 0 pthread_create(&t128, ((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_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t125=-3, t126=-2, t127=-1, t128=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)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_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 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_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 __unbuffered_p3_EBX = a 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_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t125=-3, t126=-2, t127=-1, t128=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t125=-3, t126=-2, t127=-1, t128=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t125=-3, t126=-2, t127=-1, t128=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - 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: 872]: 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: 870]: 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: 876]: 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: 874]: 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: 41.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 37.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 927 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 870 mSDsluCounter, 360 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 265 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2055 IncrementalHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 95 mSDtfsCounter, 2055 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=970occurred in iteration=9, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 2497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-20 09:22:21,608 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