./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi008.oepc.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version fca748b1
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi008.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 e1d84228246cc640f111b0bf0907a0ec6838e3ee0e70770c8d77ae15dd23f4db
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m
[2024-11-20 09:25:41,796 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-20 09:25:41,868 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-20 09:25:41,872 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-20 09:25:41,879 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-20 09:25:41,912 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-20 09:25:41,914 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-20 09:25:41,914 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-20 09:25:41,915 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-20 09:25:41,916 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-20 09:25:41,917 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-20 09:25:41,917 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-20 09:25:41,918 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-20 09:25:41,919 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-20 09:25:41,920 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-20 09:25:41,920 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-20 09:25:41,920 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-20 09:25:41,921 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-20 09:25:41,921 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-20 09:25:41,921 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-20 09:25:41,921 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-20 09:25:41,925 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-20 09:25:41,925 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-20 09:25:41,925 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-20 09:25:41,925 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-20 09:25:41,926 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-20 09:25:41,926 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-20 09:25:41,926 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-20 09:25:41,926 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-20 09:25:41,927 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-20 09:25:41,927 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-20 09:25:41,928 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-20 09:25:41,928 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-20 09:25:41,928 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-20 09:25:41,929 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-20 09:25:41,929 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-20 09:25:41,929 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-20 09:25:41,929 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-20 09:25:41,930 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-20 09:25:41,930 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-20 09:25:41,930 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-20 09:25:41,930 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-20 09:25:41,930 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 -> e1d84228246cc640f111b0bf0907a0ec6838e3ee0e70770c8d77ae15dd23f4db
[2024-11-20 09:25:42,206 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-20 09:25:42,230 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-20 09:25:42,233 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-20 09:25:42,234 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-20 09:25:42,235 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-20 09:25:42,236 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi008.oepc.i
[2024-11-20 09:25:43,809 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-20 09:25:44,056 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-20 09:25:44,057 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi008.oepc.i
[2024-11-20 09:25:44,071 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9861fd6fe/a95eb6bd671342e29ba437edafdf6987/FLAGa2196a1ef
[2024-11-20 09:25:44,085 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9861fd6fe/a95eb6bd671342e29ba437edafdf6987
[2024-11-20 09:25:44,089 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-20 09:25:44,090 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-20 09:25:44,091 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-20 09:25:44,092 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-20 09:25:44,097 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-20 09:25:44,098 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:25:44" (1/1) ...
[2024-11-20 09:25:44,099 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a629dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44, skipping insertion in model container
[2024-11-20 09:25:44,099 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:25:44" (1/1) ...
[2024-11-20 09:25:44,154 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-20 09:25:44,360 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/rfi008.oepc.i[988,1001]
[2024-11-20 09:25:44,599 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-20 09:25:44,616 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-20 09:25:44,630 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/rfi008.oepc.i[988,1001]
[2024-11-20 09:25:44,692 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-20 09:25:44,738 INFO  L204         MainTranslator]: Completed translation
[2024-11-20 09:25:44,739 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44 WrapperNode
[2024-11-20 09:25:44,739 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-20 09:25:44,740 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-20 09:25:44,741 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-20 09:25:44,741 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-20 09:25:44,749 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44" (1/1) ...
[2024-11-20 09:25:44,768 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44" (1/1) ...
[2024-11-20 09:25:44,808 INFO  L138                Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128
[2024-11-20 09:25:44,812 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-20 09:25:44,813 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-20 09:25:44,813 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-20 09:25:44,813 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-20 09:25:44,825 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44" (1/1) ...
[2024-11-20 09:25:44,826 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44" (1/1) ...
[2024-11-20 09:25:44,829 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44" (1/1) ...
[2024-11-20 09:25:44,858 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-20 09:25:44,862 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44" (1/1) ...
[2024-11-20 09:25:44,863 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44" (1/1) ...
[2024-11-20 09:25:44,872 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44" (1/1) ...
[2024-11-20 09:25:44,878 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44" (1/1) ...
[2024-11-20 09:25:44,884 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44" (1/1) ...
[2024-11-20 09:25:44,886 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44" (1/1) ...
[2024-11-20 09:25:44,893 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-20 09:25:44,894 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-20 09:25:44,894 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-20 09:25:44,894 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-20 09:25:44,895 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44" (1/1) ...
[2024-11-20 09:25:44,904 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-20 09:25:44,916 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-20 09:25:44,933 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-20 09:25:44,936 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-20 09:25:44,986 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-20 09:25:44,987 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-20 09:25:44,988 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-11-20 09:25:44,988 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-11-20 09:25:44,988 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-11-20 09:25:44,988 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-11-20 09:25:44,988 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-20 09:25:44,989 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-20 09:25:44,989 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-20 09:25:44,989 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-20 09:25:44,990 WARN  L207             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-20 09:25:45,136 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-20 09:25:45,138 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-20 09:25:45,523 INFO  L283             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-20 09:25:45,523 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-20 09:25:45,713 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-20 09:25:45,714 INFO  L316             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-20 09:25:45,715 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:25:45 BoogieIcfgContainer
[2024-11-20 09:25:45,715 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-20 09:25:45,717 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-20 09:25:45,717 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-20 09:25:45,722 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-20 09:25:45,722 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:25:44" (1/3) ...
[2024-11-20 09:25:45,723 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428b3f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:25:45, skipping insertion in model container
[2024-11-20 09:25:45,723 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:25:44" (2/3) ...
[2024-11-20 09:25:45,725 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428b3f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:25:45, skipping insertion in model container
[2024-11-20 09:25:45,725 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:25:45" (3/3) ...
[2024-11-20 09:25:45,726 INFO  L112   eAbstractionObserver]: Analyzing ICFG rfi008.oepc.i
[2024-11-20 09:25:45,745 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-20 09:25:45,746 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-11-20 09:25:45,746 INFO  L489   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-20 09:25:45,817 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-20 09:25:45,859 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 72 flow
[2024-11-20 09:25:45,884 INFO  L124   PetriNetUnfolderBase]: 1/30 cut-off events.
[2024-11-20 09:25:45,885 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-20 09:25:45,889 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. 
[2024-11-20 09:25:45,889 INFO  L82        GeneralOperation]: Start removeDead. Operand has 38 places, 32 transitions, 72 flow
[2024-11-20 09:25:45,893 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 36 places, 30 transitions, 66 flow
[2024-11-20 09:25:45,904 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-20 09:25:45,912 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;@189e9d73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-20 09:25:45,912 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-11-20 09:25:45,917 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-20 09:25:45,917 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-11-20 09:25:45,917 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-20 09:25:45,917 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-20 09:25:45,918 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-20 09:25:45,919 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-20 09:25:45,923 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-20 09:25:45,924 INFO  L85        PathProgramCache]: Analyzing trace with hash 11039958, now seen corresponding path program 1 times
[2024-11-20 09:25:45,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-20 09:25:45,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626295015]
[2024-11-20 09:25:45,934 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-20 09:25:45,935 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-20 09:25:46,065 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-20 09:25:46,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-20 09:25:46,418 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-20 09:25:46,418 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626295015]
[2024-11-20 09:25:46,419 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626295015] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-20 09:25:46,419 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-20 09:25:46,419 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-20 09:25:46,421 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422138800]
[2024-11-20 09:25:46,422 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-20 09:25:46,431 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-20 09:25:46,436 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-20 09:25:46,463 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-20 09:25:46,464 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-20 09:25:46,465 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32
[2024-11-20 09:25:46,467 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 66 flow. Second operand  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-20 09:25:46,468 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-20 09:25:46,468 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32
[2024-11-20 09:25:46,468 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-20 09:25:46,791 INFO  L124   PetriNetUnfolderBase]: 175/370 cut-off events.
[2024-11-20 09:25:46,791 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-11-20 09:25:46,793 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 692 conditions, 370 events. 175/370 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1810 event pairs, 69 based on Foata normal form. 19/381 useless extension candidates. Maximal degree in co-relation 682. Up to 265 conditions per place. 
[2024-11-20 09:25:46,798 INFO  L140   encePairwiseOnDemand]: 28/32 looper letters, 22 selfloop transitions, 2 changer transitions 2/38 dead transitions.
[2024-11-20 09:25:46,798 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 137 flow
[2024-11-20 09:25:46,801 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-20 09:25:46,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-20 09:25:46,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions.
[2024-11-20 09:25:46,812 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.7395833333333334
[2024-11-20 09:25:46,814 INFO  L175             Difference]: Start difference. First operand has 36 places, 30 transitions, 66 flow. Second operand 3 states and 71 transitions.
[2024-11-20 09:25:46,815 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 137 flow
[2024-11-20 09:25:46,818 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-20 09:25:46,821 INFO  L231             Difference]: Finished difference. Result has 35 places, 27 transitions, 62 flow
[2024-11-20 09:25:46,824 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=35, PETRI_TRANSITIONS=27}
[2024-11-20 09:25:46,827 INFO  L277   CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places.
[2024-11-20 09:25:46,828 INFO  L471      AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 62 flow
[2024-11-20 09:25:46,828 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-20 09:25:46,828 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-20 09:25:46,829 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-20 09:25:46,829 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-20 09:25:46,829 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-20 09:25:46,830 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-20 09:25:46,830 INFO  L85        PathProgramCache]: Analyzing trace with hash -590690332, now seen corresponding path program 1 times
[2024-11-20 09:25:46,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-20 09:25:46,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838234368]
[2024-11-20 09:25:46,830 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-20 09:25:46,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-20 09:25:46,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-20 09:25:47,097 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-20 09:25:47,098 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-20 09:25:47,098 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838234368]
[2024-11-20 09:25:47,098 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838234368] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-20 09:25:47,098 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-20 09:25:47,098 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-20 09:25:47,098 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423821554]
[2024-11-20 09:25:47,099 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-20 09:25:47,100 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-20 09:25:47,100 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-20 09:25:47,101 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-20 09:25:47,101 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-20 09:25:47,118 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32
[2024-11-20 09:25:47,119 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 62 flow. Second operand  has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-20 09:25:47,119 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-20 09:25:47,119 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32
[2024-11-20 09:25:47,119 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-20 09:25:47,548 INFO  L124   PetriNetUnfolderBase]: 476/886 cut-off events.
[2024-11-20 09:25:47,548 INFO  L125   PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES.
[2024-11-20 09:25:47,550 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 886 events. 476/886 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4793 event pairs, 176 based on Foata normal form. 0/854 useless extension candidates. Maximal degree in co-relation 1758. Up to 512 conditions per place. 
[2024-11-20 09:25:47,554 INFO  L140   encePairwiseOnDemand]: 25/32 looper letters, 24 selfloop transitions, 3 changer transitions 39/73 dead transitions.
[2024-11-20 09:25:47,554 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 73 transitions, 300 flow
[2024-11-20 09:25:47,555 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-20 09:25:47,555 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-20 09:25:47,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-11-20 09:25:47,556 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.546875
[2024-11-20 09:25:47,557 INFO  L175             Difference]: Start difference. First operand has 35 places, 27 transitions, 62 flow. Second operand 8 states and 140 transitions.
[2024-11-20 09:25:47,557 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 73 transitions, 300 flow
[2024-11-20 09:25:47,558 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 73 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-20 09:25:47,561 INFO  L231             Difference]: Finished difference. Result has 44 places, 28 transitions, 91 flow
[2024-11-20 09:25:47,562 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=28}
[2024-11-20 09:25:47,563 INFO  L277   CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places.
[2024-11-20 09:25:47,563 INFO  L471      AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 91 flow
[2024-11-20 09:25:47,564 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-20 09:25:47,564 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-20 09:25:47,564 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-20 09:25:47,565 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-20 09:25:47,565 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-20 09:25:47,566 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-20 09:25:47,567 INFO  L85        PathProgramCache]: Analyzing trace with hash 1235395699, now seen corresponding path program 1 times
[2024-11-20 09:25:47,568 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-20 09:25:47,568 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750719855]
[2024-11-20 09:25:47,568 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-20 09:25:47,568 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-20 09:25:47,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-20 09:25:47,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-20 09:25:47,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-20 09:25:47,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750719855]
[2024-11-20 09:25:47,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750719855] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-20 09:25:47,852 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-20 09:25:47,852 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-20 09:25:47,852 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791494889]
[2024-11-20 09:25:47,852 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-20 09:25:47,852 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-20 09:25:47,853 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-20 09:25:47,853 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-20 09:25:47,853 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-20 09:25:47,867 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32
[2024-11-20 09:25:47,868 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 91 flow. Second operand  has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-20 09:25:47,868 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-20 09:25:47,868 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32
[2024-11-20 09:25:47,868 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-20 09:25:48,147 INFO  L124   PetriNetUnfolderBase]: 337/646 cut-off events.
[2024-11-20 09:25:48,148 INFO  L125   PetriNetUnfolderBase]: For 383/386 co-relation queries the response was YES.
[2024-11-20 09:25:48,153 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1599 conditions, 646 events. 337/646 cut-off events. For 383/386 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3154 event pairs, 79 based on Foata normal form. 20/661 useless extension candidates. Maximal degree in co-relation 1584. Up to 435 conditions per place. 
[2024-11-20 09:25:48,158 INFO  L140   encePairwiseOnDemand]: 27/32 looper letters, 25 selfloop transitions, 3 changer transitions 23/58 dead transitions.
[2024-11-20 09:25:48,158 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 58 transitions, 275 flow
[2024-11-20 09:25:48,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-20 09:25:48,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-20 09:25:48,160 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-11-20 09:25:48,160 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5133928571428571
[2024-11-20 09:25:48,161 INFO  L175             Difference]: Start difference. First operand has 44 places, 28 transitions, 91 flow. Second operand 7 states and 115 transitions.
[2024-11-20 09:25:48,161 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 58 transitions, 275 flow
[2024-11-20 09:25:48,165 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 258 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-11-20 09:25:48,166 INFO  L231             Difference]: Finished difference. Result has 46 places, 28 transitions, 101 flow
[2024-11-20 09:25:48,166 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=46, PETRI_TRANSITIONS=28}
[2024-11-20 09:25:48,167 INFO  L277   CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places.
[2024-11-20 09:25:48,167 INFO  L471      AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 101 flow
[2024-11-20 09:25:48,167 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-20 09:25:48,167 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-20 09:25:48,168 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-20 09:25:48,168 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-20 09:25:48,168 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-20 09:25:48,169 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-20 09:25:48,169 INFO  L85        PathProgramCache]: Analyzing trace with hash 615484443, now seen corresponding path program 1 times
[2024-11-20 09:25:48,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-20 09:25:48,169 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415127089]
[2024-11-20 09:25:48,169 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-20 09:25:48,169 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-20 09:25:48,183 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-20 09:25:48,316 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-20 09:25:48,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-20 09:25:48,317 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415127089]
[2024-11-20 09:25:48,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415127089] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-20 09:25:48,318 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-20 09:25:48,318 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-20 09:25:48,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408863445]
[2024-11-20 09:25:48,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-20 09:25:48,319 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-20 09:25:48,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-20 09:25:48,319 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-20 09:25:48,320 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-20 09:25:48,330 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32
[2024-11-20 09:25:48,331 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 28 transitions, 101 flow. Second operand  has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-20 09:25:48,331 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-20 09:25:48,331 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32
[2024-11-20 09:25:48,331 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-20 09:25:48,639 INFO  L124   PetriNetUnfolderBase]: 309/602 cut-off events.
[2024-11-20 09:25:48,639 INFO  L125   PetriNetUnfolderBase]: For 603/606 co-relation queries the response was YES.
[2024-11-20 09:25:48,641 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 602 events. 309/602 cut-off events. For 603/606 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2849 event pairs, 165 based on Foata normal form. 26/625 useless extension candidates. Maximal degree in co-relation 1530. Up to 341 conditions per place. 
[2024-11-20 09:25:48,643 INFO  L140   encePairwiseOnDemand]: 27/32 looper letters, 26 selfloop transitions, 3 changer transitions 25/61 dead transitions.
[2024-11-20 09:25:48,644 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 305 flow
[2024-11-20 09:25:48,644 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-20 09:25:48,644 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-20 09:25:48,645 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-11-20 09:25:48,646 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5267857142857143
[2024-11-20 09:25:48,646 INFO  L175             Difference]: Start difference. First operand has 46 places, 28 transitions, 101 flow. Second operand 7 states and 118 transitions.
[2024-11-20 09:25:48,646 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 305 flow
[2024-11-20 09:25:48,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 275 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-11-20 09:25:48,650 INFO  L231             Difference]: Finished difference. Result has 47 places, 28 transitions, 102 flow
[2024-11-20 09:25:48,650 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=102, PETRI_PLACES=47, PETRI_TRANSITIONS=28}
[2024-11-20 09:25:48,651 INFO  L277   CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places.
[2024-11-20 09:25:48,651 INFO  L471      AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 102 flow
[2024-11-20 09:25:48,651 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-20 09:25:48,651 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-20 09:25:48,652 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-20 09:25:48,652 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-20 09:25:48,652 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-20 09:25:48,652 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-20 09:25:48,653 INFO  L85        PathProgramCache]: Analyzing trace with hash 1627636110, now seen corresponding path program 1 times
[2024-11-20 09:25:48,653 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-20 09:25:48,653 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512169765]
[2024-11-20 09:25:48,653 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-20 09:25:48,653 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-20 09:25:48,731 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-20 09:25:48,877 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-20 09:25:48,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-20 09:25:48,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512169765]
[2024-11-20 09:25:48,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512169765] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-20 09:25:48,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-20 09:25:48,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-20 09:25:48,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448639371]
[2024-11-20 09:25:48,878 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-20 09:25:48,879 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-20 09:25:48,880 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-20 09:25:48,880 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-20 09:25:48,881 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-20 09:25:48,884 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32
[2024-11-20 09:25:48,885 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-20 09:25:48,885 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-20 09:25:48,885 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32
[2024-11-20 09:25:48,885 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-20 09:25:49,055 INFO  L124   PetriNetUnfolderBase]: 210/441 cut-off events.
[2024-11-20 09:25:49,055 INFO  L125   PetriNetUnfolderBase]: For 309/311 co-relation queries the response was YES.
[2024-11-20 09:25:49,056 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1087 conditions, 441 events. 210/441 cut-off events. For 309/311 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1970 event pairs, 46 based on Foata normal form. 34/464 useless extension candidates. Maximal degree in co-relation 1067. Up to 163 conditions per place. 
[2024-11-20 09:25:49,058 INFO  L140   encePairwiseOnDemand]: 27/32 looper letters, 34 selfloop transitions, 4 changer transitions 1/48 dead transitions.
[2024-11-20 09:25:49,058 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 236 flow
[2024-11-20 09:25:49,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-20 09:25:49,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-20 09:25:49,060 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions.
[2024-11-20 09:25:49,060 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.65625
[2024-11-20 09:25:49,060 INFO  L175             Difference]: Start difference. First operand has 47 places, 28 transitions, 102 flow. Second operand 4 states and 84 transitions.
[2024-11-20 09:25:49,060 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 236 flow
[2024-11-20 09:25:49,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 208 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-11-20 09:25:49,063 INFO  L231             Difference]: Finished difference. Result has 40 places, 30 transitions, 108 flow
[2024-11-20 09:25:49,063 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=30}
[2024-11-20 09:25:49,064 INFO  L277   CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places.
[2024-11-20 09:25:49,064 INFO  L471      AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 108 flow
[2024-11-20 09:25:49,065 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-20 09:25:49,065 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-20 09:25:49,065 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-20 09:25:49,065 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-20 09:25:49,065 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-20 09:25:49,066 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-20 09:25:49,066 INFO  L85        PathProgramCache]: Analyzing trace with hash -1343591525, now seen corresponding path program 1 times
[2024-11-20 09:25:49,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-20 09:25:49,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408598048]
[2024-11-20 09:25:49,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-20 09:25:49,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-20 09:25:49,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-20 09:25:49,309 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-20 09:25:49,309 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-20 09:25:49,310 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408598048]
[2024-11-20 09:25:49,310 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408598048] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-20 09:25:49,310 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-20 09:25:49,310 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-20 09:25:49,314 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745345181]
[2024-11-20 09:25:49,314 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-20 09:25:49,315 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-20 09:25:49,315 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-20 09:25:49,315 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-20 09:25:49,316 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-20 09:25:49,323 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32
[2024-11-20 09:25:49,324 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 108 flow. Second operand  has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-20 09:25:49,324 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-20 09:25:49,324 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32
[2024-11-20 09:25:49,324 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-20 09:25:49,461 INFO  L124   PetriNetUnfolderBase]: 118/250 cut-off events.
[2024-11-20 09:25:49,462 INFO  L125   PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES.
[2024-11-20 09:25:49,463 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 639 conditions, 250 events. 118/250 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 848 event pairs, 32 based on Foata normal form. 18/262 useless extension candidates. Maximal degree in co-relation 623. Up to 101 conditions per place. 
[2024-11-20 09:25:49,464 INFO  L140   encePairwiseOnDemand]: 27/32 looper letters, 28 selfloop transitions, 6 changer transitions 1/44 dead transitions.
[2024-11-20 09:25:49,464 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 214 flow
[2024-11-20 09:25:49,465 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-20 09:25:49,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-20 09:25:49,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions.
[2024-11-20 09:25:49,466 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.56875
[2024-11-20 09:25:49,466 INFO  L175             Difference]: Start difference. First operand has 40 places, 30 transitions, 108 flow. Second operand 5 states and 91 transitions.
[2024-11-20 09:25:49,466 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 214 flow
[2024-11-20 09:25:49,467 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 192 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-11-20 09:25:49,468 INFO  L231             Difference]: Finished difference. Result has 42 places, 30 transitions, 112 flow
[2024-11-20 09:25:49,468 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=30}
[2024-11-20 09:25:49,469 INFO  L277   CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places.
[2024-11-20 09:25:49,470 INFO  L471      AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 112 flow
[2024-11-20 09:25:49,470 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-20 09:25:49,471 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-20 09:25:49,471 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-20 09:25:49,471 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-20 09:25:49,471 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-20 09:25:49,472 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-20 09:25:49,472 INFO  L85        PathProgramCache]: Analyzing trace with hash -57252969, now seen corresponding path program 1 times
[2024-11-20 09:25:49,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-20 09:25:49,473 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162590932]
[2024-11-20 09:25:49,473 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-20 09:25:49,473 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-20 09:25:49,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-20 09:25:50,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-20 09:25:50,227 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-20 09:25:50,227 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162590932]
[2024-11-20 09:25:50,227 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162590932] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-20 09:25:50,228 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-20 09:25:50,228 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-20 09:25:50,228 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589912715]
[2024-11-20 09:25:50,228 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-20 09:25:50,229 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-20 09:25:50,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-20 09:25:50,229 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-20 09:25:50,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-11-20 09:25:50,239 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32
[2024-11-20 09:25:50,240 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 112 flow. Second operand  has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-20 09:25:50,240 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-20 09:25:50,240 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32
[2024-11-20 09:25:50,241 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-20 09:25:50,681 INFO  L124   PetriNetUnfolderBase]: 174/370 cut-off events.
[2024-11-20 09:25:50,681 INFO  L125   PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES.
[2024-11-20 09:25:50,682 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 891 conditions, 370 events. 174/370 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1455 event pairs, 20 based on Foata normal form. 4/367 useless extension candidates. Maximal degree in co-relation 875. Up to 163 conditions per place. 
[2024-11-20 09:25:50,683 INFO  L140   encePairwiseOnDemand]: 22/32 looper letters, 25 selfloop transitions, 4 changer transitions 38/75 dead transitions.
[2024-11-20 09:25:50,683 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 360 flow
[2024-11-20 09:25:50,684 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-11-20 09:25:50,684 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-11-20 09:25:50,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 180 transitions.
[2024-11-20 09:25:50,685 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.4017857142857143
[2024-11-20 09:25:50,686 INFO  L175             Difference]: Start difference. First operand has 42 places, 30 transitions, 112 flow. Second operand 14 states and 180 transitions.
[2024-11-20 09:25:50,687 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 360 flow
[2024-11-20 09:25:50,688 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 326 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-11-20 09:25:50,690 INFO  L231             Difference]: Finished difference. Result has 56 places, 28 transitions, 99 flow
[2024-11-20 09:25:50,691 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=99, PETRI_PLACES=56, PETRI_TRANSITIONS=28}
[2024-11-20 09:25:50,691 INFO  L277   CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places.
[2024-11-20 09:25:50,693 INFO  L471      AbstractCegarLoop]: Abstraction has has 56 places, 28 transitions, 99 flow
[2024-11-20 09:25:50,693 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-20 09:25:50,693 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-20 09:25:50,693 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-20 09:25:50,694 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-20 09:25:50,694 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-20 09:25:50,694 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-20 09:25:50,694 INFO  L85        PathProgramCache]: Analyzing trace with hash -1204875655, now seen corresponding path program 2 times
[2024-11-20 09:25:50,695 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-20 09:25:50,695 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816792555]
[2024-11-20 09:25:50,695 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-20 09:25:50,695 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-20 09:25:50,766 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-20 09:25:52,802 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-20 09:25:52,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-20 09:25:52,803 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816792555]
[2024-11-20 09:25:52,803 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816792555] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-20 09:25:52,803 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-20 09:25:52,803 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-20 09:25:52,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434735007]
[2024-11-20 09:25:52,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-20 09:25:52,804 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-20 09:25:52,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-20 09:25:52,804 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-20 09:25:52,804 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2024-11-20 09:25:52,827 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32
[2024-11-20 09:25:52,828 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 28 transitions, 99 flow. Second operand  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-20 09:25:52,828 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-20 09:25:52,828 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32
[2024-11-20 09:25:52,828 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-20 09:25:53,153 INFO  L124   PetriNetUnfolderBase]: 88/226 cut-off events.
[2024-11-20 09:25:53,154 INFO  L125   PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES.
[2024-11-20 09:25:53,154 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 525 conditions, 226 events. 88/226 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 794 event pairs, 32 based on Foata normal form. 4/223 useless extension candidates. Maximal degree in co-relation 505. Up to 88 conditions per place. 
[2024-11-20 09:25:53,155 INFO  L140   encePairwiseOnDemand]: 23/32 looper letters, 20 selfloop transitions, 4 changer transitions 20/55 dead transitions.
[2024-11-20 09:25:53,156 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 257 flow
[2024-11-20 09:25:53,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-20 09:25:53,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-20 09:25:53,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions.
[2024-11-20 09:25:53,157 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.484375
[2024-11-20 09:25:53,157 INFO  L175             Difference]: Start difference. First operand has 56 places, 28 transitions, 99 flow. Second operand 10 states and 155 transitions.
[2024-11-20 09:25:53,157 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 257 flow
[2024-11-20 09:25:53,158 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 225 flow, removed 12 selfloop flow, removed 10 redundant places.
[2024-11-20 09:25:53,159 INFO  L231             Difference]: Finished difference. Result has 51 places, 28 transitions, 97 flow
[2024-11-20 09:25:53,159 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=97, PETRI_PLACES=51, PETRI_TRANSITIONS=28}
[2024-11-20 09:25:53,160 INFO  L277   CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places.
[2024-11-20 09:25:53,160 INFO  L471      AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 97 flow
[2024-11-20 09:25:53,161 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-20 09:25:53,161 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-20 09:25:53,161 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-20 09:25:53,161 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-20 09:25:53,162 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-20 09:25:53,162 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-20 09:25:53,162 INFO  L85        PathProgramCache]: Analyzing trace with hash -1216252133, now seen corresponding path program 3 times
[2024-11-20 09:25:53,162 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-20 09:25:53,163 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977710906]
[2024-11-20 09:25:53,163 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-20 09:25:53,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-20 09:25:53,290 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-20 09:25:53,290 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-20 09:25:53,377 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-20 09:25:53,413 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-20 09:25:53,413 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-20 09:25:53,414 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-11-20 09:25:53,416 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2024-11-20 09:25:53,417 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2024-11-20 09:25:53,417 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-11-20 09:25:53,418 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2024-11-20 09:25:53,434 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-20 09:25:53,434 INFO  L407         BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1]
[2024-11-20 09:25:53,506 INFO  L239   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-20 09:25:53,506 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-20 09:25:53,512 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:25:53 BasicIcfg
[2024-11-20 09:25:53,513 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-20 09:25:53,514 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-20 09:25:53,514 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-20 09:25:53,514 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-20 09:25:53,514 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:25:45" (3/4) ...
[2024-11-20 09:25:53,515 INFO  L136         WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-20 09:25:53,610 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-20 09:25:53,611 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-20 09:25:53,611 INFO  L158              Benchmark]: Toolchain (without parser) took 9521.18ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 119.1MB in the beginning and 286.3MB in the end (delta: -167.2MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB.
[2024-11-20 09:25:53,612 INFO  L158              Benchmark]: CDTParser took 0.42ms. Allocated memory is still 172.0MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-20 09:25:53,612 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 647.87ms. Allocated memory is still 172.0MB. Free memory was 118.5MB in the beginning and 91.8MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2024-11-20 09:25:53,612 INFO  L158              Benchmark]: Boogie Procedure Inliner took 72.43ms. Allocated memory is still 172.0MB. Free memory was 91.8MB in the beginning and 89.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-20 09:25:53,613 INFO  L158              Benchmark]: Boogie Preprocessor took 79.57ms. Allocated memory is still 172.0MB. Free memory was 89.1MB in the beginning and 85.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-20 09:25:53,613 INFO  L158              Benchmark]: RCFGBuilder took 821.79ms. Allocated memory is still 172.0MB. Free memory was 85.0MB in the beginning and 103.7MB in the end (delta: -18.8MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB.
[2024-11-20 09:25:53,613 INFO  L158              Benchmark]: TraceAbstraction took 7795.97ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 102.8MB in the beginning and 295.7MB in the end (delta: -193.0MB). Peak memory consumption was 168.0MB. Max. memory is 16.1GB.
[2024-11-20 09:25:53,613 INFO  L158              Benchmark]: Witness Printer took 97.29ms. Allocated memory is still 339.7MB. Free memory was 295.7MB in the beginning and 286.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-11-20 09:25:53,615 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.42ms. Allocated memory is still 172.0MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 647.87ms. Allocated memory is still 172.0MB. Free memory was 118.5MB in the beginning and 91.8MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 72.43ms. Allocated memory is still 172.0MB. Free memory was 91.8MB in the beginning and 89.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 79.57ms. Allocated memory is still 172.0MB. Free memory was 89.1MB in the beginning and 85.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 821.79ms. Allocated memory is still 172.0MB. Free memory was 85.0MB in the beginning and 103.7MB in the end (delta: -18.8MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB.
 * TraceAbstraction took 7795.97ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 102.8MB in the beginning and 295.7MB in the end (delta: -193.0MB). Peak memory consumption was 168.0MB. Max. memory is 16.1GB.
 * Witness Printer took 97.29ms. Allocated memory is still 339.7MB. Free memory was 295.7MB in the beginning and 286.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p0_EAX = 0;
[L713]               0  int __unbuffered_p0_EBX = 0;
[L715]               0  int __unbuffered_p1_EAX = 0;
[L717]               0  int __unbuffered_p1_EBX = 0;
[L718]               0  _Bool main$tmp_guard0;
[L719]               0  _Bool main$tmp_guard1;
[L721]               0  int x = 0;
[L722]               0  _Bool x$flush_delayed;
[L723]               0  int x$mem_tmp;
[L724]               0  _Bool x$r_buff0_thd0;
[L725]               0  _Bool x$r_buff0_thd1;
[L726]               0  _Bool x$r_buff0_thd2;
[L727]               0  _Bool x$r_buff1_thd0;
[L728]               0  _Bool x$r_buff1_thd1;
[L729]               0  _Bool x$r_buff1_thd2;
[L730]               0  _Bool x$read_delayed;
[L731]               0  int *x$read_delayed_var;
[L732]               0  int x$w_buff0;
[L733]               0  _Bool x$w_buff0_used;
[L734]               0  int x$w_buff1;
[L735]               0  _Bool x$w_buff1_used;
[L737]               0  int y = 0;
[L738]               0  _Bool weak$$choice0;
[L739]               0  _Bool weak$$choice2;
[L831]               0  pthread_t t1721;
[L832]  FCALL, FORK  0  pthread_create(&t1721, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1721=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L833]               0  pthread_t t1722;
[L834]  FCALL, FORK  0  pthread_create(&t1722, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1721=-1, t1722=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L743]               1  x$w_buff1 = x$w_buff0
[L744]               1  x$w_buff0 = 1
[L745]               1  x$w_buff1_used = x$w_buff0_used
[L746]               1  x$w_buff0_used = (_Bool)1
[L747]  CALL         1  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19]   COND FALSE   1  !(!expression)
[L747]  RET          1  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L748]               1  x$r_buff1_thd0 = x$r_buff0_thd0
[L749]               1  x$r_buff1_thd1 = x$r_buff0_thd1
[L750]               1  x$r_buff1_thd2 = x$r_buff0_thd2
[L751]               1  x$r_buff0_thd1 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L754]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L755]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L756]               1  x$flush_delayed = weak$$choice2
[L757]               1  x$mem_tmp = x
[L758]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L759]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L760]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L761]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L762]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L763]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L764]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765]               1  __unbuffered_p0_EAX = x
[L766]               1  x = x$flush_delayed ? x$mem_tmp : x
[L767]               1  x$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L770]               1  __unbuffered_p0_EBX = y
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L787]               2  y = 1
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L790]               2  __unbuffered_p1_EAX = y
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L793]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L794]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L795]               2  x$flush_delayed = weak$$choice2
[L796]               2  x$mem_tmp = x
[L797]               2  x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L798]               2  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L799]               2  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L800]               2  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L801]               2  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L802]               2  x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L803]               2  x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L804]               2  __unbuffered_p1_EBX = x
[L805]               2  x = x$flush_delayed ? x$mem_tmp : x
[L806]               2  x$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L809]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L810]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L811]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L812]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L813]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L773]               1  x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L774]               1  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L775]               1  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L776]               1  x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L777]               1  x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]
[L780]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]
[L816]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]
[L836]               0  main$tmp_guard0 = __unbuffered_cnt == 2
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1721=-1, t1722=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]
[L838]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
[L838]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L840]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L841]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L842]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L843]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L844]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1721=-1, t1722=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]
[L847]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1721=-1, t1722=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]
[L849]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
        VAL             [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]
[L19]                0  reach_error()
        VAL             [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]

  - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 5 procedures, 51 locations, 5 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: 7.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 320 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 132 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 901 IncrementalHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 26 mSDtfsCounter, 901 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=6, InterpolantAutomatonStates: 58, 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, 4.0s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 1083 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-11-20 09:25:53,637 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE