./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version a340643f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-a340643-m
[2024-01-27 16:13:12,822 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-01-27 16:13:12,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-01-27 16:13:12,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-01-27 16:13:12,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-01-27 16:13:12,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-01-27 16:13:12,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-01-27 16:13:12,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-01-27 16:13:12,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-01-27 16:13:12,916 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-01-27 16:13:12,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-01-27 16:13:12,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-01-27 16:13:12,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-01-27 16:13:12,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-01-27 16:13:12,919 INFO L153 SettingsManager]: * Use SBE=true
[2024-01-27 16:13:12,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-01-27 16:13:12,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-01-27 16:13:12,920 INFO L153 SettingsManager]: * sizeof long=4
[2024-01-27 16:13:12,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-01-27 16:13:12,920 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-01-27 16:13:12,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-01-27 16:13:12,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-01-27 16:13:12,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-01-27 16:13:12,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-01-27 16:13:12,921 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-01-27 16:13:12,921 INFO L153 SettingsManager]: * sizeof long double=12
[2024-01-27 16:13:12,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-01-27 16:13:12,922 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-01-27 16:13:12,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-01-27 16:13:12,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-01-27 16:13:12,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-01-27 16:13:12,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-01-27 16:13:12,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-01-27 16:13:12,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-01-27 16:13:12,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-01-27 16:13:12,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-01-27 16:13:12,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-01-27 16:13:12,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-01-27 16:13:12,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-01-27 16:13:12,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-01-27 16:13:12,926 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-01-27 16:13:12,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-01-27 16:13:12,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-01-27 16:13:12,926 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21
[2024-01-27 16:13:13,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-01-27 16:13:13,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-01-27 16:13:13,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-01-27 16:13:13,143 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-01-27 16:13:13,143 INFO L274 PluginConnector]: CDTParser initialized
[2024-01-27 16:13:13,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i
[2024-01-27 16:13:14,209 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-01-27 16:13:14,418 INFO L384 CDTParser]: Found 1 translation units.
[2024-01-27 16:13:14,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i
[2024-01-27 16:13:14,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3714d9cc/655d134ad03c4d0bb2bee5e2c1d3d392/FLAG6768801cc
[2024-01-27 16:13:14,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3714d9cc/655d134ad03c4d0bb2bee5e2c1d3d392
[2024-01-27 16:13:14,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-01-27 16:13:14,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-01-27 16:13:14,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-01-27 16:13:14,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-01-27 16:13:14,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-01-27 16:13:14,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:13:14" (1/1) ...
[2024-01-27 16:13:14,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66870e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14, skipping insertion in model container
[2024-01-27 16:13:14,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:13:14" (1/1) ...
[2024-01-27 16:13:14,501 INFO L177 MainTranslator]: Built tables and reachable declarations
[2024-01-27 16:13:14,644 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/mix035_power.opt_rmo.opt.i[1001,1014]
[2024-01-27 16:13:14,825 INFO L209 PostProcessor]: Analyzing one entry point: main
[2024-01-27 16:13:14,843 INFO L202 MainTranslator]: Completed pre-run
[2024-01-27 16:13:14,852 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/mix035_power.opt_rmo.opt.i[1001,1014]
[2024-01-27 16:13:14,911 INFO L209 PostProcessor]: Analyzing one entry point: main
[2024-01-27 16:13:14,946 INFO L206 MainTranslator]: Completed translation
[2024-01-27 16:13:14,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14 WrapperNode
[2024-01-27 16:13:14,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-01-27 16:13:14,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-01-27 16:13:14,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-01-27 16:13:14,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-01-27 16:13:14,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14" (1/1) ...
[2024-01-27 16:13:14,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14" (1/1) ...
[2024-01-27 16:13:15,016 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130
[2024-01-27 16:13:15,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-01-27 16:13:15,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-01-27 16:13:15,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-01-27 16:13:15,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-01-27 16:13:15,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14" (1/1) ...
[2024-01-27 16:13:15,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14" (1/1) ...
[2024-01-27 16:13:15,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14" (1/1) ...
[2024-01-27 16:13:15,066 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-27 16:13:15,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14" (1/1) ...
[2024-01-27 16:13:15,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14" (1/1) ...
[2024-01-27 16:13:15,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14" (1/1) ...
[2024-01-27 16:13:15,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14" (1/1) ...
[2024-01-27 16:13:15,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14" (1/1) ...
[2024-01-27 16:13:15,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14" (1/1) ...
[2024-01-27 16:13:15,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-01-27 16:13:15,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-01-27 16:13:15,090 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-01-27 16:13:15,090 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-01-27 16:13:15,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14" (1/1) ...
[2024-01-27 16:13:15,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-01-27 16:13:15,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-01-27 16:13:15,147 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-27 16:13:15,160 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-27 16:13:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-01-27 16:13:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-01-27 16:13:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2
[2024-01-27 16:13:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3
[2024-01-27 16:13:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-01-27 16:13:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-01-27 16:13:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-01-27 16:13:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-01-27 16:13:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-01-27 16:13:15,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-01-27 16:13:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-01-27 16:13:15,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-01-27 16:13:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-01-27 16:13:15,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-01-27 16:13:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-01-27 16:13:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-01-27 16:13:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2
[2024-01-27 16:13:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3
[2024-01-27 16:13:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-01-27 16:13:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-01-27 16:13:15,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-01-27 16:13:15,207 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-01-27 16:13:15,335 INFO L244 CfgBuilder]: Building ICFG
[2024-01-27 16:13:15,338 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-01-27 16:13:15,776 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-01-27 16:13:15,776 INFO L293 CfgBuilder]: Performing block encoding
[2024-01-27 16:13:16,040 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-01-27 16:13:16,040 INFO L320 CfgBuilder]: Removed 0 assume(true) statements.
[2024-01-27 16:13:16,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:13:16 BoogieIcfgContainer
[2024-01-27 16:13:16,041 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-01-27 16:13:16,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-01-27 16:13:16,057 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-01-27 16:13:16,059 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-01-27 16:13:16,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:13:14" (1/3) ...
[2024-01-27 16:13:16,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119a7a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:13:16, skipping insertion in model container
[2024-01-27 16:13:16,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:14" (2/3) ...
[2024-01-27 16:13:16,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119a7a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:13:16, skipping insertion in model container
[2024-01-27 16:13:16,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:13:16" (3/3) ...
[2024-01-27 16:13:16,062 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i
[2024-01-27 16:13:16,069 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-01-27 16:13:16,080 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-01-27 16:13:16,081 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-01-27 16:13:16,081 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-01-27 16:13:16,162 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-01-27 16:13:16,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow
[2024-01-27 16:13:16,258 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events.
[2024-01-27 16:13:16,259 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-01-27 16:13:16,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place.
[2024-01-27 16:13:16,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow
[2024-01-27 16:13:16,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow
[2024-01-27 16:13:16,271 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-01-27 16:13:16,276 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=true, 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;@774d9358, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-01-27 16:13:16,277 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-01-27 16:13:16,281 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-01-27 16:13:16,281 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events.
[2024-01-27 16:13:16,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-01-27 16:13:16,281 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-27 16:13:16,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-01-27 16:13:16,282 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-01-27 16:13:16,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-27 16:13:16,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2062483669, now seen corresponding path program 1 times
[2024-01-27 16:13:16,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-27 16:13:16,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688046539]
[2024-01-27 16:13:16,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-27 16:13:16,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-27 16:13:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-27 16:13:16,764 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-27 16:13:16,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-27 16:13:16,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688046539]
[2024-01-27 16:13:16,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688046539] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-27 16:13:16,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-27 16:13:16,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-01-27 16:13:16,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911461066]
[2024-01-27 16:13:16,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-27 16:13:16,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-01-27 16:13:16,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-27 16:13:16,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-01-27 16:13:16,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-01-27 16:13:16,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 41
[2024-01-27 16:13:16,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-27 16:13:16,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-27 16:13:16,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 41
[2024-01-27 16:13:16,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-27 16:13:16,996 INFO L124 PetriNetUnfolderBase]: 453/872 cut-off events.
[2024-01-27 16:13:16,996 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES.
[2024-01-27 16:13:17,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1609 conditions, 872 events. 453/872 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5203 event pairs, 144 based on Foata normal form. 36/871 useless extension candidates. Maximal degree in co-relation 1598. Up to 562 conditions per place.
[2024-01-27 16:13:17,006 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 25 selfloop transitions, 2 changer transitions 2/47 dead transitions.
[2024-01-27 16:13:17,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 164 flow
[2024-01-27 16:13:17,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-01-27 16:13:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-01-27 16:13:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions.
[2024-01-27 16:13:17,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7723577235772358
[2024-01-27 16:13:17,017 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 95 transitions.
[2024-01-27 16:13:17,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 164 flow
[2024-01-27 16:13:17,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-01-27 16:13:17,023 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow
[2024-01-27 16:13:17,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=45, PETRI_TRANSITIONS=35}
[2024-01-27 16:13:17,028 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places.
[2024-01-27 16:13:17,028 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow
[2024-01-27 16:13:17,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-27 16:13:17,029 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-27 16:13:17,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-01-27 16:13:17,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-01-27 16:13:17,029 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-01-27 16:13:17,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-27 16:13:17,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1660733467, now seen corresponding path program 1 times
[2024-01-27 16:13:17,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-27 16:13:17,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011219636]
[2024-01-27 16:13:17,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-27 16:13:17,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-27 16:13:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-27 16:13:17,314 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-27 16:13:17,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-27 16:13:17,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011219636]
[2024-01-27 16:13:17,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011219636] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-27 16:13:17,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-27 16:13:17,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-01-27 16:13:17,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29124764]
[2024-01-27 16:13:17,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-27 16:13:17,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-01-27 16:13:17,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-27 16:13:17,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-01-27 16:13:17,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-01-27 16:13:17,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41
[2024-01-27 16:13:17,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-27 16:13:17,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-27 16:13:17,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41
[2024-01-27 16:13:17,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-27 16:13:17,586 INFO L124 PetriNetUnfolderBase]: 1065/1935 cut-off events.
[2024-01-27 16:13:17,586 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES.
[2024-01-27 16:13:17,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3719 conditions, 1935 events. 1065/1935 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12387 event pairs, 147 based on Foata normal form. 80/1880 useless extension candidates. Maximal degree in co-relation 3709. Up to 865 conditions per place.
[2024-01-27 16:13:17,597 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 38 selfloop transitions, 5 changer transitions 1/58 dead transitions.
[2024-01-27 16:13:17,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 222 flow
[2024-01-27 16:13:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-01-27 16:13:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-01-27 16:13:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions.
[2024-01-27 16:13:17,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6951219512195121
[2024-01-27 16:13:17,601 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 4 states and 114 transitions.
[2024-01-27 16:13:17,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 222 flow
[2024-01-27 16:13:17,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-01-27 16:13:17,603 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 110 flow
[2024-01-27 16:13:17,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=47, PETRI_TRANSITIONS=38}
[2024-01-27 16:13:17,604 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places.
[2024-01-27 16:13:17,604 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 110 flow
[2024-01-27 16:13:17,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-27 16:13:17,605 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-27 16:13:17,605 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-27 16:13:17,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-01-27 16:13:17,605 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-01-27 16:13:17,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-27 16:13:17,606 INFO L85 PathProgramCache]: Analyzing trace with hash 947593247, now seen corresponding path program 1 times
[2024-01-27 16:13:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-27 16:13:17,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783445224]
[2024-01-27 16:13:17,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-27 16:13:17,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-27 16:13:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-27 16:13:17,729 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-27 16:13:17,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-27 16:13:17,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783445224]
[2024-01-27 16:13:17,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783445224] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-27 16:13:17,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-27 16:13:17,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-01-27 16:13:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360755935]
[2024-01-27 16:13:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-27 16:13:17,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-01-27 16:13:17,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-27 16:13:17,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-01-27 16:13:17,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-01-27 16:13:17,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41
[2024-01-27 16:13:17,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-27 16:13:17,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-27 16:13:17,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41
[2024-01-27 16:13:17,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-27 16:13:17,939 INFO L124 PetriNetUnfolderBase]: 741/1343 cut-off events.
[2024-01-27 16:13:17,939 INFO L125 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES.
[2024-01-27 16:13:17,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3033 conditions, 1343 events. 741/1343 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7585 event pairs, 73 based on Foata normal form. 68/1331 useless extension candidates. Maximal degree in co-relation 3021. Up to 417 conditions per place.
[2024-01-27 16:13:17,945 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 48 selfloop transitions, 8 changer transitions 1/71 dead transitions.
[2024-01-27 16:13:17,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 311 flow
[2024-01-27 16:13:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-01-27 16:13:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-01-27 16:13:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions.
[2024-01-27 16:13:17,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7024390243902439
[2024-01-27 16:13:17,949 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 110 flow. Second operand 5 states and 144 transitions.
[2024-01-27 16:13:17,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 311 flow
[2024-01-27 16:13:17,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 301 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-01-27 16:13:17,953 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 150 flow
[2024-01-27 16:13:17,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=51, PETRI_TRANSITIONS=41}
[2024-01-27 16:13:17,954 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places.
[2024-01-27 16:13:17,954 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 150 flow
[2024-01-27 16:13:17,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-27 16:13:17,955 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-27 16:13:17,955 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]
[2024-01-27 16:13:17,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-01-27 16:13:17,955 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-01-27 16:13:17,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-27 16:13:17,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1237998755, now seen corresponding path program 1 times
[2024-01-27 16:13:17,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-27 16:13:17,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817399820]
[2024-01-27 16:13:17,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-27 16:13:17,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-27 16:13:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-27 16:13:18,147 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-27 16:13:18,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-27 16:13:18,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817399820]
[2024-01-27 16:13:18,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817399820] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-27 16:13:18,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-27 16:13:18,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-01-27 16:13:18,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313661560]
[2024-01-27 16:13:18,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-27 16:13:18,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-01-27 16:13:18,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-27 16:13:18,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-01-27 16:13:18,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-01-27 16:13:18,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41
[2024-01-27 16:13:18,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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-27 16:13:18,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-27 16:13:18,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41
[2024-01-27 16:13:18,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-27 16:13:18,308 INFO L124 PetriNetUnfolderBase]: 465/811 cut-off events.
[2024-01-27 16:13:18,309 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES.
[2024-01-27 16:13:18,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 811 events. 465/811 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3683 event pairs, 59 based on Foata normal form. 36/805 useless extension candidates. Maximal degree in co-relation 2089. Up to 268 conditions per place.
[2024-01-27 16:13:18,313 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 42 selfloop transitions, 11 changer transitions 1/68 dead transitions.
[2024-01-27 16:13:18,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 322 flow
[2024-01-27 16:13:18,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-01-27 16:13:18,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-01-27 16:13:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions.
[2024-01-27 16:13:18,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6422764227642277
[2024-01-27 16:13:18,314 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 150 flow. Second operand 6 states and 158 transitions.
[2024-01-27 16:13:18,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 322 flow
[2024-01-27 16:13:18,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 297 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-01-27 16:13:18,318 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 164 flow
[2024-01-27 16:13:18,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=54, PETRI_TRANSITIONS=41}
[2024-01-27 16:13:18,319 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places.
[2024-01-27 16:13:18,319 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 164 flow
[2024-01-27 16:13:18,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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-27 16:13:18,319 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-27 16:13:18,319 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, 1]
[2024-01-27 16:13:18,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-01-27 16:13:18,320 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-01-27 16:13:18,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-27 16:13:18,320 INFO L85 PathProgramCache]: Analyzing trace with hash 453038397, now seen corresponding path program 1 times
[2024-01-27 16:13:18,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-27 16:13:18,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111652476]
[2024-01-27 16:13:18,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-27 16:13:18,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-27 16:13:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-27 16:13:18,487 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-27 16:13:18,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-27 16:13:18,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111652476]
[2024-01-27 16:13:18,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111652476] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-27 16:13:18,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-27 16:13:18,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-01-27 16:13:18,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130194045]
[2024-01-27 16:13:18,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-27 16:13:18,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-01-27 16:13:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-27 16:13:18,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-01-27 16:13:18,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-01-27 16:13:18,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41
[2024-01-27 16:13:18,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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-27 16:13:18,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-27 16:13:18,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41
[2024-01-27 16:13:18,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-27 16:13:18,692 INFO L124 PetriNetUnfolderBase]: 614/1163 cut-off events.
[2024-01-27 16:13:18,692 INFO L125 PetriNetUnfolderBase]: For 575/599 co-relation queries the response was YES.
[2024-01-27 16:13:18,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2700 conditions, 1163 events. 614/1163 cut-off events. For 575/599 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6222 event pairs, 130 based on Foata normal form. 8/1115 useless extension candidates. Maximal degree in co-relation 2685. Up to 500 conditions per place.
[2024-01-27 16:13:18,697 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 26 selfloop transitions, 1 changer transitions 23/70 dead transitions.
[2024-01-27 16:13:18,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 334 flow
[2024-01-27 16:13:18,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-01-27 16:13:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-01-27 16:13:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions.
[2024-01-27 16:13:18,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6219512195121951
[2024-01-27 16:13:18,698 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 164 flow. Second operand 6 states and 153 transitions.
[2024-01-27 16:13:18,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 334 flow
[2024-01-27 16:13:18,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 270 flow, removed 14 selfloop flow, removed 8 redundant places.
[2024-01-27 16:13:18,702 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 119 flow
[2024-01-27 16:13:18,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=119, PETRI_PLACES=55, PETRI_TRANSITIONS=41}
[2024-01-27 16:13:18,703 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places.
[2024-01-27 16:13:18,703 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 119 flow
[2024-01-27 16:13:18,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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-27 16:13:18,703 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-27 16:13:18,704 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, 1]
[2024-01-27 16:13:18,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-01-27 16:13:18,704 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-01-27 16:13:18,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-27 16:13:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1021958063, now seen corresponding path program 2 times
[2024-01-27 16:13:18,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-27 16:13:18,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028541212]
[2024-01-27 16:13:18,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-27 16:13:18,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-27 16:13:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-27 16:13:19,229 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-27 16:13:19,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-27 16:13:19,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028541212]
[2024-01-27 16:13:19,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028541212] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-27 16:13:19,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-27 16:13:19,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-01-27 16:13:19,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615833461]
[2024-01-27 16:13:19,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-27 16:13:19,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-01-27 16:13:19,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-27 16:13:19,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-01-27 16:13:19,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2024-01-27 16:13:19,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41
[2024-01-27 16:13:19,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 119 flow. Second operand has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 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-27 16:13:19,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-01-27 16:13:19,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41
[2024-01-27 16:13:19,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-01-27 16:13:19,570 INFO L124 PetriNetUnfolderBase]: 575/1120 cut-off events.
[2024-01-27 16:13:19,571 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES.
[2024-01-27 16:13:19,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2277 conditions, 1120 events. 575/1120 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6042 event pairs, 74 based on Foata normal form. 8/1085 useless extension candidates. Maximal degree in co-relation 2263. Up to 252 conditions per place.
[2024-01-27 16:13:19,575 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 37 selfloop transitions, 8 changer transitions 33/97 dead transitions.
[2024-01-27 16:13:19,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 97 transitions, 407 flow
[2024-01-27 16:13:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-01-27 16:13:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-01-27 16:13:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 255 transitions.
[2024-01-27 16:13:19,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.565410199556541
[2024-01-27 16:13:19,577 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 119 flow. Second operand 11 states and 255 transitions.
[2024-01-27 16:13:19,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 97 transitions, 407 flow
[2024-01-27 16:13:19,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 97 transitions, 396 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-01-27 16:13:19,579 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 160 flow
[2024-01-27 16:13:19,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=160, PETRI_PLACES=64, PETRI_TRANSITIONS=45}
[2024-01-27 16:13:19,579 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places.
[2024-01-27 16:13:19,580 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 160 flow
[2024-01-27 16:13:19,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 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-27 16:13:19,580 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-01-27 16:13:19,580 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, 1]
[2024-01-27 16:13:19,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-01-27 16:13:19,581 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-01-27 16:13:19,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-01-27 16:13:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1999363445, now seen corresponding path program 3 times
[2024-01-27 16:13:19,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-27 16:13:19,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711169731]
[2024-01-27 16:13:19,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-27 16:13:19,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-27 16:13:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-01-27 16:13:19,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-01-27 16:13:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-01-27 16:13:19,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-01-27 16:13:19,656 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2024-01-27 16:13:19,657 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2024-01-27 16:13:19,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2024-01-27 16:13:19,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining)
[2024-01-27 16:13:19,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2024-01-27 16:13:19,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2024-01-27 16:13:19,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2024-01-27 16:13:19,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-01-27 16:13:19,659 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1]
[2024-01-27 16:13:19,664 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-01-27 16:13:19,664 INFO L179 ceAbstractionStarter]: Computing trace abstraction results
[2024-01-27 16:13:19,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:13:19 BasicIcfg
[2024-01-27 16:13:19,724 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-01-27 16:13:19,725 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-01-27 16:13:19,725 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-01-27 16:13:19,725 INFO L274 PluginConnector]: Witness Printer initialized
[2024-01-27 16:13:19,725 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:13:16" (3/4) ...
[2024-01-27 16:13:19,726 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2024-01-27 16:13:19,811 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-01-27 16:13:19,823 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-01-27 16:13:19,824 INFO L158 Benchmark]: Toolchain (without parser) took 5372.64ms. Allocated memory was 151.0MB in the beginning and 289.4MB in the end (delta: 138.4MB). Free memory was 76.4MB in the beginning and 161.0MB in the end (delta: -84.6MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB.
[2024-01-27 16:13:19,824 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-01-27 16:13:19,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.39ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 76.2MB in the beginning and 144.9MB in the end (delta: -68.7MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB.
[2024-01-27 16:13:19,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.87ms. Allocated memory is still 186.6MB. Free memory was 144.9MB in the beginning and 141.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-01-27 16:13:19,825 INFO L158 Benchmark]: Boogie Preprocessor took 72.31ms. Allocated memory is still 186.6MB. Free memory was 141.8MB in the beginning and 138.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-01-27 16:13:19,825 INFO L158 Benchmark]: RCFGBuilder took 950.96ms. Allocated memory is still 186.6MB. Free memory was 138.6MB in the beginning and 90.4MB in the end (delta: 48.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
[2024-01-27 16:13:19,825 INFO L158 Benchmark]: TraceAbstraction took 3667.66ms. Allocated memory was 186.6MB in the beginning and 289.4MB in the end (delta: 102.8MB). Free memory was 89.3MB in the beginning and 174.6MB in the end (delta: -85.3MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB.
[2024-01-27 16:13:19,825 INFO L158 Benchmark]: Witness Printer took 98.33ms. Allocated memory is still 289.4MB. Free memory was 174.6MB in the beginning and 161.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-01-27 16:13:19,826 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 495.39ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 76.2MB in the beginning and 144.9MB in the end (delta: -68.7MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 68.87ms. Allocated memory is still 186.6MB. Free memory was 144.9MB in the beginning and 141.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 72.31ms. Allocated memory is still 186.6MB. Free memory was 141.8MB in the beginning and 138.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 950.96ms. Allocated memory is still 186.6MB. Free memory was 138.6MB in the beginning and 90.4MB in the end (delta: 48.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 3667.66ms. Allocated memory was 186.6MB in the beginning and 289.4MB in the end (delta: 102.8MB). Free memory was 89.3MB in the beginning and 174.6MB in the end (delta: -85.3MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB.
* Witness Printer took 98.33ms. Allocated memory is still 289.4MB. Free memory was 174.6MB in the beginning and 161.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 19]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L714] 0 int __unbuffered_p1_EAX = 0;
[L716] 0 int __unbuffered_p2_EAX = 0;
[L718] 0 int __unbuffered_p2_EBX = 0;
[L720] 0 int a = 0;
[L721] 0 _Bool main$tmp_guard0;
[L722] 0 _Bool main$tmp_guard1;
[L724] 0 int x = 0;
[L725] 0 _Bool x$flush_delayed;
[L726] 0 int x$mem_tmp;
[L727] 0 _Bool x$r_buff0_thd0;
[L728] 0 _Bool x$r_buff0_thd1;
[L729] 0 _Bool x$r_buff0_thd2;
[L730] 0 _Bool x$r_buff0_thd3;
[L731] 0 _Bool x$r_buff1_thd0;
[L732] 0 _Bool x$r_buff1_thd1;
[L733] 0 _Bool x$r_buff1_thd2;
[L734] 0 _Bool x$r_buff1_thd3;
[L735] 0 _Bool x$read_delayed;
[L736] 0 int *x$read_delayed_var;
[L737] 0 int x$w_buff0;
[L738] 0 _Bool x$w_buff0_used;
[L739] 0 int x$w_buff1;
[L740] 0 _Bool x$w_buff1_used;
[L742] 0 int y = 0;
[L744] 0 int z = 0;
[L745] 0 _Bool weak$$choice0;
[L746] 0 _Bool weak$$choice2;
[L841] 0 pthread_t t916;
[L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t916={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]
[L843] 0 pthread_t t917;
[L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t916={5:0}, t917={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]
[L845] 0 pthread_t t918;
[L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={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]
[L778] 2 x$w_buff1 = x$w_buff0
[L779] 2 x$w_buff0 = 1
[L780] 2 x$w_buff1_used = x$w_buff0_used
[L781] 2 x$w_buff0_used = (_Bool)1
[L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19] COND FALSE 2 !(!expression)
[L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L787] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L790] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L807] 3 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L810] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L813] 3 __unbuffered_p2_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L816] 3 __unbuffered_p2_EBX = a
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L750] 1 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L753] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L754] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L755] 1 x$flush_delayed = weak$$choice2
[L756] 1 x$mem_tmp = x
[L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L764] 1 __unbuffered_p0_EAX = x
[L765] 1 x = x$flush_delayed ? x$mem_tmp : x
[L766] 1 x$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L819] 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)
[L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L821] 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
[L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L823] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L793] 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)
[L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L795] 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
[L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L797] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L850] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L850] RET 0 assume_abort_if_not(main$tmp_guard0)
[L852] 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)
[L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L854] 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
[L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L856] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L861] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L19] 0 reach_error()
VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 842]: 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: 844]: 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: 846]: 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, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 272 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 717 IncrementalHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 20 mSDtfsCounter, 717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=4, InterpolantAutomatonStates: 35, 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, 1.4s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 765 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-27 16:13:19,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE