./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:34:45,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:34:45,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:34:45,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:34:45,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:34:45,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:34:45,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:34:45,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:34:45,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:34:45,514 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:34:45,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:34:45,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:34:45,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:34:45,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:34:45,515 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:34:45,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:34:45,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:34:45,517 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:34:45,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:34:45,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:34:45,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:34:45,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:34:45,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:34:45,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:34:45,518 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:34:45,518 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:34:45,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:34:45,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:34:45,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:34:45,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:34:45,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:34:45,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:34:45,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:34:45,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:34:45,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:34:45,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:34:45,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:34:45,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:34:45,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:34:45,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:34:45,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:34:45,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:34:45,523 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 -> 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d [2024-11-19 01:34:45,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:34:45,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:34:45,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:34:45,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:34:45,751 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:34:45,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2024-11-19 01:34:46,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:34:47,176 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:34:47,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2024-11-19 01:34:47,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f870aa3d/bf44dfc6369a4fe088c82efdc4f042c2/FLAGcc025f978 [2024-11-19 01:34:47,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f870aa3d/bf44dfc6369a4fe088c82efdc4f042c2 [2024-11-19 01:34:47,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:34:47,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:34:47,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:34:47,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:34:47,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:34:47,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:34:47" (1/1) ... [2024-11-19 01:34:47,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd6434d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47, skipping insertion in model container [2024-11-19 01:34:47,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:34:47" (1/1) ... [2024-11-19 01:34:47,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:34:47,438 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/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-11-19 01:34:47,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:34:47,572 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:34:47,581 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/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-11-19 01:34:47,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:34:47,654 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:34:47,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47 WrapperNode [2024-11-19 01:34:47,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:34:47,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:34:47,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:34:47,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:34:47,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47" (1/1) ... [2024-11-19 01:34:47,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47" (1/1) ... [2024-11-19 01:34:47,708 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2024-11-19 01:34:47,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:34:47,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:34:47,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:34:47,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:34:47,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47" (1/1) ... [2024-11-19 01:34:47,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47" (1/1) ... [2024-11-19 01:34:47,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47" (1/1) ... [2024-11-19 01:34:47,749 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-19 01:34:47,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47" (1/1) ... [2024-11-19 01:34:47,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47" (1/1) ... [2024-11-19 01:34:47,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47" (1/1) ... [2024-11-19 01:34:47,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47" (1/1) ... [2024-11-19 01:34:47,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47" (1/1) ... [2024-11-19 01:34:47,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47" (1/1) ... [2024-11-19 01:34:47,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:34:47,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:34:47,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:34:47,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:34:47,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47" (1/1) ... [2024-11-19 01:34:47,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:34:47,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:34:47,796 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-19 01:34:47,799 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-19 01:34:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 01:34:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:34:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 01:34:47,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 01:34:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 01:34:47,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 01:34:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 01:34:47,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 01:34:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:34:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 01:34:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:34:47,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:34:47,836 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 01:34:47,930 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:34:47,932 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:34:48,166 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:34:48,166 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:34:48,303 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:34:48,303 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 01:34:48,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:34:48 BoogieIcfgContainer [2024-11-19 01:34:48,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:34:48,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:34:48,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:34:48,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:34:48,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:34:47" (1/3) ... [2024-11-19 01:34:48,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbe0928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:34:48, skipping insertion in model container [2024-11-19 01:34:48,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:34:47" (2/3) ... [2024-11-19 01:34:48,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbe0928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:34:48, skipping insertion in model container [2024-11-19 01:34:48,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:34:48" (3/3) ... [2024-11-19 01:34:48,313 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2024-11-19 01:34:48,328 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:34:48,328 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 01:34:48,328 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:34:48,373 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:34:48,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-11-19 01:34:48,428 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-11-19 01:34:48,429 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:34:48,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-11-19 01:34:48,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-11-19 01:34:48,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-11-19 01:34:48,446 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:34:48,451 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;@521d2c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:34:48,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 01:34:48,456 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:34:48,456 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-19 01:34:48,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:34:48,457 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:48,457 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 01:34:48,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:48,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:48,462 INFO L85 PathProgramCache]: Analyzing trace with hash 10920666, now seen corresponding path program 1 times [2024-11-19 01:34:48,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:48,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451861785] [2024-11-19 01:34:48,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:34:48,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:34:48,837 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-19 01:34:48,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:48,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451861785] [2024-11-19 01:34:48,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451861785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:48,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:48,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 01:34:48,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714042003] [2024-11-19 01:34:48,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:48,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:34:48,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:48,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:34:48,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:34:48,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2024-11-19 01:34:48,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-19 01:34:48,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:48,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2024-11-19 01:34:48,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:49,177 INFO L124 PetriNetUnfolderBase]: 617/1111 cut-off events. [2024-11-19 01:34:49,178 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-19 01:34:49,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2088 conditions, 1111 events. 617/1111 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6300 event pairs, 343 based on Foata normal form. 48/1136 useless extension candidates. Maximal degree in co-relation 2077. Up to 763 conditions per place. [2024-11-19 01:34:49,189 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-11-19 01:34:49,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 177 flow [2024-11-19 01:34:49,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:34:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:34:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-19 01:34:49,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2024-11-19 01:34:49,204 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 90 transitions. [2024-11-19 01:34:49,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 177 flow [2024-11-19 01:34:49,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 01:34:49,210 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-11-19 01:34:49,212 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-11-19 01:34:49,214 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-11-19 01:34:49,214 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-11-19 01:34:49,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-19 01:34:49,215 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:49,215 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:34:49,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:34:49,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:49,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:49,217 INFO L85 PathProgramCache]: Analyzing trace with hash 182272408, now seen corresponding path program 1 times [2024-11-19 01:34:49,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:49,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247978084] [2024-11-19 01:34:49,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:34:49,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:34:49,431 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-19 01:34:49,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:49,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247978084] [2024-11-19 01:34:49,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247978084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:49,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:49,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:34:49,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073908173] [2024-11-19 01:34:49,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:49,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:34:49,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:49,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:34:49,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:34:49,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-11-19 01:34:49,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-19 01:34:49,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:49,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-11-19 01:34:49,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:50,440 INFO L124 PetriNetUnfolderBase]: 5113/8029 cut-off events. [2024-11-19 01:34:50,441 INFO L125 PetriNetUnfolderBase]: For 415/415 co-relation queries the response was YES. [2024-11-19 01:34:50,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16008 conditions, 8029 events. 5113/8029 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 53552 event pairs, 1114 based on Foata normal form. 0/7777 useless extension candidates. Maximal degree in co-relation 15998. Up to 2475 conditions per place. [2024-11-19 01:34:50,467 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 37 selfloop transitions, 6 changer transitions 79/130 dead transitions. [2024-11-19 01:34:50,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 130 transitions, 530 flow [2024-11-19 01:34:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:34:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 01:34:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-11-19 01:34:50,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6353276353276354 [2024-11-19 01:34:50,472 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 9 states and 223 transitions. [2024-11-19 01:34:50,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 130 transitions, 530 flow [2024-11-19 01:34:50,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 130 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:34:50,477 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 154 flow [2024-11-19 01:34:50,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=154, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2024-11-19 01:34:50,478 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2024-11-19 01:34:50,478 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 154 flow [2024-11-19 01:34:50,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-19 01:34:50,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:50,479 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:34:50,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:34:50,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:50,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:50,481 INFO L85 PathProgramCache]: Analyzing trace with hash 623391533, now seen corresponding path program 1 times [2024-11-19 01:34:50,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:50,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813062208] [2024-11-19 01:34:50,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:34:50,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:34:50,631 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-19 01:34:50,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:50,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813062208] [2024-11-19 01:34:50,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813062208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:50,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:50,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:34:50,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233269796] [2024-11-19 01:34:50,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:50,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:34:50,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:50,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:34:50,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:34:50,644 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-11-19 01:34:50,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-19 01:34:50,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:50,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-11-19 01:34:50,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:51,525 INFO L124 PetriNetUnfolderBase]: 3717/6071 cut-off events. [2024-11-19 01:34:51,525 INFO L125 PetriNetUnfolderBase]: For 7664/7671 co-relation queries the response was YES. [2024-11-19 01:34:51,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17154 conditions, 6071 events. 3717/6071 cut-off events. For 7664/7671 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 40606 event pairs, 311 based on Foata normal form. 181/6243 useless extension candidates. Maximal degree in co-relation 17136. Up to 2309 conditions per place. [2024-11-19 01:34:51,559 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 45 selfloop transitions, 10 changer transitions 62/125 dead transitions. [2024-11-19 01:34:51,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 125 transitions, 756 flow [2024-11-19 01:34:51,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 01:34:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 01:34:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 223 transitions. [2024-11-19 01:34:51,561 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5717948717948718 [2024-11-19 01:34:51,561 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 154 flow. Second operand 10 states and 223 transitions. [2024-11-19 01:34:51,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 125 transitions, 756 flow [2024-11-19 01:34:51,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 125 transitions, 668 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-11-19 01:34:51,583 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 222 flow [2024-11-19 01:34:51,583 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=222, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2024-11-19 01:34:51,584 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2024-11-19 01:34:51,584 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 222 flow [2024-11-19 01:34:51,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-19 01:34:51,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:51,585 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:34:51,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:34:51,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:51,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash 349583481, now seen corresponding path program 1 times [2024-11-19 01:34:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:51,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469622462] [2024-11-19 01:34:51,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:34:51,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:34:51,732 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-19 01:34:51,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:51,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469622462] [2024-11-19 01:34:51,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469622462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:51,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:51,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:34:51,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915788294] [2024-11-19 01:34:51,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:51,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:34:51,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:51,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:34:51,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:34:51,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-11-19 01:34:51,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 42 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-19 01:34:51,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:51,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-11-19 01:34:51,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:52,576 INFO L124 PetriNetUnfolderBase]: 3540/5721 cut-off events. [2024-11-19 01:34:52,576 INFO L125 PetriNetUnfolderBase]: For 15462/15464 co-relation queries the response was YES. [2024-11-19 01:34:52,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18208 conditions, 5721 events. 3540/5721 cut-off events. For 15462/15464 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 36992 event pairs, 566 based on Foata normal form. 166/5884 useless extension candidates. Maximal degree in co-relation 18183. Up to 2187 conditions per place. [2024-11-19 01:34:52,614 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 50 selfloop transitions, 14 changer transitions 60/132 dead transitions. [2024-11-19 01:34:52,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 132 transitions, 888 flow [2024-11-19 01:34:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 01:34:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 01:34:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 230 transitions. [2024-11-19 01:34:52,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2024-11-19 01:34:52,617 INFO L175 Difference]: Start difference. First operand has 63 places, 42 transitions, 222 flow. Second operand 10 states and 230 transitions. [2024-11-19 01:34:52,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 132 transitions, 888 flow [2024-11-19 01:34:52,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 132 transitions, 832 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-11-19 01:34:52,654 INFO L231 Difference]: Finished difference. Result has 70 places, 47 transitions, 310 flow [2024-11-19 01:34:52,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=310, PETRI_PLACES=70, PETRI_TRANSITIONS=47} [2024-11-19 01:34:52,656 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2024-11-19 01:34:52,656 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 47 transitions, 310 flow [2024-11-19 01:34:52,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-19 01:34:52,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:52,657 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-19 01:34:52,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:34:52,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:52,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash -936699698, now seen corresponding path program 1 times [2024-11-19 01:34:52,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:52,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062272198] [2024-11-19 01:34:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:34:52,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:34:52,754 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-19 01:34:52,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:52,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062272198] [2024-11-19 01:34:52,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062272198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:52,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:52,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:34:52,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854441565] [2024-11-19 01:34:52,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:52,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:34:52,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:52,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:34:52,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:34:52,765 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-19 01:34:52,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 47 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-19 01:34:52,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:52,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-19 01:34:52,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:53,364 INFO L124 PetriNetUnfolderBase]: 3485/5984 cut-off events. [2024-11-19 01:34:53,365 INFO L125 PetriNetUnfolderBase]: For 9830/10210 co-relation queries the response was YES. [2024-11-19 01:34:53,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16070 conditions, 5984 events. 3485/5984 cut-off events. For 9830/10210 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 40802 event pairs, 520 based on Foata normal form. 432/6293 useless extension candidates. Maximal degree in co-relation 16039. Up to 2888 conditions per place. [2024-11-19 01:34:53,405 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 45 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2024-11-19 01:34:53,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 498 flow [2024-11-19 01:34:53,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:34:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:34:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-11-19 01:34:53,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2024-11-19 01:34:53,407 INFO L175 Difference]: Start difference. First operand has 70 places, 47 transitions, 310 flow. Second operand 4 states and 105 transitions. [2024-11-19 01:34:53,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 498 flow [2024-11-19 01:34:53,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 472 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-11-19 01:34:53,430 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 322 flow [2024-11-19 01:34:53,430 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-11-19 01:34:53,431 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2024-11-19 01:34:53,431 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 322 flow [2024-11-19 01:34:53,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-19 01:34:53,432 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:53,432 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-19 01:34:53,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:34:53,432 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:53,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:53,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1345248679, now seen corresponding path program 1 times [2024-11-19 01:34:53,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:53,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769622772] [2024-11-19 01:34:53,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:34:53,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:34:53,637 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-19 01:34:53,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:53,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769622772] [2024-11-19 01:34:53,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769622772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:53,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:53,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:34:53,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280402596] [2024-11-19 01:34:53,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:53,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:34:53,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:53,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:34:53,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:34:53,648 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-11-19 01:34:53,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:34:53,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:53,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-11-19 01:34:53,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:54,702 INFO L124 PetriNetUnfolderBase]: 5173/8725 cut-off events. [2024-11-19 01:34:54,702 INFO L125 PetriNetUnfolderBase]: For 14775/15120 co-relation queries the response was YES. [2024-11-19 01:34:54,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26000 conditions, 8725 events. 5173/8725 cut-off events. For 14775/15120 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 64262 event pairs, 1359 based on Foata normal form. 207/8514 useless extension candidates. Maximal degree in co-relation 25973. Up to 2864 conditions per place. [2024-11-19 01:34:54,746 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 69 selfloop transitions, 23 changer transitions 34/138 dead transitions. [2024-11-19 01:34:54,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 138 transitions, 941 flow [2024-11-19 01:34:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 01:34:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 01:34:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2024-11-19 01:34:54,747 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5794871794871795 [2024-11-19 01:34:54,747 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 322 flow. Second operand 10 states and 226 transitions. [2024-11-19 01:34:54,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 138 transitions, 941 flow [2024-11-19 01:34:54,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 138 transitions, 935 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-19 01:34:54,781 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 499 flow [2024-11-19 01:34:54,781 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=499, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2024-11-19 01:34:54,782 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2024-11-19 01:34:54,782 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 499 flow [2024-11-19 01:34:54,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:34:54,782 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:54,782 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-19 01:34:54,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:34:54,783 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:54,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:54,783 INFO L85 PathProgramCache]: Analyzing trace with hash -468001744, now seen corresponding path program 1 times [2024-11-19 01:34:54,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:54,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501008084] [2024-11-19 01:34:54,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:34:54,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:34:54,894 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-19 01:34:54,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:54,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501008084] [2024-11-19 01:34:54,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501008084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:54,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:54,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:34:54,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791672202] [2024-11-19 01:34:54,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:54,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:34:54,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:54,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:34:54,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:34:54,906 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-19 01:34:54,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 499 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-19 01:34:54,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:54,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-19 01:34:54,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:55,465 INFO L124 PetriNetUnfolderBase]: 4056/6791 cut-off events. [2024-11-19 01:34:55,465 INFO L125 PetriNetUnfolderBase]: For 10675/11127 co-relation queries the response was YES. [2024-11-19 01:34:55,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19517 conditions, 6791 events. 4056/6791 cut-off events. For 10675/11127 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 45235 event pairs, 540 based on Foata normal form. 527/7179 useless extension candidates. Maximal degree in co-relation 19481. Up to 1996 conditions per place. [2024-11-19 01:34:55,497 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 60 selfloop transitions, 8 changer transitions 7/102 dead transitions. [2024-11-19 01:34:55,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 102 transitions, 848 flow [2024-11-19 01:34:55,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:34:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:34:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-11-19 01:34:55,498 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6871794871794872 [2024-11-19 01:34:55,499 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 499 flow. Second operand 5 states and 134 transitions. [2024-11-19 01:34:55,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 102 transitions, 848 flow [2024-11-19 01:34:55,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 102 transitions, 808 flow, removed 20 selfloop flow, removed 0 redundant places. [2024-11-19 01:34:55,520 INFO L231 Difference]: Finished difference. Result has 83 places, 59 transitions, 474 flow [2024-11-19 01:34:55,520 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=474, PETRI_PLACES=83, PETRI_TRANSITIONS=59} [2024-11-19 01:34:55,520 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2024-11-19 01:34:55,520 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 59 transitions, 474 flow [2024-11-19 01:34:55,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-19 01:34:55,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:55,521 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-19 01:34:55,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:34:55,521 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:55,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:55,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1706009088, now seen corresponding path program 1 times [2024-11-19 01:34:55,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:55,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344948930] [2024-11-19 01:34:55,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:34:55,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:34:55,733 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-19 01:34:55,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344948930] [2024-11-19 01:34:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344948930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:55,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:55,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:34:55,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016091131] [2024-11-19 01:34:55,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:55,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:34:55,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:55,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:34:55,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:34:55,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-19 01:34:55,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 59 transitions, 474 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-19 01:34:55,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:55,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-19 01:34:55,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:56,215 INFO L124 PetriNetUnfolderBase]: 3288/5431 cut-off events. [2024-11-19 01:34:56,215 INFO L125 PetriNetUnfolderBase]: For 11393/11755 co-relation queries the response was YES. [2024-11-19 01:34:56,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17403 conditions, 5431 events. 3288/5431 cut-off events. For 11393/11755 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 35120 event pairs, 510 based on Foata normal form. 307/5599 useless extension candidates. Maximal degree in co-relation 17363. Up to 1980 conditions per place. [2024-11-19 01:34:56,240 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 48 selfloop transitions, 11 changer transitions 12/90 dead transitions. [2024-11-19 01:34:56,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 90 transitions, 726 flow [2024-11-19 01:34:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:34:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:34:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-11-19 01:34:56,241 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6196581196581197 [2024-11-19 01:34:56,241 INFO L175 Difference]: Start difference. First operand has 83 places, 59 transitions, 474 flow. Second operand 6 states and 145 transitions. [2024-11-19 01:34:56,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 90 transitions, 726 flow [2024-11-19 01:34:56,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 90 transitions, 673 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-11-19 01:34:56,252 INFO L231 Difference]: Finished difference. Result has 76 places, 50 transitions, 371 flow [2024-11-19 01:34:56,253 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=76, PETRI_TRANSITIONS=50} [2024-11-19 01:34:56,255 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2024-11-19 01:34:56,256 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 50 transitions, 371 flow [2024-11-19 01:34:56,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-19 01:34:56,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:56,260 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] [2024-11-19 01:34:56,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:34:56,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:56,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:56,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1732932526, now seen corresponding path program 1 times [2024-11-19 01:34:56,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:56,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343677138] [2024-11-19 01:34:56,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:34:56,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:34:57,156 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-19 01:34:57,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:57,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343677138] [2024-11-19 01:34:57,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343677138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:57,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:57,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:34:57,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834299728] [2024-11-19 01:34:57,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:57,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:34:57,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:57,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:34:57,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:34:57,167 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-19 01:34:57,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 50 transitions, 371 flow. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 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-19 01:34:57,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:57,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-19 01:34:57,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:57,739 INFO L124 PetriNetUnfolderBase]: 1291/2563 cut-off events. [2024-11-19 01:34:57,739 INFO L125 PetriNetUnfolderBase]: For 4753/5050 co-relation queries the response was YES. [2024-11-19 01:34:57,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7603 conditions, 2563 events. 1291/2563 cut-off events. For 4753/5050 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 18648 event pairs, 274 based on Foata normal form. 65/2388 useless extension candidates. Maximal degree in co-relation 7568. Up to 690 conditions per place. [2024-11-19 01:34:57,753 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 34 selfloop transitions, 4 changer transitions 25/92 dead transitions. [2024-11-19 01:34:57,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 92 transitions, 643 flow [2024-11-19 01:34:57,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:34:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 01:34:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2024-11-19 01:34:57,754 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5584045584045584 [2024-11-19 01:34:57,754 INFO L175 Difference]: Start difference. First operand has 76 places, 50 transitions, 371 flow. Second operand 9 states and 196 transitions. [2024-11-19 01:34:57,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 92 transitions, 643 flow [2024-11-19 01:34:57,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 92 transitions, 508 flow, removed 24 selfloop flow, removed 16 redundant places. [2024-11-19 01:34:57,770 INFO L231 Difference]: Finished difference. Result has 71 places, 50 transitions, 280 flow [2024-11-19 01:34:57,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=280, PETRI_PLACES=71, PETRI_TRANSITIONS=50} [2024-11-19 01:34:57,771 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2024-11-19 01:34:57,771 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 50 transitions, 280 flow [2024-11-19 01:34:57,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 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-19 01:34:57,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:57,772 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] [2024-11-19 01:34:57,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:34:57,772 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:57,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2133473350, now seen corresponding path program 2 times [2024-11-19 01:34:57,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:57,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058680690] [2024-11-19 01:34:57,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:34:57,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:57,835 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:34:57,836 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 01:34:57,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:34:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:34:57,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:34:57,935 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:34:57,936 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-19 01:34:57,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-19 01:34:57,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-19 01:34:57,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-19 01:34:57,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-19 01:34:57,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-19 01:34:57,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:34:57,939 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:34:58,007 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 01:34:58,008 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:34:58,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:34:58 BasicIcfg [2024-11-19 01:34:58,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:34:58,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:34:58,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:34:58,018 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:34:58,018 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:34:48" (3/4) ... [2024-11-19 01:34:58,019 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 01:34:58,094 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 01:34:58,095 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:34:58,095 INFO L158 Benchmark]: Toolchain (without parser) took 10885.33ms. Allocated memory was 169.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 102.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 495.2MB. Max. memory is 16.1GB. [2024-11-19 01:34:58,095 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 169.9MB. Free memory was 131.6MB in the beginning and 131.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:34:58,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.12ms. Allocated memory is still 169.9MB. Free memory was 101.8MB in the beginning and 124.6MB in the end (delta: -22.8MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-11-19 01:34:58,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.45ms. Allocated memory is still 169.9MB. Free memory was 124.6MB in the beginning and 122.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:34:58,096 INFO L158 Benchmark]: Boogie Preprocessor took 54.71ms. Allocated memory is still 169.9MB. Free memory was 121.6MB in the beginning and 118.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:34:58,096 INFO L158 Benchmark]: RCFGBuilder took 535.82ms. Allocated memory is still 169.9MB. Free memory was 118.4MB in the beginning and 69.3MB in the end (delta: 49.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-19 01:34:58,097 INFO L158 Benchmark]: TraceAbstraction took 9710.66ms. Allocated memory was 169.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 68.0MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 448.4MB. Max. memory is 16.1GB. [2024-11-19 01:34:58,097 INFO L158 Benchmark]: Witness Printer took 77.19ms. Allocated memory is still 1.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 01:34:58,098 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.12ms. Allocated memory is still 169.9MB. Free memory was 131.6MB in the beginning and 131.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.12ms. Allocated memory is still 169.9MB. Free memory was 101.8MB in the beginning and 124.6MB in the end (delta: -22.8MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.45ms. Allocated memory is still 169.9MB. Free memory was 124.6MB in the beginning and 122.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.71ms. Allocated memory is still 169.9MB. Free memory was 121.6MB in the beginning and 118.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 535.82ms. Allocated memory is still 169.9MB. Free memory was 118.4MB in the beginning and 69.3MB in the end (delta: 49.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9710.66ms. Allocated memory was 169.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 68.0MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 448.4MB. Max. memory is 16.1GB. * Witness Printer took 77.19ms. Allocated memory is still 1.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1489; [L832] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1489=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L833] 0 pthread_t t1490; [L834] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1489=-3, t1490=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L835] 0 pthread_t t1491; [L836] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1489=-3, t1490=-2, t1491=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 1 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z [L797] 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) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 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)) [L802] 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)) [L803] 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)) [L804] 3 __unbuffered_p2_EAX = z [L805] 3 z = z$flush_delayed ? z$mem_tmp : z [L806] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489=-3, t1490=-2, t1491=-1, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 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 [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489=-3, t1490=-2, t1491=-1, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489=-3, t1490=-2, t1491=-1, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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: 836]: 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: 834]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 567 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 536 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1310 IncrementalHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 56 mSDtfsCounter, 1310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=499occurred in iteration=6, InterpolantAutomatonStates: 66, 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.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 763 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-19 01:34:58,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE