./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 9bd2c7ff
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu --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 67d0d28278c33bd8f728db1165a077a9d9ba1963e0d97b66e361587c8715de93
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:49:47,115 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:49:47,203 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-19 07:49:47,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:49:47,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:49:47,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:49:47,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:49:47,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:49:47,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:49:47,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:49:47,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:49:47,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:49:47,268 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:49:47,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:49:47,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-19 07:49:47,269 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:49:47,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:49:47,270 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:49:47,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:49:47,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-19 07:49:47,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:49:47,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-19 07:49:47,278 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:49:47,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 07:49:47,278 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:49:47,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:49:47,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:49:47,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:49:47,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:49:47,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:49:47,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:49:47,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-19 07:49:47,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 07:49:47,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:49:47,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:49:47,284 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-19 07:49:47,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:49:47,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:49:47,285 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:49:47,285 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu
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 -> 67d0d28278c33bd8f728db1165a077a9d9ba1963e0d97b66e361587c8715de93
[2023-11-19 07:49:47,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:49:47,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:49:47,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:49:47,599 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:49:47,600 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:49:47,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-19 07:49:50,825 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:49:51,156 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:49:51,157 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-19 07:49:51,183 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/data/f1d72047a/62f3a5c709bc44e8aaf06befa49682e4/FLAG078d87782
[2023-11-19 07:49:51,200 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/data/f1d72047a/62f3a5c709bc44e8aaf06befa49682e4
[2023-11-19 07:49:51,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:49:51,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:49:51,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:49:51,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:49:51,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:49:51,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:51,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc3453a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51, skipping insertion in model container
[2023-11-19 07:49:51,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:51,272 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:49:51,456 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982]
[2023-11-19 07:49:51,772 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:49:51,783 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:49:51,796 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982]
[2023-11-19 07:49:51,845 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:49:51,900 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:49:51,900 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:49:51,908 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:49:51,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51 WrapperNode
[2023-11-19 07:49:51,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:49:51,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:49:51,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:49:51,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:49:51,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:51,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:51,998 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113
[2023-11-19 07:49:52,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:49:52,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:49:52,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:49:52,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:49:52,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:52,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:52,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:52,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:52,043 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:52,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:52,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:52,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:52,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:49:52,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:49:52,064 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:49:52,064 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:49:52,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:52,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:49:52,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:49:52,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-19 07:49:52,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-19 07:49:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-11-19 07:49:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-19 07:49:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:49:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 07:49:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 07:49:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-11-19 07:49:52,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-11-19 07:49:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-11-19 07:49:52,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-11-19 07:49:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:49:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-19 07:49:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:49:52,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:49:52,164 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-19 07:49:52,377 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:49:52,378 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:49:52,692 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:49:52,917 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:49:52,917 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-19 07:49:52,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:49:52 BoogieIcfgContainer
[2023-11-19 07:49:52,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:49:52,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:49:52,928 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:49:52,932 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:49:52,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:49:51" (1/3) ...
[2023-11-19 07:49:52,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198725ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:49:52, skipping insertion in model container
[2023-11-19 07:49:52,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51" (2/3) ...
[2023-11-19 07:49:52,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198725ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:49:52, skipping insertion in model container
[2023-11-19 07:49:52,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:49:52" (3/3) ...
[2023-11-19 07:49:52,939 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-19 07:49:52,949 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-19 07:49:52,962 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:49:52,963 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2023-11-19 07:49:52,963 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-19 07:49:53,014 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 07:49:53,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 95 transitions, 198 flow
[2023-11-19 07:49:53,107 INFO L124 PetriNetUnfolderBase]: 3/93 cut-off events.
[2023-11-19 07:49:53,108 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:49:53,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 3/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place.
[2023-11-19 07:49:53,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 95 transitions, 198 flow
[2023-11-19 07:49:53,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 93 transitions, 192 flow
[2023-11-19 07:49:53,124 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 07:49:53,136 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 93 transitions, 192 flow
[2023-11-19 07:49:53,139 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 93 transitions, 192 flow
[2023-11-19 07:49:53,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 93 transitions, 192 flow
[2023-11-19 07:49:53,178 INFO L124 PetriNetUnfolderBase]: 3/93 cut-off events.
[2023-11-19 07:49:53,179 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:49:53,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 3/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place.
[2023-11-19 07:49:53,184 INFO L119 LiptonReduction]: Number of co-enabled transitions 1404
[2023-11-19 07:49:57,049 INFO L134 LiptonReduction]: Checked pairs total: 3307
[2023-11-19 07:49:57,049 INFO L136 LiptonReduction]: Total number of compositions: 84
[2023-11-19 07:49:57,065 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:49:57,073 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;@c6678cf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:49:57,073 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2023-11-19 07:49:57,076 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 07:49:57,076 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events.
[2023-11-19 07:49:57,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:49:57,077 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:49:57,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-11-19 07:49:57,078 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-19 07:49:57,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:49:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash 424273, now seen corresponding path program 1 times
[2023-11-19 07:49:57,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:49:57,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972650746]
[2023-11-19 07:49:57,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:57,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:49:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:49:57,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:49:57,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972650746]
[2023-11-19 07:49:57,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972650746] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:49:57,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:49:57,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:49:57,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138187241]
[2023-11-19 07:49:57,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:49:57,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:49:57,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:49:57,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:49:57,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:49:57,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 179
[2023-11-19 07:49:57,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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)
[2023-11-19 07:49:57,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:49:57,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 179
[2023-11-19 07:49:57,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:49:57,737 INFO L124 PetriNetUnfolderBase]: 249/470 cut-off events.
[2023-11-19 07:49:57,737 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2023-11-19 07:49:57,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 470 events. 249/470 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2145 event pairs, 30 based on Foata normal form. 24/446 useless extension candidates. Maximal degree in co-relation 900. Up to 352 conditions per place.
[2023-11-19 07:49:57,743 INFO L140 encePairwiseOnDemand]: 175/179 looper letters, 25 selfloop transitions, 2 changer transitions 4/32 dead transitions.
[2023-11-19 07:49:57,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 135 flow
[2023-11-19 07:49:57,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:49:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:49:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions.
[2023-11-19 07:49:57,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521415270018622
[2023-11-19 07:49:57,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions.
[2023-11-19 07:49:57,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions.
[2023-11-19 07:49:57,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:49:57,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions.
[2023-11-19 07:49:57,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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)
[2023-11-19 07:49:57,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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)
[2023-11-19 07:49:57,777 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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)
[2023-11-19 07:49:57,779 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 280 transitions.
[2023-11-19 07:49:57,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 135 flow
[2023-11-19 07:49:57,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:49:57,785 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow
[2023-11-19 07:49:57,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17}
[2023-11-19 07:49:57,791 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places.
[2023-11-19 07:49:57,792 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow
[2023-11-19 07:49:57,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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)
[2023-11-19 07:49:57,792 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:49:57,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:49:57,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:49:57,793 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-19 07:49:57,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:49:57,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2028269054, now seen corresponding path program 1 times
[2023-11-19 07:49:57,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:49:57,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469295388]
[2023-11-19 07:49:57,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:57,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:49:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:49:58,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:49:58,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469295388]
[2023-11-19 07:49:58,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469295388] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:49:58,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:49:58,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:49:58,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122455344]
[2023-11-19 07:49:58,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:49:58,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:49:58,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:49:58,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:49:58,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:49:58,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179
[2023-11-19 07:49:58,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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)
[2023-11-19 07:49:58,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:49:58,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179
[2023-11-19 07:49:58,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:49:58,500 INFO L124 PetriNetUnfolderBase]: 332/603 cut-off events.
[2023-11-19 07:49:58,501 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES.
[2023-11-19 07:49:58,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 603 events. 332/603 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2717 event pairs, 86 based on Foata normal form. 45/648 useless extension candidates. Maximal degree in co-relation 1248. Up to 321 conditions per place.
[2023-11-19 07:49:58,506 INFO L140 encePairwiseOnDemand]: 172/179 looper letters, 23 selfloop transitions, 5 changer transitions 18/46 dead transitions.
[2023-11-19 07:49:58,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 46 transitions, 198 flow
[2023-11-19 07:49:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:49:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:49:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions.
[2023-11-19 07:49:58,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47262569832402235
[2023-11-19 07:49:58,512 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 423 transitions.
[2023-11-19 07:49:58,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 423 transitions.
[2023-11-19 07:49:58,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:49:58,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 423 transitions.
[2023-11-19 07:49:58,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 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)
[2023-11-19 07:49:58,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 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)
[2023-11-19 07:49:58,520 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 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)
[2023-11-19 07:49:58,520 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 423 transitions.
[2023-11-19 07:49:58,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 46 transitions, 198 flow
[2023-11-19 07:49:58,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:49:58,523 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 82 flow
[2023-11-19 07:49:58,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=20}
[2023-11-19 07:49:58,524 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places.
[2023-11-19 07:49:58,524 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 82 flow
[2023-11-19 07:49:58,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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)
[2023-11-19 07:49:58,525 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:49:58,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:49:58,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:49:58,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-19 07:49:58,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:49:58,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1548194685, now seen corresponding path program 1 times
[2023-11-19 07:49:58,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:49:58,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594078692]
[2023-11-19 07:49:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:58,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:49:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:49:58,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:49:58,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594078692]
[2023-11-19 07:49:58,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594078692] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:49:58,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:49:58,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:49:58,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118317536]
[2023-11-19 07:49:58,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:49:58,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:49:58,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:49:58,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:49:58,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:49:58,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179
[2023-11-19 07:49:58,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 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)
[2023-11-19 07:49:58,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:49:58,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179
[2023-11-19 07:49:58,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:49:59,016 INFO L124 PetriNetUnfolderBase]: 288/538 cut-off events.
[2023-11-19 07:49:59,017 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES.
[2023-11-19 07:49:59,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 538 events. 288/538 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2343 event pairs, 71 based on Foata normal form. 40/578 useless extension candidates. Maximal degree in co-relation 1427. Up to 255 conditions per place.
[2023-11-19 07:49:59,023 INFO L140 encePairwiseOnDemand]: 173/179 looper letters, 28 selfloop transitions, 5 changer transitions 19/52 dead transitions.
[2023-11-19 07:49:59,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 52 transitions, 284 flow
[2023-11-19 07:49:59,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:49:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 07:49:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 577 transitions.
[2023-11-19 07:49:59,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4604948124501197
[2023-11-19 07:49:59,027 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 577 transitions.
[2023-11-19 07:49:59,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 577 transitions.
[2023-11-19 07:49:59,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:49:59,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 577 transitions.
[2023-11-19 07:49:59,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 82.42857142857143) internal successors, (577), 7 states have internal predecessors, (577), 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)
[2023-11-19 07:49:59,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 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)
[2023-11-19 07:49:59,036 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 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)
[2023-11-19 07:49:59,036 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 82 flow. Second operand 7 states and 577 transitions.
[2023-11-19 07:49:59,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 52 transitions, 284 flow
[2023-11-19 07:49:59,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 52 transitions, 256 flow, removed 4 selfloop flow, removed 2 redundant places.
[2023-11-19 07:49:59,044 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 102 flow
[2023-11-19 07:49:59,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=102, PETRI_PLACES=37, PETRI_TRANSITIONS=21}
[2023-11-19 07:49:59,046 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places.
[2023-11-19 07:49:59,050 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 102 flow
[2023-11-19 07:49:59,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 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)
[2023-11-19 07:49:59,051 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:49:59,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:49:59,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 07:49:59,052 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-19 07:49:59,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:49:59,053 INFO L85 PathProgramCache]: Analyzing trace with hash -798557789, now seen corresponding path program 1 times
[2023-11-19 07:49:59,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:49:59,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591558095]
[2023-11-19 07:49:59,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:59,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:49:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:49:59,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:49:59,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591558095]
[2023-11-19 07:49:59,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591558095] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:49:59,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:49:59,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:49:59,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203085330]
[2023-11-19 07:49:59,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:49:59,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:49:59,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:49:59,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:49:59,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:49:59,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 179
[2023-11-19 07:49:59,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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)
[2023-11-19 07:49:59,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:49:59,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 179
[2023-11-19 07:49:59,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:49:59,380 INFO L124 PetriNetUnfolderBase]: 120/266 cut-off events.
[2023-11-19 07:49:59,380 INFO L125 PetriNetUnfolderBase]: For 238/239 co-relation queries the response was YES.
[2023-11-19 07:49:59,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 266 events. 120/266 cut-off events. For 238/239 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1108 event pairs, 46 based on Foata normal form. 40/301 useless extension candidates. Maximal degree in co-relation 721. Up to 105 conditions per place.
[2023-11-19 07:49:59,383 INFO L140 encePairwiseOnDemand]: 174/179 looper letters, 36 selfloop transitions, 4 changer transitions 1/44 dead transitions.
[2023-11-19 07:49:59,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 278 flow
[2023-11-19 07:49:59,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:49:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:49:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 349 transitions.
[2023-11-19 07:49:59,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48743016759776536
[2023-11-19 07:49:59,385 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 349 transitions.
[2023-11-19 07:49:59,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 349 transitions.
[2023-11-19 07:49:59,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:49:59,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 349 transitions.
[2023-11-19 07:49:59,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 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)
[2023-11-19 07:49:59,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 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)
[2023-11-19 07:49:59,390 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 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)
[2023-11-19 07:49:59,390 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 102 flow. Second operand 4 states and 349 transitions.
[2023-11-19 07:49:59,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 278 flow
[2023-11-19 07:49:59,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 44 transitions, 263 flow, removed 4 selfloop flow, removed 4 redundant places.
[2023-11-19 07:49:59,394 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 117 flow
[2023-11-19 07:49:59,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=35, PETRI_TRANSITIONS=23}
[2023-11-19 07:49:59,396 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places.
[2023-11-19 07:49:59,396 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 117 flow
[2023-11-19 07:49:59,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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)
[2023-11-19 07:49:59,397 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:49:59,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:49:59,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-19 07:49:59,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-19 07:49:59,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:49:59,398 INFO L85 PathProgramCache]: Analyzing trace with hash 875392279, now seen corresponding path program 1 times
[2023-11-19 07:49:59,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:49:59,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334435000]
[2023-11-19 07:49:59,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:59,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:49:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:49:59,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:49:59,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334435000]
[2023-11-19 07:49:59,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334435000] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:49:59,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:49:59,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:49:59,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935646650]
[2023-11-19 07:49:59,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:49:59,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:49:59,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:49:59,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:49:59,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:49:59,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 179
[2023-11-19 07:49:59,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 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)
[2023-11-19 07:49:59,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:49:59,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 179
[2023-11-19 07:49:59,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:49:59,773 INFO L124 PetriNetUnfolderBase]: 43/117 cut-off events.
[2023-11-19 07:49:59,773 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES.
[2023-11-19 07:49:59,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 117 events. 43/117 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 381 event pairs, 13 based on Foata normal form. 16/131 useless extension candidates. Maximal degree in co-relation 379. Up to 52 conditions per place.
[2023-11-19 07:49:59,775 INFO L140 encePairwiseOnDemand]: 174/179 looper letters, 23 selfloop transitions, 6 changer transitions 2/34 dead transitions.
[2023-11-19 07:49:59,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 227 flow
[2023-11-19 07:49:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:49:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:49:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 419 transitions.
[2023-11-19 07:49:59,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681564245810056
[2023-11-19 07:49:59,777 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 419 transitions.
[2023-11-19 07:49:59,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 419 transitions.
[2023-11-19 07:49:59,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:49:59,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 419 transitions.
[2023-11-19 07:49:59,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 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)
[2023-11-19 07:49:59,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 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)
[2023-11-19 07:49:59,783 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 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)
[2023-11-19 07:49:59,783 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 117 flow. Second operand 5 states and 419 transitions.
[2023-11-19 07:49:59,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 227 flow
[2023-11-19 07:49:59,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 34 transitions, 203 flow, removed 6 selfloop flow, removed 5 redundant places.
[2023-11-19 07:49:59,786 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 122 flow
[2023-11-19 07:49:59,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=36, PETRI_TRANSITIONS=23}
[2023-11-19 07:49:59,790 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places.
[2023-11-19 07:49:59,790 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 122 flow
[2023-11-19 07:49:59,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 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)
[2023-11-19 07:49:59,791 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:49:59,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:49:59,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 07:49:59,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-19 07:49:59,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:49:59,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1154419646, now seen corresponding path program 1 times
[2023-11-19 07:49:59,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:49:59,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932034385]
[2023-11-19 07:49:59,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:59,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:49:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:50:00,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:50:00,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932034385]
[2023-11-19 07:50:00,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932034385] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:50:00,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:50:00,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:50:00,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758493311]
[2023-11-19 07:50:00,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:50:00,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:50:00,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:50:00,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:50:00,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:50:00,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 179
[2023-11-19 07:50:00,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 122 flow. Second operand has 7 states, 7 states have (on average 78.28571428571429) internal successors, (548), 7 states have internal predecessors, (548), 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)
[2023-11-19 07:50:00,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:50:00,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 179
[2023-11-19 07:50:00,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:50:00,792 INFO L124 PetriNetUnfolderBase]: 32/101 cut-off events.
[2023-11-19 07:50:00,792 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES.
[2023-11-19 07:50:00,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 101 events. 32/101 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 309 event pairs, 6 based on Foata normal form. 1/102 useless extension candidates. Maximal degree in co-relation 335. Up to 40 conditions per place.
[2023-11-19 07:50:00,793 INFO L140 encePairwiseOnDemand]: 172/179 looper letters, 20 selfloop transitions, 4 changer transitions 20/47 dead transitions.
[2023-11-19 07:50:00,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 335 flow
[2023-11-19 07:50:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-11-19 07:50:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-19 07:50:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 645 transitions.
[2023-11-19 07:50:00,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504189944134078
[2023-11-19 07:50:00,797 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 645 transitions.
[2023-11-19 07:50:00,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 645 transitions.
[2023-11-19 07:50:00,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:50:00,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 645 transitions.
[2023-11-19 07:50:00,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 80.625) internal successors, (645), 8 states have internal predecessors, (645), 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)
[2023-11-19 07:50:00,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 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)
[2023-11-19 07:50:00,804 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 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)
[2023-11-19 07:50:00,804 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 122 flow. Second operand 8 states and 645 transitions.
[2023-11-19 07:50:00,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 335 flow
[2023-11-19 07:50:00,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 269 flow, removed 10 selfloop flow, removed 7 redundant places.
[2023-11-19 07:50:00,807 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 111 flow
[2023-11-19 07:50:00,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=111, PETRI_PLACES=40, PETRI_TRANSITIONS=23}
[2023-11-19 07:50:00,808 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 13 predicate places.
[2023-11-19 07:50:00,809 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 111 flow
[2023-11-19 07:50:00,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.28571428571429) internal successors, (548), 7 states have internal predecessors, (548), 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)
[2023-11-19 07:50:00,809 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:50:00,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:50:00,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 07:50:00,810 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-19 07:50:00,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:50:00,810 INFO L85 PathProgramCache]: Analyzing trace with hash -944866578, now seen corresponding path program 2 times
[2023-11-19 07:50:00,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:50:00,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060990165]
[2023-11-19 07:50:00,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:50:00,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:50:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:50:00,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 07:50:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:50:00,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 07:50:00,985 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 07:50:00,986 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2023-11-19 07:50:00,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2023-11-19 07:50:00,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2023-11-19 07:50:00,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2023-11-19 07:50:00,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2023-11-19 07:50:00,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-19 07:50:00,990 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1]
[2023-11-19 07:50:00,996 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-19 07:50:00,997 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 07:50:01,054 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-19 07:50:01,056 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 07:50:01,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:50:01 BasicIcfg
[2023-11-19 07:50:01,085 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 07:50:01,086 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 07:50:01,086 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 07:50:01,086 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 07:50:01,087 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:49:52" (3/4) ...
[2023-11-19 07:50:01,088 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2023-11-19 07:50:01,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-19 07:50:01,123 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 07:50:01,186 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml
[2023-11-19 07:50:01,187 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 07:50:01,188 INFO L158 Benchmark]: Toolchain (without parser) took 9983.77ms. Allocated memory was 121.6MB in the beginning and 199.2MB in the end (delta: 77.6MB). Free memory was 76.5MB in the beginning and 56.3MB in the end (delta: 20.3MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB.
[2023-11-19 07:50:01,188 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 121.6MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:50:01,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 704.29ms. Allocated memory is still 121.6MB. Free memory was 76.5MB in the beginning and 53.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2023-11-19 07:50:01,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.35ms. Allocated memory is still 121.6MB. Free memory was 53.5MB in the beginning and 50.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:50:01,189 INFO L158 Benchmark]: Boogie Preprocessor took 62.30ms. Allocated memory is still 121.6MB. Free memory was 50.9MB in the beginning and 49.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:50:01,190 INFO L158 Benchmark]: RCFGBuilder took 860.26ms. Allocated memory was 121.6MB in the beginning and 165.7MB in the end (delta: 44.0MB). Free memory was 49.3MB in the beginning and 111.7MB in the end (delta: -62.4MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB.
[2023-11-19 07:50:01,190 INFO L158 Benchmark]: TraceAbstraction took 8158.16ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 110.8MB in the beginning and 63.6MB in the end (delta: 47.2MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB.
[2023-11-19 07:50:01,191 INFO L158 Benchmark]: Witness Printer took 101.07ms. Allocated memory is still 199.2MB. Free memory was 63.6MB in the beginning and 56.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2023-11-19 07:50:01,193 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.57ms. Allocated memory is still 121.6MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 704.29ms. Allocated memory is still 121.6MB. Free memory was 76.5MB in the beginning and 53.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 89.35ms. Allocated memory is still 121.6MB. Free memory was 53.5MB in the beginning and 50.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 62.30ms. Allocated memory is still 121.6MB. Free memory was 50.9MB in the beginning and 49.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 860.26ms. Allocated memory was 121.6MB in the beginning and 165.7MB in the end (delta: 44.0MB). Free memory was 49.3MB in the beginning and 111.7MB in the end (delta: -62.4MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 8158.16ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 110.8MB in the beginning and 63.6MB in the end (delta: 47.2MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB.
* Witness Printer took 101.07ms. Allocated memory is still 199.2MB. Free memory was 63.6MB in the beginning and 56.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 3.9s, 97 PlacesBefore, 27 PlacesAfterwards, 93 TransitionsBefore, 21 TransitionsAfterwards, 1404 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 84 TotalNumberOfCompositions, 3307 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1514, independent: 1364, independent conditional: 0, independent unconditional: 1364, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 742, independent: 716, independent conditional: 0, independent unconditional: 716, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1514, independent: 648, independent conditional: 0, independent unconditional: 648, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 742, unknown conditional: 0, unknown unconditional: 742] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L708] 0 int __unbuffered_cnt = 0;
[L710] 0 int __unbuffered_p1_EAX = 0;
[L712] 0 int __unbuffered_p1_EBX = 0;
[L713] 0 _Bool main$tmp_guard0;
[L714] 0 _Bool main$tmp_guard1;
[L716] 0 int x = 0;
[L717] 0 _Bool x$flush_delayed;
[L718] 0 int x$mem_tmp;
[L719] 0 _Bool x$r_buff0_thd0;
[L720] 0 _Bool x$r_buff0_thd1;
[L721] 0 _Bool x$r_buff0_thd2;
[L722] 0 _Bool x$r_buff1_thd0;
[L723] 0 _Bool x$r_buff1_thd1;
[L724] 0 _Bool x$r_buff1_thd2;
[L725] 0 _Bool x$read_delayed;
[L726] 0 int *x$read_delayed_var;
[L727] 0 int x$w_buff0;
[L728] 0 _Bool x$w_buff0_used;
[L729] 0 int x$w_buff1;
[L730] 0 _Bool x$w_buff1_used;
[L732] 0 int y = 0;
[L734] 0 int z = 0;
[L735] 0 _Bool weak$$choice0;
[L736] 0 _Bool weak$$choice2;
[L815] 0 pthread_t t1601;
[L816] FCALL, FORK 0 pthread_create(&t1601, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1601={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L817] 0 pthread_t t1602;
[L818] FCALL, FORK 0 pthread_create(&t1602, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1601={5:0}, t1602={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L740] 1 x$w_buff1 = x$w_buff0
[L741] 1 x$w_buff0 = 1
[L742] 1 x$w_buff1_used = x$w_buff0_used
[L743] 1 x$w_buff0_used = (_Bool)1
[L744] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L744] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L745] 1 x$r_buff1_thd0 = x$r_buff0_thd0
[L746] 1 x$r_buff1_thd1 = x$r_buff0_thd1
[L747] 1 x$r_buff1_thd2 = x$r_buff0_thd2
[L748] 1 x$r_buff0_thd1 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L751] 1 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L768] 2 y = 2
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0]
[L771] 2 z = 1
[L774] 2 __unbuffered_p1_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1]
[L777] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L778] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L779] 2 x$flush_delayed = weak$$choice2
[L780] 2 x$mem_tmp = x
[L781] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L782] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L783] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L784] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L785] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L786] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L787] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L788] 2 __unbuffered_p1_EBX = x
[L789] 2 x = x$flush_delayed ? x$mem_tmp : x
[L790] 2 x$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, 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_p1_EAX=1, __unbuffered_p1_EBX=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1]
[L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L802] 2 return 0;
[L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1]
[L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L763] 1 return 0;
[L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1601={5:0}, t1602={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1]
[L822] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L822] RET 0 assume_abort_if_not(main$tmp_guard0)
[L824] 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)
[L825] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L826] 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
[L827] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L828] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1601={5:0}, t1602={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1]
[L831] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
[L833] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] 0 reach_error()
VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1]
- UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 816]: 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: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 5 procedures, 114 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 223 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 519 IncrementalHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 40 mSDtfsCounter, 519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=5, InterpolantAutomatonStates: 32, 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.9s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 355 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!
[2023-11-19 07:50:01,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62011f5-c172-4870-861f-ff392d308373/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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