./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix016.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix016.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 19a854e56177f3540c5827f949efdd83ec94b87c6cd0ec772115563b836c4c8b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:09:51,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:09:52,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:09:52,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:09:52,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:09:52,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:09:52,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:09:52,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:09:52,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:09:52,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:09:52,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:09:52,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:09:52,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:09:52,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:09:52,121 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:09:52,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:09:52,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:09:52,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:09:52,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:09:52,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:09:52,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:09:52,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:09:52,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:09:52,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:09:52,126 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:09:52,127 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:09:52,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:09:52,127 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:09:52,127 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:09:52,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:09:52,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:09:52,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:09:52,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:09:52,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:09:52,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:09:52,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:09:52,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:09:52,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:09:52,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:09:52,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:09:52,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:09:52,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:09:52,133 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 -> 19a854e56177f3540c5827f949efdd83ec94b87c6cd0ec772115563b836c4c8b [2024-11-16 19:09:52,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:09:52,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:09:52,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:09:52,407 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:09:52,408 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:09:52,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix016.oepc.i [2024-11-16 19:09:53,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:09:54,208 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:09:54,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix016.oepc.i [2024-11-16 19:09:54,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32dbb1b58/e56049ce830048e79e4158923fc54d2b/FLAG42771496c [2024-11-16 19:09:54,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32dbb1b58/e56049ce830048e79e4158923fc54d2b [2024-11-16 19:09:54,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:09:54,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:09:54,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:09:54,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:09:54,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:09:54,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:09:54" (1/1) ... [2024-11-16 19:09:54,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f45ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54, skipping insertion in model container [2024-11-16 19:09:54,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:09:54" (1/1) ... [2024-11-16 19:09:54,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:09:54,535 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/mix016.oepc.i[945,958] [2024-11-16 19:09:54,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:09:54,752 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:09:54,765 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/mix016.oepc.i[945,958] [2024-11-16 19:09:54,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:09:54,864 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:09:54,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54 WrapperNode [2024-11-16 19:09:54,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:09:54,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:09:54,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:09:54,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:09:54,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54" (1/1) ... [2024-11-16 19:09:54,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54" (1/1) ... [2024-11-16 19:09:54,927 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2024-11-16 19:09:54,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:09:54,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:09:54,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:09:54,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:09:54,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54" (1/1) ... [2024-11-16 19:09:54,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54" (1/1) ... [2024-11-16 19:09:54,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54" (1/1) ... [2024-11-16 19:09:54,960 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 19:09:54,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54" (1/1) ... [2024-11-16 19:09:54,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54" (1/1) ... [2024-11-16 19:09:54,967 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54" (1/1) ... [2024-11-16 19:09:54,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54" (1/1) ... [2024-11-16 19:09:54,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54" (1/1) ... [2024-11-16 19:09:54,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54" (1/1) ... [2024-11-16 19:09:54,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:09:54,975 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:09:54,975 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:09:54,976 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:09:54,976 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54" (1/1) ... [2024-11-16 19:09:54,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:09:55,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:09:55,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 19:09:55,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 19:09:55,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 19:09:55,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:09:55,080 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-16 19:09:55,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-16 19:09:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-16 19:09:55,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-16 19:09:55,082 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-16 19:09:55,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-16 19:09:55,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:09:55,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 19:09:55,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:09:55,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:09:55,084 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:09:55,250 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:09:55,254 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:09:55,634 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:09:55,634 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:09:55,892 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:09:55,894 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:09:55,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:09:55 BoogieIcfgContainer [2024-11-16 19:09:55,895 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:09:55,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:09:55,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:09:55,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:09:55,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:09:54" (1/3) ... [2024-11-16 19:09:55,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4b5155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:09:55, skipping insertion in model container [2024-11-16 19:09:55,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:54" (2/3) ... [2024-11-16 19:09:55,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4b5155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:09:55, skipping insertion in model container [2024-11-16 19:09:55,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:09:55" (3/3) ... [2024-11-16 19:09:55,908 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016.oepc.i [2024-11-16 19:09:55,926 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:09:55,926 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 19:09:55,926 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:09:55,993 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 19:09:56,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2024-11-16 19:09:56,073 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2024-11-16 19:09:56,073 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:09:56,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-11-16 19:09:56,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2024-11-16 19:09:56,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2024-11-16 19:09:56,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:09:56,109 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;@7caa1cbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:09:56,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-16 19:09:56,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:09:56,115 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-16 19:09:56,116 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:09:56,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:56,117 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-16 19:09:56,117 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-16 19:09:56,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:56,123 INFO L85 PathProgramCache]: Analyzing trace with hash 11248334, now seen corresponding path program 1 times [2024-11-16 19:09:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291657282] [2024-11-16 19:09:56,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:09:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:09:56,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:09:56,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291657282] [2024-11-16 19:09:56,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291657282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:09:56,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:09:56,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-16 19:09:56,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045137302] [2024-11-16 19:09:56,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:09:56,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:09:56,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:09:56,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:09:56,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:09:56,658 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-11-16 19:09:56,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:56,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:09:56,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-11-16 19:09:56,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:09:57,863 INFO L124 PetriNetUnfolderBase]: 5603/8026 cut-off events. [2024-11-16 19:09:57,863 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-16 19:09:57,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16073 conditions, 8026 events. 5603/8026 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 44606 event pairs, 608 based on Foata normal form. 252/8268 useless extension candidates. Maximal degree in co-relation 16062. Up to 6956 conditions per place. [2024-11-16 19:09:57,922 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 49 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-11-16 19:09:57,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 237 flow [2024-11-16 19:09:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:09:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:09:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-16 19:09:57,932 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-16 19:09:57,933 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 80 transitions. [2024-11-16 19:09:57,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 237 flow [2024-11-16 19:09:57,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-16 19:09:57,938 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2024-11-16 19:09:57,940 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-16 19:09:57,946 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2024-11-16 19:09:57,946 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2024-11-16 19:09:57,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:57,947 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:57,947 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:09:57,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:09:57,948 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-16 19:09:57,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:57,949 INFO L85 PathProgramCache]: Analyzing trace with hash 536331443, now seen corresponding path program 1 times [2024-11-16 19:09:57,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:57,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475893553] [2024-11-16 19:09:57,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:57,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:09:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:09:58,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:09:58,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475893553] [2024-11-16 19:09:58,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475893553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:09:58,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:09:58,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:09:58,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651625878] [2024-11-16 19:09:58,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:09:58,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:09:58,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:09:58,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:09:58,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:09:58,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-11-16 19:09:58,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:58,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:09:58,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-11-16 19:09:58,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:09:59,722 INFO L124 PetriNetUnfolderBase]: 6563/9573 cut-off events. [2024-11-16 19:09:59,723 INFO L125 PetriNetUnfolderBase]: For 470/470 co-relation queries the response was YES. [2024-11-16 19:09:59,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19517 conditions, 9573 events. 6563/9573 cut-off events. For 470/470 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 52276 event pairs, 1271 based on Foata normal form. 0/9381 useless extension candidates. Maximal degree in co-relation 19507. Up to 4993 conditions per place. [2024-11-16 19:09:59,764 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 41 selfloop transitions, 2 changer transitions 72/119 dead transitions. [2024-11-16 19:09:59,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 119 transitions, 490 flow [2024-11-16 19:09:59,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:09:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:09:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2024-11-16 19:09:59,770 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.540625 [2024-11-16 19:09:59,770 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 8 states and 173 transitions. [2024-11-16 19:09:59,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 119 transitions, 490 flow [2024-11-16 19:09:59,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 119 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:09:59,777 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 88 flow [2024-11-16 19:09:59,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=88, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2024-11-16 19:09:59,778 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2024-11-16 19:09:59,778 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 88 flow [2024-11-16 19:09:59,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:59,779 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:59,779 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:09:59,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:09:59,779 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-16 19:09:59,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:59,780 INFO L85 PathProgramCache]: Analyzing trace with hash 657559922, now seen corresponding path program 1 times [2024-11-16 19:09:59,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:59,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522060764] [2024-11-16 19:09:59,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:59,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:09:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:09:59,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:09:59,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522060764] [2024-11-16 19:09:59,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522060764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:09:59,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:09:59,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:09:59,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020625894] [2024-11-16 19:09:59,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:09:59,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:09:59,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:09:59,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:09:59,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:09:59,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-11-16 19:09:59,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:59,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:09:59,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-11-16 19:09:59,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:00,656 INFO L124 PetriNetUnfolderBase]: 3703/5597 cut-off events. [2024-11-16 19:10:00,657 INFO L125 PetriNetUnfolderBase]: For 426/426 co-relation queries the response was YES. [2024-11-16 19:10:00,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12144 conditions, 5597 events. 3703/5597 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 29905 event pairs, 645 based on Foata normal form. 252/5837 useless extension candidates. Maximal degree in co-relation 12129. Up to 3001 conditions per place. [2024-11-16 19:10:00,706 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 58 selfloop transitions, 5 changer transitions 1/68 dead transitions. [2024-11-16 19:10:00,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 296 flow [2024-11-16 19:10:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:10:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 19:10:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2024-11-16 19:10:00,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6125 [2024-11-16 19:10:00,708 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 88 flow. Second operand 4 states and 98 transitions. [2024-11-16 19:10:00,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 296 flow [2024-11-16 19:10:00,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 280 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-16 19:10:00,737 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 110 flow [2024-11-16 19:10:00,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-16 19:10:00,739 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2024-11-16 19:10:00,739 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 110 flow [2024-11-16 19:10:00,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:00,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:00,740 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:00,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:10:00,740 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-16 19:10:00,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:00,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1804439246, now seen corresponding path program 1 times [2024-11-16 19:10:00,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:00,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227567665] [2024-11-16 19:10:00,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:00,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:01,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:01,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227567665] [2024-11-16 19:10:01,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227567665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:01,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:01,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:10:01,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328075303] [2024-11-16 19:10:01,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:01,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:10:01,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:01,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:10:01,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:10:01,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-11-16 19:10:01,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:01,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:01,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-11-16 19:10:01,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:01,472 INFO L124 PetriNetUnfolderBase]: 2135/3293 cut-off events. [2024-11-16 19:10:01,473 INFO L125 PetriNetUnfolderBase]: For 728/728 co-relation queries the response was YES. [2024-11-16 19:10:01,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7770 conditions, 3293 events. 2135/3293 cut-off events. For 728/728 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 15981 event pairs, 411 based on Foata normal form. 172/3453 useless extension candidates. Maximal degree in co-relation 7757. Up to 1116 conditions per place. [2024-11-16 19:10:01,490 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 74 selfloop transitions, 8 changer transitions 1/87 dead transitions. [2024-11-16 19:10:01,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 87 transitions, 402 flow [2024-11-16 19:10:01,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:10:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:10:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-11-16 19:10:01,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-16 19:10:01,492 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 110 flow. Second operand 5 states and 125 transitions. [2024-11-16 19:10:01,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 87 transitions, 402 flow [2024-11-16 19:10:01,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 87 transitions, 392 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-16 19:10:01,495 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 150 flow [2024-11-16 19:10:01,496 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2024-11-16 19:10:01,496 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2024-11-16 19:10:01,497 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 150 flow [2024-11-16 19:10:01,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:01,497 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:01,497 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:01,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:10:01,498 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-16 19:10:01,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:01,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1482184755, now seen corresponding path program 1 times [2024-11-16 19:10:01,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:01,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459292404] [2024-11-16 19:10:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:01,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:02,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:02,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459292404] [2024-11-16 19:10:02,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459292404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:02,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:02,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 19:10:02,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160843] [2024-11-16 19:10:02,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:02,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:10:02,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:02,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:10:02,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:10:02,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-11-16 19:10:02,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:02,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:02,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-11-16 19:10:02,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:03,601 INFO L124 PetriNetUnfolderBase]: 3513/5396 cut-off events. [2024-11-16 19:10:03,602 INFO L125 PetriNetUnfolderBase]: For 3430/3430 co-relation queries the response was YES. [2024-11-16 19:10:03,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13937 conditions, 5396 events. 3513/5396 cut-off events. For 3430/3430 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 28506 event pairs, 1074 based on Foata normal form. 36/5428 useless extension candidates. Maximal degree in co-relation 13922. Up to 2440 conditions per place. [2024-11-16 19:10:03,625 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 81 selfloop transitions, 9 changer transitions 57/151 dead transitions. [2024-11-16 19:10:03,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 151 transitions, 892 flow [2024-11-16 19:10:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:10:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:10:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2024-11-16 19:10:03,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.56875 [2024-11-16 19:10:03,628 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 150 flow. Second operand 8 states and 182 transitions. [2024-11-16 19:10:03,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 151 transitions, 892 flow [2024-11-16 19:10:03,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 151 transitions, 800 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-11-16 19:10:03,642 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 190 flow [2024-11-16 19:10:03,643 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=190, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-11-16 19:10:03,643 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 12 predicate places. [2024-11-16 19:10:03,644 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 190 flow [2024-11-16 19:10:03,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:03,644 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:03,644 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:03,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:10:03,645 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-16 19:10:03,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash -548838051, now seen corresponding path program 2 times [2024-11-16 19:10:03,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:03,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96211058] [2024-11-16 19:10:03,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:03,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:03,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:03,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:03,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96211058] [2024-11-16 19:10:03,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96211058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:03,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:03,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:10:03,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759549110] [2024-11-16 19:10:03,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:03,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:10:03,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:03,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:10:03,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:10:03,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-11-16 19:10:03,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:03,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:03,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-11-16 19:10:03,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:04,280 INFO L124 PetriNetUnfolderBase]: 2096/3242 cut-off events. [2024-11-16 19:10:04,280 INFO L125 PetriNetUnfolderBase]: For 1874/1874 co-relation queries the response was YES. [2024-11-16 19:10:04,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8751 conditions, 3242 events. 2096/3242 cut-off events. For 1874/1874 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 16200 event pairs, 420 based on Foata normal form. 116/3346 useless extension candidates. Maximal degree in co-relation 8733. Up to 1232 conditions per place. [2024-11-16 19:10:04,301 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 78 selfloop transitions, 11 changer transitions 1/94 dead transitions. [2024-11-16 19:10:04,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 94 transitions, 525 flow [2024-11-16 19:10:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:10:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:10:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-11-16 19:10:04,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-11-16 19:10:04,303 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 190 flow. Second operand 6 states and 124 transitions. [2024-11-16 19:10:04,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 94 transitions, 525 flow [2024-11-16 19:10:04,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 513 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-16 19:10:04,308 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 211 flow [2024-11-16 19:10:04,308 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-11-16 19:10:04,309 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2024-11-16 19:10:04,309 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 211 flow [2024-11-16 19:10:04,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:04,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:04,309 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:04,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 19:10:04,310 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-16 19:10:04,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:04,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1693549531, now seen corresponding path program 1 times [2024-11-16 19:10:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:04,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802070396] [2024-11-16 19:10:04,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:04,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:05,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:05,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802070396] [2024-11-16 19:10:05,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802070396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:05,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:05,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 19:10:05,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390964357] [2024-11-16 19:10:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:05,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 19:10:05,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:05,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 19:10:05,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-16 19:10:05,023 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-11-16 19:10:05,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 211 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:05,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:05,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-11-16 19:10:05,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:05,815 INFO L124 PetriNetUnfolderBase]: 2918/4507 cut-off events. [2024-11-16 19:10:05,815 INFO L125 PetriNetUnfolderBase]: For 4804/4804 co-relation queries the response was YES. [2024-11-16 19:10:05,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13338 conditions, 4507 events. 2918/4507 cut-off events. For 4804/4804 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 23342 event pairs, 563 based on Foata normal form. 8/4512 useless extension candidates. Maximal degree in co-relation 13320. Up to 2790 conditions per place. [2024-11-16 19:10:05,840 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 103 selfloop transitions, 22 changer transitions 20/149 dead transitions. [2024-11-16 19:10:05,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 149 transitions, 931 flow [2024-11-16 19:10:05,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 19:10:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-16 19:10:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 202 transitions. [2024-11-16 19:10:05,842 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42083333333333334 [2024-11-16 19:10:05,843 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 211 flow. Second operand 12 states and 202 transitions. [2024-11-16 19:10:05,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 149 transitions, 931 flow [2024-11-16 19:10:05,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 149 transitions, 770 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-11-16 19:10:05,873 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 328 flow [2024-11-16 19:10:05,873 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=328, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2024-11-16 19:10:05,874 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2024-11-16 19:10:05,874 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 328 flow [2024-11-16 19:10:05,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:05,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:05,875 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:05,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 19:10:05,875 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-16 19:10:05,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:05,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1584325185, now seen corresponding path program 2 times [2024-11-16 19:10:05,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:05,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910024912] [2024-11-16 19:10:05,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:05,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:06,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:06,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910024912] [2024-11-16 19:10:06,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910024912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:06,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:06,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:10:06,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358591233] [2024-11-16 19:10:06,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:06,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:10:06,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:06,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:10:06,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:10:06,146 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-11-16 19:10:06,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 328 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:06,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:06,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-11-16 19:10:06,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:06,855 INFO L124 PetriNetUnfolderBase]: 3666/5665 cut-off events. [2024-11-16 19:10:06,855 INFO L125 PetriNetUnfolderBase]: For 5072/5072 co-relation queries the response was YES. [2024-11-16 19:10:06,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16910 conditions, 5665 events. 3666/5665 cut-off events. For 5072/5072 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 30918 event pairs, 569 based on Foata normal form. 8/5668 useless extension candidates. Maximal degree in co-relation 16888. Up to 3066 conditions per place. [2024-11-16 19:10:06,878 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 64 selfloop transitions, 1 changer transitions 67/136 dead transitions. [2024-11-16 19:10:06,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 136 transitions, 926 flow [2024-11-16 19:10:06,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:10:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:10:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-11-16 19:10:06,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4708333333333333 [2024-11-16 19:10:06,880 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 328 flow. Second operand 6 states and 113 transitions. [2024-11-16 19:10:06,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 136 transitions, 926 flow [2024-11-16 19:10:06,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 136 transitions, 920 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-16 19:10:06,893 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 235 flow [2024-11-16 19:10:06,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2024-11-16 19:10:06,895 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2024-11-16 19:10:06,895 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 235 flow [2024-11-16 19:10:06,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:06,898 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:06,898 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:06,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 19:10:06,898 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-16 19:10:06,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash -124508587, now seen corresponding path program 3 times [2024-11-16 19:10:06,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:06,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358012001] [2024-11-16 19:10:06,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:06,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:07,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:07,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358012001] [2024-11-16 19:10:07,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358012001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:07,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:07,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:10:07,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045852434] [2024-11-16 19:10:07,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:07,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:10:07,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:07,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:10:07,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:10:07,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-11-16 19:10:07,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:07,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:07,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-11-16 19:10:07,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:07,608 INFO L124 PetriNetUnfolderBase]: 1581/2499 cut-off events. [2024-11-16 19:10:07,609 INFO L125 PetriNetUnfolderBase]: For 2341/2341 co-relation queries the response was YES. [2024-11-16 19:10:07,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7282 conditions, 2499 events. 1581/2499 cut-off events. For 2341/2341 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11794 event pairs, 317 based on Foata normal form. 8/2498 useless extension candidates. Maximal degree in co-relation 7257. Up to 1270 conditions per place. [2024-11-16 19:10:07,618 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 49 selfloop transitions, 1 changer transitions 46/100 dead transitions. [2024-11-16 19:10:07,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 100 transitions, 631 flow [2024-11-16 19:10:07,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:10:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:10:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-11-16 19:10:07,620 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-11-16 19:10:07,620 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 235 flow. Second operand 6 states and 106 transitions. [2024-11-16 19:10:07,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 100 transitions, 631 flow [2024-11-16 19:10:07,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 585 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-11-16 19:10:07,627 INFO L231 Difference]: Finished difference. Result has 69 places, 43 transitions, 173 flow [2024-11-16 19:10:07,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=69, PETRI_TRANSITIONS=43} [2024-11-16 19:10:07,628 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2024-11-16 19:10:07,628 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 43 transitions, 173 flow [2024-11-16 19:10:07,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:07,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:07,628 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:07,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 19:10:07,629 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-16 19:10:07,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2080457785, now seen corresponding path program 4 times [2024-11-16 19:10:07,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:07,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552823114] [2024-11-16 19:10:07,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:07,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:09,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:09,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552823114] [2024-11-16 19:10:09,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552823114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:09,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:09,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 19:10:09,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315225628] [2024-11-16 19:10:09,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:09,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:10:09,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:09,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:10:09,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:10:09,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-11-16 19:10:09,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 43 transitions, 173 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:09,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:09,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-11-16 19:10:09,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:09,718 INFO L124 PetriNetUnfolderBase]: 1064/1725 cut-off events. [2024-11-16 19:10:09,718 INFO L125 PetriNetUnfolderBase]: For 1342/1342 co-relation queries the response was YES. [2024-11-16 19:10:09,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4764 conditions, 1725 events. 1064/1725 cut-off events. For 1342/1342 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7596 event pairs, 299 based on Foata normal form. 8/1732 useless extension candidates. Maximal degree in co-relation 4740. Up to 915 conditions per place. [2024-11-16 19:10:09,726 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 43 selfloop transitions, 4 changer transitions 45/96 dead transitions. [2024-11-16 19:10:09,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 96 transitions, 540 flow [2024-11-16 19:10:09,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:10:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:10:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-11-16 19:10:09,727 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-11-16 19:10:09,727 INFO L175 Difference]: Start difference. First operand has 69 places, 43 transitions, 173 flow. Second operand 8 states and 135 transitions. [2024-11-16 19:10:09,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 96 transitions, 540 flow [2024-11-16 19:10:09,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 513 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-16 19:10:09,731 INFO L231 Difference]: Finished difference. Result has 67 places, 41 transitions, 163 flow [2024-11-16 19:10:09,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=163, PETRI_PLACES=67, PETRI_TRANSITIONS=41} [2024-11-16 19:10:09,731 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2024-11-16 19:10:09,732 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 41 transitions, 163 flow [2024-11-16 19:10:09,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:09,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:09,732 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:09,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 19:10:09,733 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:10:09,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:09,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1649233155, now seen corresponding path program 5 times [2024-11-16 19:10:09,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:09,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483286624] [2024-11-16 19:10:09,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:09,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:10,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-16 19:10:10,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:10,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483286624] [2024-11-16 19:10:10,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483286624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:10,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:10,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 19:10:10,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429906958] [2024-11-16 19:10:10,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:10,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:10:10,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:10,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:10:10,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:10:10,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-11-16 19:10:10,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 41 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:10,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:10,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-11-16 19:10:10,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:10,910 INFO L124 PetriNetUnfolderBase]: 940/1539 cut-off events. [2024-11-16 19:10:10,910 INFO L125 PetriNetUnfolderBase]: For 687/687 co-relation queries the response was YES. [2024-11-16 19:10:10,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3997 conditions, 1539 events. 940/1539 cut-off events. For 687/687 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6714 event pairs, 133 based on Foata normal form. 8/1546 useless extension candidates. Maximal degree in co-relation 3974. Up to 637 conditions per place. [2024-11-16 19:10:10,917 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 62 selfloop transitions, 5 changer transitions 35/106 dead transitions. [2024-11-16 19:10:10,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 577 flow [2024-11-16 19:10:10,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:10:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 19:10:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-11-16 19:10:10,919 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-11-16 19:10:10,919 INFO L175 Difference]: Start difference. First operand has 67 places, 41 transitions, 163 flow. Second operand 9 states and 144 transitions. [2024-11-16 19:10:10,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 577 flow [2024-11-16 19:10:10,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 551 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-11-16 19:10:10,923 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 178 flow [2024-11-16 19:10:10,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=178, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2024-11-16 19:10:10,923 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2024-11-16 19:10:10,924 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 178 flow [2024-11-16 19:10:10,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:10,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:10,926 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:10,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 19:10:10,926 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:10:10,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:10,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1364858271, now seen corresponding path program 6 times [2024-11-16 19:10:10,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:10,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021860755] [2024-11-16 19:10:10,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:10,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:10:10,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:10:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:10:11,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:10:11,080 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:10:11,082 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-16 19:10:11,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-16 19:10:11,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-16 19:10:11,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-16 19:10:11,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-16 19:10:11,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-16 19:10:11,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 19:10:11,087 INFO L407 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1] [2024-11-16 19:10:11,192 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 19:10:11,192 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 19:10:11,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:10:11 BasicIcfg [2024-11-16 19:10:11,199 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 19:10:11,199 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 19:10:11,199 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 19:10:11,199 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 19:10:11,200 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:09:55" (3/4) ... [2024-11-16 19:10:11,201 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 19:10:11,289 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 19:10:11,290 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 19:10:11,290 INFO L158 Benchmark]: Toolchain (without parser) took 17042.15ms. Allocated memory was 172.0MB in the beginning and 1.2GB in the end (delta: 996.1MB). Free memory was 112.2MB in the beginning and 865.1MB in the end (delta: -752.8MB). Peak memory consumption was 242.3MB. Max. memory is 16.1GB. [2024-11-16 19:10:11,290 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 53.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:10:11,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.16ms. Allocated memory is still 172.0MB. Free memory was 111.7MB in the beginning and 125.0MB in the end (delta: -13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 19:10:11,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.07ms. Allocated memory is still 172.0MB. Free memory was 125.0MB in the beginning and 122.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:10:11,291 INFO L158 Benchmark]: Boogie Preprocessor took 46.72ms. Allocated memory is still 172.0MB. Free memory was 122.9MB in the beginning and 119.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:10:11,292 INFO L158 Benchmark]: IcfgBuilder took 919.59ms. Allocated memory was 172.0MB in the beginning and 209.7MB in the end (delta: 37.7MB). Free memory was 119.4MB in the beginning and 169.3MB in the end (delta: -49.9MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-11-16 19:10:11,292 INFO L158 Benchmark]: TraceAbstraction took 15299.76ms. Allocated memory was 209.7MB in the beginning and 1.2GB in the end (delta: 958.4MB). Free memory was 169.3MB in the beginning and 878.7MB in the end (delta: -709.3MB). Peak memory consumption was 249.1MB. Max. memory is 16.1GB. [2024-11-16 19:10:11,292 INFO L158 Benchmark]: Witness Printer took 90.53ms. Allocated memory is still 1.2GB. Free memory was 878.7MB in the beginning and 865.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 19:10:11,294 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.18ms. Allocated memory is still 100.7MB. Free memory is still 53.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.16ms. Allocated memory is still 172.0MB. Free memory was 111.7MB in the beginning and 125.0MB in the end (delta: -13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.07ms. Allocated memory is still 172.0MB. Free memory was 125.0MB in the beginning and 122.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.72ms. Allocated memory is still 172.0MB. Free memory was 122.9MB in the beginning and 119.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 919.59ms. Allocated memory was 172.0MB in the beginning and 209.7MB in the end (delta: 37.7MB). Free memory was 119.4MB in the beginning and 169.3MB in the end (delta: -49.9MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15299.76ms. Allocated memory was 209.7MB in the beginning and 1.2GB in the end (delta: 958.4MB). Free memory was 169.3MB in the beginning and 878.7MB in the end (delta: -709.3MB). Peak memory consumption was 249.1MB. Max. memory is 16.1GB. * Witness Printer took 90.53ms. Allocated memory is still 1.2GB. Free memory was 878.7MB in the beginning and 865.1MB in the end (delta: 13.6MB). 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L840] 0 pthread_t t409; [L841] FCALL, FORK 0 pthread_create(&t409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t409=-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] [L842] 0 pthread_t t410; [L843] FCALL, FORK 0 pthread_create(&t410, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t409=-1, t410=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L844] 0 pthread_t t411; [L845] FCALL, FORK 0 pthread_create(&t411, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t409=-1, t410=0, t411=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] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L759] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L776] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L779] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L796] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L782] 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) [L783] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L784] 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 [L785] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L786] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L799] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 z$flush_delayed = weak$$choice2 [L805] 3 z$mem_tmp = z [L806] 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) [L807] 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)) [L808] 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)) [L809] 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)) [L810] 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)) [L811] 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)) [L812] 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)) [L813] 3 __unbuffered_p2_EBX = z [L814] 3 z = z$flush_delayed ? z$mem_tmp : z [L815] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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] [L818] 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) [L819] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L820] 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 [L821] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L822] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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] [L762] 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) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 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 [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409=-1, t410=0, t411=1, weak$$choice0=1, weak$$choice2=1, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 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) [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 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 [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409=-1, t410=0, t411=1, weak$$choice0=1, weak$$choice2=1, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L858] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409=-1, t410=0, t411=1, weak$$choice0=1, weak$$choice2=1, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L860] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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=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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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=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: 843]: 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: 845]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 685 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 682 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2717 IncrementalHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 2 mSDtfsCounter, 2717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=328occurred in iteration=7, InterpolantAutomatonStates: 75, 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.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 1664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-16 19:10:11,328 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