./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix052_tso.oepc.yml/witness.yml --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 80b1b132
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/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix052_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false
--- Real Ultimate output ---
This is Ultimate 0.2.4-?-80b1b13-m
[2024-01-31 17:39:15,739 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-01-31 17:39:15,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-01-31 17:39:15,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-01-31 17:39:15,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-01-31 17:39:15,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-01-31 17:39:15,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-01-31 17:39:15,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-01-31 17:39:15,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-01-31 17:39:15,850 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-01-31 17:39:15,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-01-31 17:39:15,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-01-31 17:39:15,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-01-31 17:39:15,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-01-31 17:39:15,853 INFO L153 SettingsManager]: * Use SBE=true
[2024-01-31 17:39:15,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-01-31 17:39:15,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-01-31 17:39:15,853 INFO L153 SettingsManager]: * sizeof long=4
[2024-01-31 17:39:15,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-01-31 17:39:15,854 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-01-31 17:39:15,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-01-31 17:39:15,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-01-31 17:39:15,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-01-31 17:39:15,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-01-31 17:39:15,855 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-01-31 17:39:15,855 INFO L153 SettingsManager]: * sizeof long double=12
[2024-01-31 17:39:15,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-01-31 17:39:15,856 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-01-31 17:39:15,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-01-31 17:39:15,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-01-31 17:39:15,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-01-31 17:39:15,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-01-31 17:39:15,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-01-31 17:39:15,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-01-31 17:39:15,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-01-31 17:39:15,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-01-31 17:39:15,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-01-31 17:39:15,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-01-31 17:39:15,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-01-31 17:39:15,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-01-31 17:39:15,859 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-01-31 17:39:15,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-01-31 17:39:15,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-01-31 17:39:15,860 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
[2024-01-31 17:39:16,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-01-31 17:39:16,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-01-31 17:39:16,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-01-31 17:39:16,074 INFO L270 PluginConnector]: Initializing Witness Parser...
[2024-01-31 17:39:16,075 INFO L274 PluginConnector]: Witness Parser initialized
[2024-01-31 17:39:16,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix052_tso.oepc.yml/witness.yml
[2024-01-31 17:39:16,582 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-01-31 17:39:16,583 INFO L274 PluginConnector]: CDTParser initialized
[2024-01-31 17:39:16,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i
[2024-01-31 17:39:17,677 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-01-31 17:39:18,051 INFO L384 CDTParser]: Found 1 translation units.
[2024-01-31 17:39:18,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i
[2024-01-31 17:39:18,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d77e35a63/a6f7ef5ac7c34254908cc4997909499a/FLAGbeb60c552
[2024-01-31 17:39:18,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d77e35a63/a6f7ef5ac7c34254908cc4997909499a
[2024-01-31 17:39:18,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-01-31 17:39:18,086 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements.
[2024-01-31 17:39:18,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-01-31 17:39:18,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-01-31 17:39:18,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-01-31 17:39:18,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:39:16" (1/2) ...
[2024-01-31 17:39:18,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c64e125 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:18, skipping insertion in model container
[2024-01-31 17:39:18,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:39:16" (1/2) ...
[2024-01-31 17:39:18,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3eb6e005 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:18, skipping insertion in model container
[2024-01-31 17:39:18,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:39:18" (2/2) ...
[2024-01-31 17:39:18,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c64e125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:18, skipping insertion in model container
[2024-01-31 17:39:18,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:39:18" (2/2) ...
[2024-01-31 17:39:18,096 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-01-31 17:39:19,533 INFO L96 nessWitnessExtractor]: Found the following entries in the witness:
[2024-01-31 17:39:19,535 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] expression == 0
[2024-01-31 17:39:19,535 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L18] expression == 1
[2024-01-31 17:39:19,565 INFO L179 MainTranslator]: Built tables and reachable declarations
[2024-01-31 17:39:19,696 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i[949,962]
[2024-01-31 17:39:19,864 INFO L209 PostProcessor]: Analyzing one entry point: main
[2024-01-31 17:39:19,882 INFO L204 MainTranslator]: Completed pre-run
[2024-01-31 17:39:19,895 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i[949,962]
Start Parsing Local
[2024-01-31 17:39:19,915 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry
[2024-01-31 17:39:19,944 INFO L209 PostProcessor]: Analyzing one entry point: main
[2024-01-31 17:39:19,972 INFO L208 MainTranslator]: Completed translation
[2024-01-31 17:39:19,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:19 WrapperNode
[2024-01-31 17:39:19,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-01-31 17:39:19,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-01-31 17:39:19,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-01-31 17:39:19,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-01-31 17:39:19,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:19" (1/1) ...
[2024-01-31 17:39:19,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:19" (1/1) ...
[2024-01-31 17:39:20,010 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146
[2024-01-31 17:39:20,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-01-31 17:39:20,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-01-31 17:39:20,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-01-31 17:39:20,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-01-31 17:39:20,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:19" (1/1) ...
[2024-01-31 17:39:20,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:19" (1/1) ...
[2024-01-31 17:39:20,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:19" (1/1) ...
[2024-01-31 17:39:20,036 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1].
[2024-01-31 17:39:20,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:19" (1/1) ...
[2024-01-31 17:39:20,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:19" (1/1) ...
[2024-01-31 17:39:20,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:19" (1/1) ...
[2024-01-31 17:39:20,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:19" (1/1) ...
[2024-01-31 17:39:20,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:19" (1/1) ...
[2024-01-31 17:39:20,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:19" (1/1) ...
[2024-01-31 17:39:20,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-01-31 17:39:20,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-01-31 17:39:20,064 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-01-31 17:39:20,064 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-01-31 17:39:20,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:19" (1/1) ...
[2024-01-31 17:39:20,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-01-31 17:39:20,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-01-31 17:39:20,088 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-01-31 17:39:20,090 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-01-31 17:39:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-01-31 17:39:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-01-31 17:39:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2
[2024-01-31 17:39:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3
[2024-01-31 17:39:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-01-31 17:39:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-01-31 17:39:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-01-31 17:39:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-01-31 17:39:20,144 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-01-31 17:39:20,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-01-31 17:39:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-01-31 17:39:20,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-01-31 17:39:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-01-31 17:39:20,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-01-31 17:39:20,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-01-31 17:39:20,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-01-31 17:39:20,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2
[2024-01-31 17:39:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3
[2024-01-31 17:39:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-01-31 17:39:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-01-31 17:39:20,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-01-31 17:39:20,151 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-01-31 17:39:20,279 INFO L244 CfgBuilder]: Building ICFG
[2024-01-31 17:39:20,296 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-01-31 17:39:20,656 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-01-31 17:39:20,657 INFO L293 CfgBuilder]: Performing block encoding
[2024-01-31 17:39:20,816 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-01-31 17:39:20,817 INFO L320 CfgBuilder]: Removed 0 assume(true) statements.
[2024-01-31 17:39:20,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:39:20 BoogieIcfgContainer
[2024-01-31 17:39:20,818 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-01-31 17:39:20,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-01-31 17:39:20,820 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-01-31 17:39:20,822 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-01-31 17:39:20,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:39:16" (1/4) ...
[2024-01-31 17:39:20,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3215b0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:39:20, skipping insertion in model container
[2024-01-31 17:39:20,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:39:18" (2/4) ...
[2024-01-31 17:39:20,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3215b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:39:20, skipping insertion in model container
[2024-01-31 17:39:20,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:19" (3/4) ...
[2024-01-31 17:39:20,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3215b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:39:20, skipping insertion in model container
[2024-01-31 17:39:20,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:39:20" (4/4) ...
[2024-01-31 17:39:20,825 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i
[2024-01-31 17:39:20,837 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-01-31 17:39:20,837 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2024-01-31 17:39:20,838 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-01-31 17:39:20,873 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-01-31 17:39:20,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 96 flow
[2024-01-31 17:39:20,938 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events.
[2024-01-31 17:39:20,938 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-01-31 17:39:20,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place.
[2024-01-31 17:39:20,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 96 flow
[2024-01-31 17:39:20,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 87 flow
[2024-01-31 17:39:20,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-01-31 17:39:20,959 INFO L357 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, mHoare=false, 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;@74b12e05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-01-31 17:39:20,959 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-01-31 17:39:20,962 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-01-31 17:39:20,962 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events.
[2024-01-31 17:39:20,962 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-01-31 17:39:20,963 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-31 17:39:20,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-01-31 17:39:20,963 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-01-31 17:39:20,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-31 17:39:20,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1769093925, now seen corresponding path program 1 times
[2024-01-31 17:39:20,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-31 17:39:20,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222495653]
[2024-01-31 17:39:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-31 17:39:20,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-31 17:39:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-31 17:39:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-31 17:39:21,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-31 17:39:21,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222495653]
[2024-01-31 17:39:21,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222495653] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-31 17:39:21,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-31 17:39:21,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-01-31 17:39:21,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467412763]
[2024-01-31 17:39:21,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-31 17:39:21,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-01-31 17:39:21,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-31 17:39:21,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-01-31 17:39:21,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-01-31 17:39:21,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42
[2024-01-31 17:39:21,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 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-01-31 17:39:21,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-31 17:39:21,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42
[2024-01-31 17:39:21,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-31 17:39:21,340 INFO L124 PetriNetUnfolderBase]: 676/1371 cut-off events.
[2024-01-31 17:39:21,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-01-31 17:39:21,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 1371 events. 676/1371 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9534 event pairs, 676 based on Foata normal form. 45/1217 useless extension candidates. Maximal degree in co-relation 2431. Up to 1029 conditions per place.
[2024-01-31 17:39:21,352 INFO L140 encePairwiseOnDemand]: 40/42 looper letters, 20 selfloop transitions, 0 changer transitions 0/37 dead transitions.
[2024-01-31 17:39:21,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 123 flow
[2024-01-31 17:39:21,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-01-31 17:39:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-01-31 17:39:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions.
[2024-01-31 17:39:21,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381
[2024-01-31 17:39:21,363 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 2 states and 62 transitions.
[2024-01-31 17:39:21,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 123 flow
[2024-01-31 17:39:21,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 37 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-01-31 17:39:21,367 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 80 flow
[2024-01-31 17:39:21,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=37}
[2024-01-31 17:39:21,370 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places.
[2024-01-31 17:39:21,371 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 80 flow
[2024-01-31 17:39:21,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 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-01-31 17:39:21,371 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-31 17:39:21,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-01-31 17:39:21,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-01-31 17:39:21,372 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-01-31 17:39:21,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-31 17:39:21,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1769093924, now seen corresponding path program 1 times
[2024-01-31 17:39:21,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-31 17:39:21,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187274683]
[2024-01-31 17:39:21,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-31 17:39:21,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-31 17:39:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-31 17:39:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-31 17:39:21,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-31 17:39:21,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187274683]
[2024-01-31 17:39:21,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187274683] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-31 17:39:21,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-31 17:39:21,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-01-31 17:39:21,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42239374]
[2024-01-31 17:39:21,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-31 17:39:21,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-01-31 17:39:21,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-31 17:39:21,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-01-31 17:39:21,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-01-31 17:39:21,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42
[2024-01-31 17:39:21,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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-01-31 17:39:21,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-31 17:39:21,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42
[2024-01-31 17:39:21,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-31 17:39:21,698 INFO L124 PetriNetUnfolderBase]: 528/1001 cut-off events.
[2024-01-31 17:39:21,698 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-01-31 17:39:21,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 1001 events. 528/1001 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5984 event pairs, 168 based on Foata normal form. 0/970 useless extension candidates. Maximal degree in co-relation 1844. Up to 652 conditions per place.
[2024-01-31 17:39:21,702 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 27 selfloop transitions, 2 changer transitions 2/48 dead transitions.
[2024-01-31 17:39:21,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 166 flow
[2024-01-31 17:39:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-01-31 17:39:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-01-31 17:39:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions.
[2024-01-31 17:39:21,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7301587301587301
[2024-01-31 17:39:21,706 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 80 flow. Second operand 3 states and 92 transitions.
[2024-01-31 17:39:21,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 166 flow
[2024-01-31 17:39:21,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-01-31 17:39:21,711 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 80 flow
[2024-01-31 17:39:21,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=35}
[2024-01-31 17:39:21,712 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places.
[2024-01-31 17:39:21,717 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 80 flow
[2024-01-31 17:39:21,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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-01-31 17:39:21,717 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-31 17:39:21,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-01-31 17:39:21,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-01-31 17:39:21,717 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-01-31 17:39:21,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-31 17:39:21,719 INFO L85 PathProgramCache]: Analyzing trace with hash 386026239, now seen corresponding path program 1 times
[2024-01-31 17:39:21,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-31 17:39:21,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880888526]
[2024-01-31 17:39:21,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-31 17:39:21,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-31 17:39:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-31 17:39:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-31 17:39:21,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-31 17:39:21,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880888526]
[2024-01-31 17:39:21,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880888526] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-31 17:39:21,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-31 17:39:21,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-01-31 17:39:21,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831169793]
[2024-01-31 17:39:21,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-31 17:39:21,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-01-31 17:39:21,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-31 17:39:21,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-01-31 17:39:21,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-01-31 17:39:21,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42
[2024-01-31 17:39:21,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-01-31 17:39:21,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-31 17:39:21,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42
[2024-01-31 17:39:21,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-31 17:39:21,905 INFO L124 PetriNetUnfolderBase]: 678/1166 cut-off events.
[2024-01-31 17:39:21,905 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES.
[2024-01-31 17:39:21,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2323 conditions, 1166 events. 678/1166 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7074 event pairs, 528 based on Foata normal form. 0/1096 useless extension candidates. Maximal degree in co-relation 2319. Up to 812 conditions per place.
[2024-01-31 17:39:21,911 INFO L140 encePairwiseOnDemand]: 40/42 looper letters, 26 selfloop transitions, 1 changer transitions 1/41 dead transitions.
[2024-01-31 17:39:21,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 150 flow
[2024-01-31 17:39:21,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-01-31 17:39:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-01-31 17:39:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions.
[2024-01-31 17:39:21,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112
[2024-01-31 17:39:21,912 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 80 flow. Second operand 3 states and 77 transitions.
[2024-01-31 17:39:21,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 150 flow
[2024-01-31 17:39:21,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-01-31 17:39:21,914 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 74 flow
[2024-01-31 17:39:21,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=33}
[2024-01-31 17:39:21,914 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places.
[2024-01-31 17:39:21,914 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 74 flow
[2024-01-31 17:39:21,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-01-31 17:39:21,915 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-31 17:39:21,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-01-31 17:39:21,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-01-31 17:39:21,915 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-01-31 17:39:21,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-31 17:39:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash -918088126, now seen corresponding path program 1 times
[2024-01-31 17:39:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-31 17:39:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72430917]
[2024-01-31 17:39:21,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-31 17:39:21,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-31 17:39:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-31 17:39:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-31 17:39:22,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-31 17:39:22,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72430917]
[2024-01-31 17:39:22,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72430917] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-31 17:39:22,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-31 17:39:22,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-01-31 17:39:22,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724111654]
[2024-01-31 17:39:22,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-31 17:39:22,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-01-31 17:39:22,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-31 17:39:22,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-01-31 17:39:22,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-01-31 17:39:22,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42
[2024-01-31 17:39:22,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-31 17:39:22,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-31 17:39:22,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42
[2024-01-31 17:39:22,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-31 17:39:22,655 INFO L124 PetriNetUnfolderBase]: 970/1677 cut-off events.
[2024-01-31 17:39:22,656 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES.
[2024-01-31 17:39:22,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1677 events. 970/1677 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10317 event pairs, 560 based on Foata normal form. 48/1717 useless extension candidates. Maximal degree in co-relation 3243. Up to 1198 conditions per place.
[2024-01-31 17:39:22,663 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 29 selfloop transitions, 3 changer transitions 27/71 dead transitions.
[2024-01-31 17:39:22,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 272 flow
[2024-01-31 17:39:22,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-01-31 17:39:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-01-31 17:39:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions.
[2024-01-31 17:39:22,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.564625850340136
[2024-01-31 17:39:22,665 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 74 flow. Second operand 7 states and 166 transitions.
[2024-01-31 17:39:22,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 272 flow
[2024-01-31 17:39:22,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-01-31 17:39:22,668 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 108 flow
[2024-01-31 17:39:22,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=53, PETRI_TRANSITIONS=35}
[2024-01-31 17:39:22,669 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places.
[2024-01-31 17:39:22,669 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 108 flow
[2024-01-31 17:39:22,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-31 17:39:22,670 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-31 17:39:22,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-01-31 17:39:22,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-01-31 17:39:22,670 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-01-31 17:39:22,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-31 17:39:22,671 INFO L85 PathProgramCache]: Analyzing trace with hash -959595391, now seen corresponding path program 1 times
[2024-01-31 17:39:22,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-31 17:39:22,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033651288]
[2024-01-31 17:39:22,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-31 17:39:22,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-31 17:39:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-31 17:39:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-31 17:39:23,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-31 17:39:23,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033651288]
[2024-01-31 17:39:23,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033651288] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-31 17:39:23,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-31 17:39:23,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-01-31 17:39:23,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564484814]
[2024-01-31 17:39:23,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-31 17:39:23,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-01-31 17:39:23,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-31 17:39:23,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-01-31 17:39:23,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-01-31 17:39:23,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42
[2024-01-31 17:39:23,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-01-31 17:39:23,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-31 17:39:23,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42
[2024-01-31 17:39:23,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-31 17:39:23,507 INFO L124 PetriNetUnfolderBase]: 938/1628 cut-off events.
[2024-01-31 17:39:23,507 INFO L125 PetriNetUnfolderBase]: For 1123/1123 co-relation queries the response was YES.
[2024-01-31 17:39:23,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4060 conditions, 1628 events. 938/1628 cut-off events. For 1123/1123 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9868 event pairs, 527 based on Foata normal form. 38/1659 useless extension candidates. Maximal degree in co-relation 4051. Up to 1179 conditions per place.
[2024-01-31 17:39:23,516 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 35 selfloop transitions, 6 changer transitions 25/78 dead transitions.
[2024-01-31 17:39:23,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 372 flow
[2024-01-31 17:39:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-01-31 17:39:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-01-31 17:39:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions.
[2024-01-31 17:39:23,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095
[2024-01-31 17:39:23,518 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 108 flow. Second operand 8 states and 188 transitions.
[2024-01-31 17:39:23,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 372 flow
[2024-01-31 17:39:23,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 361 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-01-31 17:39:23,522 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 157 flow
[2024-01-31 17:39:23,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=157, PETRI_PLACES=58, PETRI_TRANSITIONS=38}
[2024-01-31 17:39:23,523 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places.
[2024-01-31 17:39:23,523 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 157 flow
[2024-01-31 17:39:23,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-01-31 17:39:23,524 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-31 17:39:23,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-01-31 17:39:23,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-01-31 17:39:23,524 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-01-31 17:39:23,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-31 17:39:23,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1885767524, now seen corresponding path program 1 times
[2024-01-31 17:39:23,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-31 17:39:23,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444776857]
[2024-01-31 17:39:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-31 17:39:23,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-31 17:39:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-31 17:39:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-31 17:39:23,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-31 17:39:23,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444776857]
[2024-01-31 17:39:23,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444776857] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-31 17:39:23,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-31 17:39:23,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-01-31 17:39:23,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785751226]
[2024-01-31 17:39:23,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-31 17:39:23,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-01-31 17:39:23,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-31 17:39:23,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-01-31 17:39:23,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-01-31 17:39:23,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-01-31 17:39:23,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-01-31 17:39:23,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-31 17:39:23,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-01-31 17:39:23,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-31 17:39:24,328 INFO L124 PetriNetUnfolderBase]: 1699/2767 cut-off events.
[2024-01-31 17:39:24,328 INFO L125 PetriNetUnfolderBase]: For 5020/5020 co-relation queries the response was YES.
[2024-01-31 17:39:24,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8619 conditions, 2767 events. 1699/2767 cut-off events. For 5020/5020 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 16513 event pairs, 552 based on Foata normal form. 69/2826 useless extension candidates. Maximal degree in co-relation 8607. Up to 1813 conditions per place.
[2024-01-31 17:39:24,345 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 45 selfloop transitions, 7 changer transitions 42/104 dead transitions.
[2024-01-31 17:39:24,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 104 transitions, 617 flow
[2024-01-31 17:39:24,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-01-31 17:39:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-01-31 17:39:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 222 transitions.
[2024-01-31 17:39:24,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286
[2024-01-31 17:39:24,347 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 157 flow. Second operand 10 states and 222 transitions.
[2024-01-31 17:39:24,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 104 transitions, 617 flow
[2024-01-31 17:39:24,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 104 transitions, 586 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-01-31 17:39:24,362 INFO L231 Difference]: Finished difference. Result has 67 places, 42 transitions, 204 flow
[2024-01-31 17:39:24,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=204, PETRI_PLACES=67, PETRI_TRANSITIONS=42}
[2024-01-31 17:39:24,364 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places.
[2024-01-31 17:39:24,365 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 42 transitions, 204 flow
[2024-01-31 17:39:24,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-01-31 17:39:24,365 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-31 17:39:24,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-01-31 17:39:24,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-01-31 17:39:24,366 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-01-31 17:39:24,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-31 17:39:24,366 INFO L85 PathProgramCache]: Analyzing trace with hash -746845634, now seen corresponding path program 1 times
[2024-01-31 17:39:24,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-31 17:39:24,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876524456]
[2024-01-31 17:39:24,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-31 17:39:24,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-31 17:39:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-31 17:39:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-31 17:39:24,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-31 17:39:24,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876524456]
[2024-01-31 17:39:24,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876524456] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-31 17:39:24,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-31 17:39:24,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-01-31 17:39:24,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241944021]
[2024-01-31 17:39:24,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-31 17:39:24,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-01-31 17:39:24,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-31 17:39:24,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-01-31 17:39:24,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-01-31 17:39:24,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42
[2024-01-31 17:39:24,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 42 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-01-31 17:39:24,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-31 17:39:24,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42
[2024-01-31 17:39:24,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-31 17:39:24,821 INFO L124 PetriNetUnfolderBase]: 1917/3199 cut-off events.
[2024-01-31 17:39:24,822 INFO L125 PetriNetUnfolderBase]: For 7767/7795 co-relation queries the response was YES.
[2024-01-31 17:39:24,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10433 conditions, 3199 events. 1917/3199 cut-off events. For 7767/7795 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 19377 event pairs, 236 based on Foata normal form. 160/3289 useless extension candidates. Maximal degree in co-relation 10415. Up to 1606 conditions per place.
[2024-01-31 17:39:24,906 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 51 selfloop transitions, 5 changer transitions 0/71 dead transitions.
[2024-01-31 17:39:24,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 456 flow
[2024-01-31 17:39:24,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-01-31 17:39:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-01-31 17:39:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions.
[2024-01-31 17:39:24,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857
[2024-01-31 17:39:24,907 INFO L175 Difference]: Start difference. First operand has 67 places, 42 transitions, 204 flow. Second operand 4 states and 111 transitions.
[2024-01-31 17:39:24,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 456 flow
[2024-01-31 17:39:24,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 425 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-01-31 17:39:24,916 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 225 flow
[2024-01-31 17:39:24,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=61, PETRI_TRANSITIONS=46}
[2024-01-31 17:39:24,917 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places.
[2024-01-31 17:39:24,917 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 225 flow
[2024-01-31 17:39:24,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-01-31 17:39:24,917 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-31 17:39:24,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-01-31 17:39:24,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-01-31 17:39:24,917 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-01-31 17:39:24,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-31 17:39:24,918 INFO L85 PathProgramCache]: Analyzing trace with hash 838833347, now seen corresponding path program 1 times
[2024-01-31 17:39:24,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-31 17:39:24,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377293471]
[2024-01-31 17:39:24,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-31 17:39:24,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-31 17:39:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-31 17:39:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-31 17:39:25,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-31 17:39:25,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377293471]
[2024-01-31 17:39:25,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377293471] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-31 17:39:25,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-31 17:39:25,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-01-31 17:39:25,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329165362]
[2024-01-31 17:39:25,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-31 17:39:25,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-01-31 17:39:25,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-31 17:39:25,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-01-31 17:39:25,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-01-31 17:39:25,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42
[2024-01-31 17:39:25,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-01-31 17:39:25,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-31 17:39:25,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42
[2024-01-31 17:39:25,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-31 17:39:25,279 INFO L124 PetriNetUnfolderBase]: 1376/2336 cut-off events.
[2024-01-31 17:39:25,279 INFO L125 PetriNetUnfolderBase]: For 4269/4287 co-relation queries the response was YES.
[2024-01-31 17:39:25,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7505 conditions, 2336 events. 1376/2336 cut-off events. For 4269/4287 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13177 event pairs, 152 based on Foata normal form. 124/2401 useless extension candidates. Maximal degree in co-relation 7489. Up to 664 conditions per place.
[2024-01-31 17:39:25,291 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 61 selfloop transitions, 8 changer transitions 0/84 dead transitions.
[2024-01-31 17:39:25,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 540 flow
[2024-01-31 17:39:25,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-01-31 17:39:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-01-31 17:39:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions.
[2024-01-31 17:39:25,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714
[2024-01-31 17:39:25,292 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 225 flow. Second operand 5 states and 141 transitions.
[2024-01-31 17:39:25,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 84 transitions, 540 flow
[2024-01-31 17:39:25,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 84 transitions, 537 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-01-31 17:39:25,302 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 277 flow
[2024-01-31 17:39:25,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=66, PETRI_TRANSITIONS=50}
[2024-01-31 17:39:25,302 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places.
[2024-01-31 17:39:25,302 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 277 flow
[2024-01-31 17:39:25,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-01-31 17:39:25,302 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-31 17:39:25,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-01-31 17:39:25,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-01-31 17:39:25,303 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-01-31 17:39:25,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-31 17:39:25,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1929212772, now seen corresponding path program 1 times
[2024-01-31 17:39:25,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-31 17:39:25,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608621062]
[2024-01-31 17:39:25,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-31 17:39:25,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-31 17:39:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-31 17:39:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-31 17:39:25,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-31 17:39:25,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608621062]
[2024-01-31 17:39:25,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608621062] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-31 17:39:25,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-31 17:39:25,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-01-31 17:39:25,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598198111]
[2024-01-31 17:39:25,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-31 17:39:25,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-01-31 17:39:25,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-31 17:39:25,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-01-31 17:39:25,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-01-31 17:39:25,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42
[2024-01-31 17:39:25,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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-01-31 17:39:25,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-31 17:39:25,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42
[2024-01-31 17:39:25,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-31 17:39:25,669 INFO L124 PetriNetUnfolderBase]: 1064/1772 cut-off events.
[2024-01-31 17:39:25,669 INFO L125 PetriNetUnfolderBase]: For 4570/4588 co-relation queries the response was YES.
[2024-01-31 17:39:25,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6219 conditions, 1772 events. 1064/1772 cut-off events. For 4570/4588 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9446 event pairs, 144 based on Foata normal form. 64/1781 useless extension candidates. Maximal degree in co-relation 6201. Up to 664 conditions per place.
[2024-01-31 17:39:25,677 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 55 selfloop transitions, 11 changer transitions 0/81 dead transitions.
[2024-01-31 17:39:25,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 538 flow
[2024-01-31 17:39:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-01-31 17:39:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-01-31 17:39:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions.
[2024-01-31 17:39:25,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6150793650793651
[2024-01-31 17:39:25,678 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 277 flow. Second operand 6 states and 155 transitions.
[2024-01-31 17:39:25,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 538 flow
[2024-01-31 17:39:25,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 81 transitions, 487 flow, removed 22 selfloop flow, removed 6 redundant places.
[2024-01-31 17:39:25,682 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 279 flow
[2024-01-31 17:39:25,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=279, PETRI_PLACES=67, PETRI_TRANSITIONS=51}
[2024-01-31 17:39:25,683 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places.
[2024-01-31 17:39:25,683 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 279 flow
[2024-01-31 17:39:25,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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-01-31 17:39:25,684 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-31 17:39:25,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-01-31 17:39:25,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-01-31 17:39:25,684 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-01-31 17:39:25,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-31 17:39:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash 915979173, now seen corresponding path program 1 times
[2024-01-31 17:39:25,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-31 17:39:25,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843788414]
[2024-01-31 17:39:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-31 17:39:25,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-31 17:39:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-31 17:39:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-31 17:39:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-31 17:39:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843788414]
[2024-01-31 17:39:25,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843788414] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-31 17:39:25,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-31 17:39:25,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-01-31 17:39:25,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113142977]
[2024-01-31 17:39:25,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-31 17:39:25,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-01-31 17:39:25,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-31 17:39:25,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-01-31 17:39:25,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-01-31 17:39:25,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-01-31 17:39:25,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-01-31 17:39:25,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-31 17:39:25,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-01-31 17:39:25,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-31 17:39:26,337 INFO L124 PetriNetUnfolderBase]: 1206/2287 cut-off events.
[2024-01-31 17:39:26,337 INFO L125 PetriNetUnfolderBase]: For 4589/5013 co-relation queries the response was YES.
[2024-01-31 17:39:26,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6936 conditions, 2287 events. 1206/2287 cut-off events. For 4589/5013 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 14814 event pairs, 204 based on Foata normal form. 56/2161 useless extension candidates. Maximal degree in co-relation 6920. Up to 870 conditions per place.
[2024-01-31 17:39:26,345 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 36 selfloop transitions, 4 changer transitions 40/101 dead transitions.
[2024-01-31 17:39:26,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 101 transitions, 627 flow
[2024-01-31 17:39:26,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-01-31 17:39:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-01-31 17:39:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions.
[2024-01-31 17:39:26,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5148809523809523
[2024-01-31 17:39:26,346 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 279 flow. Second operand 8 states and 173 transitions.
[2024-01-31 17:39:26,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 101 transitions, 627 flow
[2024-01-31 17:39:26,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 101 transitions, 575 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-01-31 17:39:26,356 INFO L231 Difference]: Finished difference. Result has 74 places, 49 transitions, 252 flow
[2024-01-31 17:39:26,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=252, PETRI_PLACES=74, PETRI_TRANSITIONS=49}
[2024-01-31 17:39:26,357 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 26 predicate places.
[2024-01-31 17:39:26,357 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 49 transitions, 252 flow
[2024-01-31 17:39:26,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-01-31 17:39:26,358 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-31 17:39:26,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-01-31 17:39:26,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-01-31 17:39:26,358 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-01-31 17:39:26,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-31 17:39:26,358 INFO L85 PathProgramCache]: Analyzing trace with hash 625825477, now seen corresponding path program 2 times
[2024-01-31 17:39:26,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-31 17:39:26,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114505096]
[2024-01-31 17:39:26,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-31 17:39:26,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-31 17:39:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-31 17:39:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-31 17:39:26,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-31 17:39:26,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114505096]
[2024-01-31 17:39:26,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114505096] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-31 17:39:26,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-31 17:39:26,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-01-31 17:39:26,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134720543]
[2024-01-31 17:39:26,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-31 17:39:26,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-01-31 17:39:26,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-31 17:39:26,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-01-31 17:39:26,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-01-31 17:39:26,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42
[2024-01-31 17:39:26,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 49 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-31 17:39:26,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-31 17:39:26,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42
[2024-01-31 17:39:26,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-31 17:39:26,733 INFO L124 PetriNetUnfolderBase]: 919/1790 cut-off events.
[2024-01-31 17:39:26,733 INFO L125 PetriNetUnfolderBase]: For 2001/2157 co-relation queries the response was YES.
[2024-01-31 17:39:26,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4932 conditions, 1790 events. 919/1790 cut-off events. For 2001/2157 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11813 event pairs, 263 based on Foata normal form. 36/1628 useless extension candidates. Maximal degree in co-relation 4913. Up to 671 conditions per place.
[2024-01-31 17:39:26,740 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 27 selfloop transitions, 1 changer transitions 27/76 dead transitions.
[2024-01-31 17:39:26,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 76 transitions, 452 flow
[2024-01-31 17:39:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-01-31 17:39:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-01-31 17:39:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions.
[2024-01-31 17:39:26,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198412698412699
[2024-01-31 17:39:26,742 INFO L175 Difference]: Start difference. First operand has 74 places, 49 transitions, 252 flow. Second operand 6 states and 131 transitions.
[2024-01-31 17:39:26,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 76 transitions, 452 flow
[2024-01-31 17:39:26,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 76 transitions, 434 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-01-31 17:39:26,750 INFO L231 Difference]: Finished difference. Result has 74 places, 45 transitions, 223 flow
[2024-01-31 17:39:26,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=74, PETRI_TRANSITIONS=45}
[2024-01-31 17:39:26,751 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 26 predicate places.
[2024-01-31 17:39:26,751 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 45 transitions, 223 flow
[2024-01-31 17:39:26,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-31 17:39:26,751 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-31 17:39:26,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-01-31 17:39:26,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-01-31 17:39:26,751 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-01-31 17:39:26,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-31 17:39:26,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1707269511, now seen corresponding path program 3 times
[2024-01-31 17:39:26,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-31 17:39:26,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239824766]
[2024-01-31 17:39:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-31 17:39:26,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-31 17:39:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-31 17:39:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-31 17:39:27,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-31 17:39:27,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239824766]
[2024-01-31 17:39:27,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239824766] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-31 17:39:27,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-31 17:39:27,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-01-31 17:39:27,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133956475]
[2024-01-31 17:39:27,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-31 17:39:27,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-01-31 17:39:27,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-31 17:39:27,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-01-31 17:39:27,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-01-31 17:39:27,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42
[2024-01-31 17:39:27,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 45 transitions, 223 flow. Second operand has 11 states, 11 states have (on average 16.636363636363637) internal successors, (183), 11 states have internal predecessors, (183), 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-01-31 17:39:27,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-31 17:39:27,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42
[2024-01-31 17:39:27,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-31 17:39:27,902 INFO L124 PetriNetUnfolderBase]: 651/1368 cut-off events.
[2024-01-31 17:39:27,902 INFO L125 PetriNetUnfolderBase]: For 1443/1593 co-relation queries the response was YES.
[2024-01-31 17:39:27,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3840 conditions, 1368 events. 651/1368 cut-off events. For 1443/1593 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8478 event pairs, 189 based on Foata normal form. 29/1276 useless extension candidates. Maximal degree in co-relation 3820. Up to 464 conditions per place.
[2024-01-31 17:39:27,910 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 28 selfloop transitions, 3 changer transitions 22/74 dead transitions.
[2024-01-31 17:39:27,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 74 transitions, 421 flow
[2024-01-31 17:39:27,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-01-31 17:39:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-01-31 17:39:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions.
[2024-01-31 17:39:27,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714
[2024-01-31 17:39:27,912 INFO L175 Difference]: Start difference. First operand has 74 places, 45 transitions, 223 flow. Second operand 8 states and 171 transitions.
[2024-01-31 17:39:27,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 74 transitions, 421 flow
[2024-01-31 17:39:27,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 74 transitions, 394 flow, removed 10 selfloop flow, removed 8 redundant places.
[2024-01-31 17:39:27,918 INFO L231 Difference]: Finished difference. Result has 73 places, 44 transitions, 217 flow
[2024-01-31 17:39:27,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=217, PETRI_PLACES=73, PETRI_TRANSITIONS=44}
[2024-01-31 17:39:27,920 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 25 predicate places.
[2024-01-31 17:39:27,920 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 44 transitions, 217 flow
[2024-01-31 17:39:27,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.636363636363637) internal successors, (183), 11 states have internal predecessors, (183), 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-01-31 17:39:27,920 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-31 17:39:27,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-01-31 17:39:27,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-01-31 17:39:27,921 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-01-31 17:39:27,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-31 17:39:27,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1120098983, now seen corresponding path program 4 times
[2024-01-31 17:39:27,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-31 17:39:27,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920567773]
[2024-01-31 17:39:27,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-31 17:39:27,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-31 17:39:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-01-31 17:39:27,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-01-31 17:39:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-01-31 17:39:28,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-01-31 17:39:28,038 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2024-01-31 17:39:28,039 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining)
[2024-01-31 17:39:28,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 9 remaining)
[2024-01-31 17:39:28,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining)
[2024-01-31 17:39:28,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining)
[2024-01-31 17:39:28,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining)
[2024-01-31 17:39:28,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining)
[2024-01-31 17:39:28,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining)
[2024-01-31 17:39:28,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 9 remaining)
[2024-01-31 17:39:28,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining)
[2024-01-31 17:39:28,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-01-31 17:39:28,042 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-01-31 17:39:28,046 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-01-31 17:39:28,046 INFO L179 ceAbstractionStarter]: Computing trace abstraction results
[2024-01-31 17:39:28,106 INFO L503 ceAbstractionStarter]: Automizer considered 2 witness invariants
[2024-01-31 17:39:28,106 INFO L504 ceAbstractionStarter]: WitnessConsidered=2
[2024-01-31 17:39:28,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:39:28 BasicIcfg
[2024-01-31 17:39:28,107 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-01-31 17:39:28,108 INFO L158 Benchmark]: Toolchain (without parser) took 10022.03ms. Allocated memory was 234.9MB in the beginning and 757.1MB in the end (delta: 522.2MB). Free memory was 178.5MB in the beginning and 626.6MB in the end (delta: -448.1MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB.
[2024-01-31 17:39:28,108 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 132.1MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-01-31 17:39:28,108 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 132.1MB. Free memory is still 58.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-01-31 17:39:28,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1884.98ms. Allocated memory was 234.9MB in the beginning and 352.3MB in the end (delta: 117.4MB). Free memory was 178.5MB in the beginning and 168.6MB in the end (delta: 9.9MB). Peak memory consumption was 161.8MB. Max. memory is 16.1GB.
[2024-01-31 17:39:28,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.63ms. Allocated memory is still 352.3MB. Free memory was 168.6MB in the beginning and 165.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-01-31 17:39:28,109 INFO L158 Benchmark]: Boogie Preprocessor took 51.49ms. Allocated memory is still 352.3MB. Free memory was 165.8MB in the beginning and 162.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-01-31 17:39:28,109 INFO L158 Benchmark]: RCFGBuilder took 754.10ms. Allocated memory is still 352.3MB. Free memory was 162.3MB in the beginning and 298.2MB in the end (delta: -135.9MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB.
[2024-01-31 17:39:28,109 INFO L158 Benchmark]: TraceAbstraction took 7287.42ms. Allocated memory was 352.3MB in the beginning and 757.1MB in the end (delta: 404.8MB). Free memory was 297.1MB in the beginning and 626.6MB in the end (delta: -329.4MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB.
[2024-01-31 17:39:28,110 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* Witness Parser took 0.17ms. Allocated memory is still 132.1MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB.
* CDTParser took 0.14ms. Allocated memory is still 132.1MB. Free memory is still 58.3MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 1884.98ms. Allocated memory was 234.9MB in the beginning and 352.3MB in the end (delta: 117.4MB). Free memory was 178.5MB in the beginning and 168.6MB in the end (delta: 9.9MB). Peak memory consumption was 161.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 37.63ms. Allocated memory is still 352.3MB. Free memory was 168.6MB in the beginning and 165.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 51.49ms. Allocated memory is still 352.3MB. Free memory was 165.8MB in the beginning and 162.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 754.10ms. Allocated memory is still 352.3MB. Free memory was 162.3MB in the beginning and 298.2MB in the end (delta: -135.9MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 7287.42ms. Allocated memory was 352.3MB in the beginning and 757.1MB in the end (delta: 404.8MB). Free memory was 297.1MB in the beginning and 626.6MB in the end (delta: -329.4MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p1_EAX = 0;
[L713] 0 int __unbuffered_p2_EAX = 0;
[L714] 0 _Bool main$tmp_guard0;
[L715] 0 _Bool main$tmp_guard1;
[L717] 0 int x = 0;
[L718] 0 _Bool x$flush_delayed;
[L719] 0 int x$mem_tmp;
[L720] 0 _Bool x$r_buff0_thd0;
[L721] 0 _Bool x$r_buff0_thd1;
[L722] 0 _Bool x$r_buff0_thd2;
[L723] 0 _Bool x$r_buff0_thd3;
[L724] 0 _Bool x$r_buff1_thd0;
[L725] 0 _Bool x$r_buff1_thd1;
[L726] 0 _Bool x$r_buff1_thd2;
[L727] 0 _Bool x$r_buff1_thd3;
[L728] 0 _Bool x$read_delayed;
[L729] 0 int *x$read_delayed_var;
[L730] 0 int x$w_buff0;
[L731] 0 _Bool x$w_buff0_used;
[L732] 0 int x$w_buff1;
[L733] 0 _Bool x$w_buff1_used;
[L735] 0 int y = 0;
[L737] 0 int z = 0;
[L738] 0 _Bool weak$$choice0;
[L739] 0 _Bool weak$$choice2;
[L820] 0 pthread_t t1403;
[L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1403={5: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0]
[L822] 0 pthread_t t1404;
[L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1403={5:0}, t1404={6: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0]
[L824] 0 pthread_t t1405;
[L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0]
[L763] 2 x$w_buff1 = x$w_buff0
[L764] 2 x$w_buff0 = 2
[L765] 2 x$w_buff1_used = x$w_buff0_used
[L766] 2 x$w_buff0_used = (_Bool)1
[L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L18] COND FALSE 2 !(!expression)
[L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L772] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L775] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L792] 3 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L795] 3 __unbuffered_p2_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L743] 1 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L746] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L749] 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)
[L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L751] 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
[L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L753] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L778] 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)
[L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L780] 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
[L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L782] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
[L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
[L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
[L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
[L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
[L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3: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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
[L829] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L829] RET 0 assume_abort_if_not(main$tmp_guard0)
[L831] 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)
[L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L833] 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
[L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L835] 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 [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3: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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
[L838] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L839] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L840] 0 x$flush_delayed = weak$$choice2
[L841] 0 x$mem_tmp = x
[L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0)
[L850] 0 x = x$flush_delayed ? x$mem_tmp : x
[L851] 0 x$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
[L853] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
[L18] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]]
VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
[L18] 0 reach_error()
VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
- UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds
Unable to prove that invariant of correctness witness holds
Reason: Not analyzed.
- UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds
Unable to prove that invariant of correctness witness holds
Reason: Not analyzed.
- UnprovableResult [Line: 825]: 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: 821]: 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: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 68 locations, 9 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.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 487 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 471 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 203 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1380 IncrementalHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 26 mSDtfsCounter, 1380 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=9, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 1660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-01-31 17:39:28,131 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