./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 11:14:05,502 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 11:14:05,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 11:14:05,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 11:14:05,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 11:14:05,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 11:14:05,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 11:14:05,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 11:14:05,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 11:14:05,648 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 11:14:05,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 11:14:05,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 11:14:05,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 11:14:05,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 11:14:05,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 11:14:05,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 11:14:05,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 11:14:05,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 11:14:05,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 11:14:05,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 11:14:05,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 11:14:05,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 11:14:05,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 11:14:05,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 11:14:05,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 11:14:05,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 11:14:05,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 11:14:05,652 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237
[2024-11-07 11:14:05,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 11:14:05,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 11:14:05,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 11:14:05,933 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 11:14:05,933 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 11:14:05,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-11-07 11:14:07,076 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 11:14:07,341 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 11:14:07,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-11-07 11:14:07,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3b0c5203/ddf98ecbbdc8445ab1addb84f7013054/FLAGc132964ac
[2024-11-07 11:14:07,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3b0c5203/ddf98ecbbdc8445ab1addb84f7013054
[2024-11-07 11:14:07,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 11:14:07,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 11:14:07,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 11:14:07,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 11:14:07,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 11:14:07,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:14:07" (1/1) ...
[2024-11-07 11:14:07,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23903a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07, skipping insertion in model container
[2024-11-07 11:14:07,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:14:07" (1/1) ...
[2024-11-07 11:14:07,677 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 11:14:07,789 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052]
[2024-11-07 11:14:07,897 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 11:14:07,903 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 11:14:07,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052]
[2024-11-07 11:14:07,961 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 11:14:07,989 INFO L204 MainTranslator]: Completed translation
[2024-11-07 11:14:07,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07 WrapperNode
[2024-11-07 11:14:07,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 11:14:07,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 11:14:07,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 11:14:07,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 11:14:07,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07" (1/1) ...
[2024-11-07 11:14:08,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07" (1/1) ...
[2024-11-07 11:14:08,026 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115
[2024-11-07 11:14:08,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 11:14:08,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 11:14:08,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 11:14:08,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 11:14:08,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07" (1/1) ...
[2024-11-07 11:14:08,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07" (1/1) ...
[2024-11-07 11:14:08,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07" (1/1) ...
[2024-11-07 11:14:08,051 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-07 11:14:08,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07" (1/1) ...
[2024-11-07 11:14:08,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07" (1/1) ...
[2024-11-07 11:14:08,063 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07" (1/1) ...
[2024-11-07 11:14:08,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07" (1/1) ...
[2024-11-07 11:14:08,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07" (1/1) ...
[2024-11-07 11:14:08,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07" (1/1) ...
[2024-11-07 11:14:08,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 11:14:08,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 11:14:08,074 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 11:14:08,074 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 11:14:08,075 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07" (1/1) ...
[2024-11-07 11:14:08,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 11:14:08,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 11:14:08,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-07 11:14:08,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-07 11:14:08,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-07 11:14:08,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 11:14:08,122 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-07 11:14:08,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-07 11:14:08,123 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-07 11:14:08,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-07 11:14:08,123 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-07 11:14:08,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-07 11:14:08,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 11:14:08,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-07 11:14:08,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 11:14:08,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 11:14:08,125 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-07 11:14:08,240 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 11:14:08,241 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 11:14:08,441 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-07 11:14:08,442 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 11:14:08,598 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 11:14:08,598 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-07 11:14:08,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:14:08 BoogieIcfgContainer
[2024-11-07 11:14:08,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 11:14:08,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 11:14:08,601 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 11:14:08,604 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 11:14:08,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:14:07" (1/3) ...
[2024-11-07 11:14:08,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b6c478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:14:08, skipping insertion in model container
[2024-11-07 11:14:08,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:07" (2/3) ...
[2024-11-07 11:14:08,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b6c478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:14:08, skipping insertion in model container
[2024-11-07 11:14:08,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:14:08" (3/3) ...
[2024-11-07 11:14:08,607 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-11-07 11:14:08,616 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 11:14:08,616 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-11-07 11:14:08,617 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-07 11:14:08,660 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-07 11:14:08,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow
[2024-11-07 11:14:08,710 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events.
[2024-11-07 11:14:08,712 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:14:08,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place.
[2024-11-07 11:14:08,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow
[2024-11-07 11:14:08,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow
[2024-11-07 11:14:08,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 11:14:08,729 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d67850e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 11:14:08,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-11-07 11:14:08,735 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-07 11:14:08,736 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events.
[2024-11-07 11:14:08,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:14:08,736 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:14:08,736 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 11:14:08,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:14:08,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:14:08,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1756285544, now seen corresponding path program 1 times
[2024-11-07 11:14:08,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:14:08,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651581788]
[2024-11-07 11:14:08,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:14:08,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:14:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:14:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 11:14:09,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:14:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651581788]
[2024-11-07 11:14:09,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651581788] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:14:09,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:14:09,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-07 11:14:09,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353828551]
[2024-11-07 11:14:09,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:14:09,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 11:14:09,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:14:09,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 11:14:09,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 11:14:09,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 40
[2024-11-07 11:14:09,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:09,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:14:09,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 40
[2024-11-07 11:14:09,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:14:09,307 INFO L124 PetriNetUnfolderBase]: 453/885 cut-off events.
[2024-11-07 11:14:09,307 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES.
[2024-11-07 11:14:09,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 885 events. 453/885 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5499 event pairs, 72 based on Foata normal form. 36/896 useless extension candidates. Maximal degree in co-relation 1611. Up to 562 conditions per place.
[2024-11-07 11:14:09,316 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 25 selfloop transitions, 2 changer transitions 2/46 dead transitions.
[2024-11-07 11:14:09,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 162 flow
[2024-11-07 11:14:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 11:14:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-07 11:14:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions.
[2024-11-07 11:14:09,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667
[2024-11-07 11:14:09,326 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 92 transitions.
[2024-11-07 11:14:09,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 162 flow
[2024-11-07 11:14:09,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-07 11:14:09,332 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow
[2024-11-07 11:14:09,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34}
[2024-11-07 11:14:09,337 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places.
[2024-11-07 11:14:09,338 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow
[2024-11-07 11:14:09,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:09,338 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:14:09,338 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:14:09,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 11:14:09,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:14:09,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:14:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1077292502, now seen corresponding path program 1 times
[2024-11-07 11:14:09,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:14:09,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71827123]
[2024-11-07 11:14:09,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:14:09,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:14:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:14:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 11:14:09,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:14:09,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71827123]
[2024-11-07 11:14:09,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71827123] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:14:09,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:14:09,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:14:09,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514944255]
[2024-11-07 11:14:09,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:14:09,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 11:14:09,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:14:09,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 11:14:09,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 11:14:09,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40
[2024-11-07 11:14:09,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:09,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:14:09,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40
[2024-11-07 11:14:09,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:14:09,973 INFO L124 PetriNetUnfolderBase]: 1354/2345 cut-off events.
[2024-11-07 11:14:09,973 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES.
[2024-11-07 11:14:09,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4566 conditions, 2345 events. 1354/2345 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15734 event pairs, 352 based on Foata normal form. 0/2251 useless extension candidates. Maximal degree in co-relation 4556. Up to 1288 conditions per place.
[2024-11-07 11:14:09,983 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 30 selfloop transitions, 3 changer transitions 43/88 dead transitions.
[2024-11-07 11:14:09,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 88 transitions, 354 flow
[2024-11-07 11:14:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 11:14:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-07 11:14:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions.
[2024-11-07 11:14:09,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.61875
[2024-11-07 11:14:09,985 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 8 states and 198 transitions.
[2024-11-07 11:14:09,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 88 transitions, 354 flow
[2024-11-07 11:14:09,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 88 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-07 11:14:09,987 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 107 flow
[2024-11-07 11:14:09,987 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=107, PETRI_PLACES=53, PETRI_TRANSITIONS=35}
[2024-11-07 11:14:09,988 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places.
[2024-11-07 11:14:09,988 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 107 flow
[2024-11-07 11:14:09,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:09,988 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:14:09,988 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:14:09,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 11:14:09,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:14:09,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:14:09,989 INFO L85 PathProgramCache]: Analyzing trace with hash 710736299, now seen corresponding path program 1 times
[2024-11-07 11:14:09,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:14:09,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391792863]
[2024-11-07 11:14:09,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:14:09,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:14:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:14:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 11:14:10,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:14:10,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391792863]
[2024-11-07 11:14:10,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391792863] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:14:10,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:14:10,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 11:14:10,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395688019]
[2024-11-07 11:14:10,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:14:10,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 11:14:10,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:14:10,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 11:14:10,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-07 11:14:10,166 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40
[2024-11-07 11:14:10,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 107 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:10,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:14:10,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40
[2024-11-07 11:14:10,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:14:10,794 INFO L124 PetriNetUnfolderBase]: 2661/4500 cut-off events.
[2024-11-07 11:14:10,794 INFO L125 PetriNetUnfolderBase]: For 2509/2509 co-relation queries the response was YES.
[2024-11-07 11:14:10,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10518 conditions, 4500 events. 2661/4500 cut-off events. For 2509/2509 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 30542 event pairs, 251 based on Foata normal form. 142/4614 useless extension candidates. Maximal degree in co-relation 10503. Up to 1490 conditions per place.
[2024-11-07 11:14:10,813 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 42 selfloop transitions, 7 changer transitions 61/120 dead transitions.
[2024-11-07 11:14:10,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 120 transitions, 605 flow
[2024-11-07 11:14:10,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 11:14:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-07 11:14:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 239 transitions.
[2024-11-07 11:14:10,816 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5975
[2024-11-07 11:14:10,816 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 107 flow. Second operand 10 states and 239 transitions.
[2024-11-07 11:14:10,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 120 transitions, 605 flow
[2024-11-07 11:14:10,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 120 transitions, 574 flow, removed 13 selfloop flow, removed 3 redundant places.
[2024-11-07 11:14:10,839 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 190 flow
[2024-11-07 11:14:10,839 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=190, PETRI_PLACES=62, PETRI_TRANSITIONS=40}
[2024-11-07 11:14:10,839 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places.
[2024-11-07 11:14:10,839 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 190 flow
[2024-11-07 11:14:10,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:10,840 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:14:10,840 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:14:10,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 11:14:10,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:14:10,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:14:10,840 INFO L85 PathProgramCache]: Analyzing trace with hash -810813780, now seen corresponding path program 1 times
[2024-11-07 11:14:10,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:14:10,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782904879]
[2024-11-07 11:14:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:14:10,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:14:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:14:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 11:14:10,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:14:10,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782904879]
[2024-11-07 11:14:10,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782904879] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:14:10,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:14:10,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 11:14:10,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682195231]
[2024-11-07 11:14:10,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:14:10,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 11:14:10,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:14:10,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 11:14:10,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-11-07 11:14:11,007 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40
[2024-11-07 11:14:11,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:11,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:14:11,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40
[2024-11-07 11:14:11,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:14:11,679 INFO L124 PetriNetUnfolderBase]: 3304/5769 cut-off events.
[2024-11-07 11:14:11,679 INFO L125 PetriNetUnfolderBase]: For 11226/11226 co-relation queries the response was YES.
[2024-11-07 11:14:11,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16628 conditions, 5769 events. 3304/5769 cut-off events. For 11226/11226 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 42755 event pairs, 417 based on Foata normal form. 114/5830 useless extension candidates. Maximal degree in co-relation 16605. Up to 1824 conditions per place.
[2024-11-07 11:14:11,700 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 47 selfloop transitions, 8 changer transitions 40/105 dead transitions.
[2024-11-07 11:14:11,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 105 transitions, 688 flow
[2024-11-07 11:14:11,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 11:14:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-07 11:14:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions.
[2024-11-07 11:14:11,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286
[2024-11-07 11:14:11,702 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 190 flow. Second operand 7 states and 176 transitions.
[2024-11-07 11:14:11,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 105 transitions, 688 flow
[2024-11-07 11:14:11,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 665 flow, removed 10 selfloop flow, removed 3 redundant places.
[2024-11-07 11:14:11,714 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 193 flow
[2024-11-07 11:14:11,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=193, PETRI_PLACES=62, PETRI_TRANSITIONS=39}
[2024-11-07 11:14:11,714 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places.
[2024-11-07 11:14:11,715 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 39 transitions, 193 flow
[2024-11-07 11:14:11,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:11,715 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:14:11,715 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:14:11,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 11:14:11,715 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:14:11,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:14:11,716 INFO L85 PathProgramCache]: Analyzing trace with hash -340918197, now seen corresponding path program 1 times
[2024-11-07 11:14:11,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:14:11,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991757888]
[2024-11-07 11:14:11,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:14:11,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:14:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:14:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 11:14:11,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:14:11,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991757888]
[2024-11-07 11:14:11,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991757888] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:14:11,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:14:11,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 11:14:11,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45912611]
[2024-11-07 11:14:11,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:14:11,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 11:14:11,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:14:11,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 11:14:11,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-07 11:14:11,943 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40
[2024-11-07 11:14:11,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 39 transitions, 193 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:11,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:14:11,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40
[2024-11-07 11:14:11,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:14:12,854 INFO L124 PetriNetUnfolderBase]: 3560/6433 cut-off events.
[2024-11-07 11:14:12,855 INFO L125 PetriNetUnfolderBase]: For 10428/10428 co-relation queries the response was YES.
[2024-11-07 11:14:12,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17606 conditions, 6433 events. 3560/6433 cut-off events. For 10428/10428 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 50914 event pairs, 643 based on Foata normal form. 118/6488 useless extension candidates. Maximal degree in co-relation 17581. Up to 1140 conditions per place.
[2024-11-07 11:14:12,883 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 57 selfloop transitions, 8 changer transitions 67/142 dead transitions.
[2024-11-07 11:14:12,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 142 transitions, 919 flow
[2024-11-07 11:14:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-07 11:14:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-11-07 11:14:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 267 transitions.
[2024-11-07 11:14:12,887 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6068181818181818
[2024-11-07 11:14:12,887 INFO L175 Difference]: Start difference. First operand has 62 places, 39 transitions, 193 flow. Second operand 11 states and 267 transitions.
[2024-11-07 11:14:12,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 142 transitions, 919 flow
[2024-11-07 11:14:12,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 142 transitions, 831 flow, removed 22 selfloop flow, removed 6 redundant places.
[2024-11-07 11:14:12,902 INFO L231 Difference]: Finished difference. Result has 73 places, 39 transitions, 209 flow
[2024-11-07 11:14:12,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=209, PETRI_PLACES=73, PETRI_TRANSITIONS=39}
[2024-11-07 11:14:12,903 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places.
[2024-11-07 11:14:12,903 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 39 transitions, 209 flow
[2024-11-07 11:14:12,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:12,903 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:14:12,903 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:14:12,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 11:14:12,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:14:12,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:14:12,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1218522830, now seen corresponding path program 1 times
[2024-11-07 11:14:12,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:14:12,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8591672]
[2024-11-07 11:14:12,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:14:12,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:14:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:14:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 11:14:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:14:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8591672]
[2024-11-07 11:14:13,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8591672] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:14:13,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:14:13,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:14:13,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126877489]
[2024-11-07 11:14:13,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:14:13,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 11:14:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:14:13,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 11:14:13,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 11:14:13,025 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40
[2024-11-07 11:14:13,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 39 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:13,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:14:13,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40
[2024-11-07 11:14:13,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:14:13,322 INFO L124 PetriNetUnfolderBase]: 1456/2698 cut-off events.
[2024-11-07 11:14:13,323 INFO L125 PetriNetUnfolderBase]: For 6625/6699 co-relation queries the response was YES.
[2024-11-07 11:14:13,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7569 conditions, 2698 events. 1456/2698 cut-off events. For 6625/6699 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19251 event pairs, 452 based on Foata normal form. 102/2694 useless extension candidates. Maximal degree in co-relation 7538. Up to 1582 conditions per place.
[2024-11-07 11:14:13,335 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 25 selfloop transitions, 3 changer transitions 31/74 dead transitions.
[2024-11-07 11:14:13,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 74 transitions, 503 flow
[2024-11-07 11:14:13,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 11:14:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-07 11:14:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions.
[2024-11-07 11:14:13,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5928571428571429
[2024-11-07 11:14:13,337 INFO L175 Difference]: Start difference. First operand has 73 places, 39 transitions, 209 flow. Second operand 7 states and 166 transitions.
[2024-11-07 11:14:13,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 74 transitions, 503 flow
[2024-11-07 11:14:13,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 443 flow, removed 27 selfloop flow, removed 10 redundant places.
[2024-11-07 11:14:13,344 INFO L231 Difference]: Finished difference. Result has 68 places, 38 transitions, 182 flow
[2024-11-07 11:14:13,345 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=68, PETRI_TRANSITIONS=38}
[2024-11-07 11:14:13,345 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places.
[2024-11-07 11:14:13,345 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 38 transitions, 182 flow
[2024-11-07 11:14:13,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:13,345 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:14:13,346 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:14:13,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 11:14:13,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:14:13,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:14:13,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1015216882, now seen corresponding path program 1 times
[2024-11-07 11:14:13,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:14:13,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189100750]
[2024-11-07 11:14:13,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:14:13,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:14:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:14:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 11:14:13,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:14:13,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189100750]
[2024-11-07 11:14:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189100750] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:14:13,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:14:13,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 11:14:13,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016975591]
[2024-11-07 11:14:13,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:14:13,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 11:14:13,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:14:13,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 11:14:13,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 11:14:13,468 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40
[2024-11-07 11:14:13,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 38 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:13,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:14:13,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40
[2024-11-07 11:14:13,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:14:13,801 INFO L124 PetriNetUnfolderBase]: 2943/4871 cut-off events.
[2024-11-07 11:14:13,801 INFO L125 PetriNetUnfolderBase]: For 4403/4542 co-relation queries the response was YES.
[2024-11-07 11:14:13,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11820 conditions, 4871 events. 2943/4871 cut-off events. For 4403/4542 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 32817 event pairs, 412 based on Foata normal form. 336/5093 useless extension candidates. Maximal degree in co-relation 11792. Up to 2416 conditions per place.
[2024-11-07 11:14:13,819 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 40 selfloop transitions, 5 changer transitions 5/65 dead transitions.
[2024-11-07 11:14:13,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 384 flow
[2024-11-07 11:14:13,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 11:14:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-07 11:14:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions.
[2024-11-07 11:14:13,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6875
[2024-11-07 11:14:13,820 INFO L175 Difference]: Start difference. First operand has 68 places, 38 transitions, 182 flow. Second operand 4 states and 110 transitions.
[2024-11-07 11:14:13,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 384 flow
[2024-11-07 11:14:13,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 358 flow, removed 7 selfloop flow, removed 9 redundant places.
[2024-11-07 11:14:13,829 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 192 flow
[2024-11-07 11:14:13,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=60, PETRI_TRANSITIONS=41}
[2024-11-07 11:14:13,830 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places.
[2024-11-07 11:14:13,830 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 192 flow
[2024-11-07 11:14:13,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:13,830 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:14:13,830 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:14:13,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 11:14:13,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:14:13,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:14:13,831 INFO L85 PathProgramCache]: Analyzing trace with hash -668981893, now seen corresponding path program 1 times
[2024-11-07 11:14:13,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:14:13,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049025755]
[2024-11-07 11:14:13,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:14:13,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:14:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:14:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 11:14:13,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:14:13,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049025755]
[2024-11-07 11:14:13,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049025755] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:14:13,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:14:13,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:14:13,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223427252]
[2024-11-07 11:14:13,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:14:13,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 11:14:13,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:14:13,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 11:14:13,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 11:14:13,960 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40
[2024-11-07 11:14:13,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:13,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:14:13,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40
[2024-11-07 11:14:13,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:14:14,227 INFO L124 PetriNetUnfolderBase]: 2121/3576 cut-off events.
[2024-11-07 11:14:14,227 INFO L125 PetriNetUnfolderBase]: For 3053/3103 co-relation queries the response was YES.
[2024-11-07 11:14:14,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9547 conditions, 3576 events. 2121/3576 cut-off events. For 3053/3103 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 22053 event pairs, 171 based on Foata normal form. 270/3771 useless extension candidates. Maximal degree in co-relation 9524. Up to 1273 conditions per place.
[2024-11-07 11:14:14,240 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 49 selfloop transitions, 8 changer transitions 6/78 dead transitions.
[2024-11-07 11:14:14,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 476 flow
[2024-11-07 11:14:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 11:14:14,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-07 11:14:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions.
[2024-11-07 11:14:14,241 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.685
[2024-11-07 11:14:14,241 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 192 flow. Second operand 5 states and 137 transitions.
[2024-11-07 11:14:14,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 476 flow
[2024-11-07 11:14:14,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 461 flow, removed 2 selfloop flow, removed 3 redundant places.
[2024-11-07 11:14:14,244 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 227 flow
[2024-11-07 11:14:14,244 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=63, PETRI_TRANSITIONS=44}
[2024-11-07 11:14:14,246 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places.
[2024-11-07 11:14:14,246 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 227 flow
[2024-11-07 11:14:14,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:14,248 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:14:14,248 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:14:14,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 11:14:14,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:14:14,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:14:14,248 INFO L85 PathProgramCache]: Analyzing trace with hash -297732342, now seen corresponding path program 1 times
[2024-11-07 11:14:14,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:14:14,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216059325]
[2024-11-07 11:14:14,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:14:14,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:14:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:14:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 11:14:14,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:14:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216059325]
[2024-11-07 11:14:14,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216059325] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:14:14,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:14:14,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 11:14:14,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260522998]
[2024-11-07 11:14:14,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:14:14,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 11:14:14,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:14:14,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 11:14:14,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-07 11:14:14,434 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40
[2024-11-07 11:14:14,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:14,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:14:14,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40
[2024-11-07 11:14:14,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:14:14,636 INFO L124 PetriNetUnfolderBase]: 1322/2219 cut-off events.
[2024-11-07 11:14:14,637 INFO L125 PetriNetUnfolderBase]: For 3285/3309 co-relation queries the response was YES.
[2024-11-07 11:14:14,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6564 conditions, 2219 events. 1322/2219 cut-off events. For 3285/3309 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12034 event pairs, 124 based on Foata normal form. 150/2305 useless extension candidates. Maximal degree in co-relation 6540. Up to 828 conditions per place.
[2024-11-07 11:14:14,644 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 42 selfloop transitions, 11 changer transitions 6/74 dead transitions.
[2024-11-07 11:14:14,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 74 transitions, 457 flow
[2024-11-07 11:14:14,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 11:14:14,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-07 11:14:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions.
[2024-11-07 11:14:14,645 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6291666666666667
[2024-11-07 11:14:14,645 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 227 flow. Second operand 6 states and 151 transitions.
[2024-11-07 11:14:14,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 74 transitions, 457 flow
[2024-11-07 11:14:14,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 411 flow, removed 13 selfloop flow, removed 7 redundant places.
[2024-11-07 11:14:14,651 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 228 flow
[2024-11-07 11:14:14,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=63, PETRI_TRANSITIONS=44}
[2024-11-07 11:14:14,652 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places.
[2024-11-07 11:14:14,652 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 228 flow
[2024-11-07 11:14:14,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:14,652 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:14:14,652 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:14:14,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-07 11:14:14,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:14:14,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:14:14,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1373313618, now seen corresponding path program 1 times
[2024-11-07 11:14:14,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:14:14,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291026749]
[2024-11-07 11:14:14,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:14:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:14:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:14:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 11:14:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:14:14,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291026749]
[2024-11-07 11:14:14,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291026749] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:14:14,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:14:14,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 11:14:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013689243]
[2024-11-07 11:14:14,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:14:14,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 11:14:14,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:14:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 11:14:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-07 11:14:14,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40
[2024-11-07 11:14:14,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:14,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:14:14,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40
[2024-11-07 11:14:14,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:14:15,051 INFO L124 PetriNetUnfolderBase]: 870/1695 cut-off events.
[2024-11-07 11:14:15,052 INFO L125 PetriNetUnfolderBase]: For 1857/1891 co-relation queries the response was YES.
[2024-11-07 11:14:15,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4602 conditions, 1695 events. 870/1695 cut-off events. For 1857/1891 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10165 event pairs, 305 based on Foata normal form. 8/1636 useless extension candidates. Maximal degree in co-relation 4580. Up to 632 conditions per place.
[2024-11-07 11:14:15,058 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 32 selfloop transitions, 5 changer transitions 22/75 dead transitions.
[2024-11-07 11:14:15,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 432 flow
[2024-11-07 11:14:15,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 11:14:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-07 11:14:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions.
[2024-11-07 11:14:15,059 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.575
[2024-11-07 11:14:15,059 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 228 flow. Second operand 6 states and 138 transitions.
[2024-11-07 11:14:15,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 432 flow
[2024-11-07 11:14:15,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 360 flow, removed 18 selfloop flow, removed 8 redundant places.
[2024-11-07 11:14:15,064 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 168 flow
[2024-11-07 11:14:15,065 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=63, PETRI_TRANSITIONS=41}
[2024-11-07 11:14:15,066 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places.
[2024-11-07 11:14:15,066 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 168 flow
[2024-11-07 11:14:15,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:15,067 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:14:15,067 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:14:15,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-07 11:14:15,067 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:14:15,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:14:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1684037312, now seen corresponding path program 2 times
[2024-11-07 11:14:15,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:14:15,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484806820]
[2024-11-07 11:14:15,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:14:15,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:14:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:14:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 11:14:15,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:14:15,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484806820]
[2024-11-07 11:14:15,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484806820] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:14:15,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:14:15,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 11:14:15,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003686297]
[2024-11-07 11:14:15,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:14:15,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 11:14:15,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:14:15,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 11:14:15,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2024-11-07 11:14:15,853 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40
[2024-11-07 11:14:15,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 168 flow. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:15,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:14:15,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40
[2024-11-07 11:14:15,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:14:16,112 INFO L124 PetriNetUnfolderBase]: 541/1049 cut-off events.
[2024-11-07 11:14:16,113 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES.
[2024-11-07 11:14:16,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2320 conditions, 1049 events. 541/1049 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5704 event pairs, 190 based on Foata normal form. 8/970 useless extension candidates. Maximal degree in co-relation 2299. Up to 401 conditions per place.
[2024-11-07 11:14:16,117 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 22 selfloop transitions, 4 changer transitions 24/71 dead transitions.
[2024-11-07 11:14:16,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 351 flow
[2024-11-07 11:14:16,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 11:14:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-07 11:14:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions.
[2024-11-07 11:14:16,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.578125
[2024-11-07 11:14:16,118 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 168 flow. Second operand 8 states and 185 transitions.
[2024-11-07 11:14:16,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 351 flow
[2024-11-07 11:14:16,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 308 flow, removed 8 selfloop flow, removed 10 redundant places.
[2024-11-07 11:14:16,120 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 154 flow
[2024-11-07 11:14:16,120 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=154, PETRI_PLACES=62, PETRI_TRANSITIONS=41}
[2024-11-07 11:14:16,121 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places.
[2024-11-07 11:14:16,121 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 154 flow
[2024-11-07 11:14:16,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:14:16,121 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:14:16,121 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:14:16,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-07 11:14:16,121 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:14:16,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:14:16,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1237577064, now seen corresponding path program 3 times
[2024-11-07 11:14:16,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:14:16,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098612763]
[2024-11-07 11:14:16,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:14:16,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:14:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 11:14:16,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 11:14:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 11:14:16,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 11:14:16,240 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 11:14:16,241 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2024-11-07 11:14:16,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2024-11-07 11:14:16,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining)
[2024-11-07 11:14:16,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2024-11-07 11:14:16,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2024-11-07 11:14:16,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2024-11-07 11:14:16,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-07 11:14:16,242 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:14:16,290 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-07 11:14:16,291 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 11:14:16,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:14:16 BasicIcfg
[2024-11-07 11:14:16,297 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 11:14:16,298 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 11:14:16,298 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 11:14:16,298 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 11:14:16,298 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:14:08" (3/4) ...
[2024-11-07 11:14:16,299 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-07 11:14:16,369 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 11:14:16,371 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 11:14:16,372 INFO L158 Benchmark]: Toolchain (without parser) took 8723.18ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 115.4MB in the beginning and 327.7MB in the end (delta: -212.3MB). Peak memory consumption was 329.7MB. Max. memory is 16.1GB.
[2024-11-07 11:14:16,372 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:14:16,372 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.27ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 92.4MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 11:14:16,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.48ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:14:16,372 INFO L158 Benchmark]: Boogie Preprocessor took 44.54ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 87.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:14:16,372 INFO L158 Benchmark]: RCFGBuilder took 526.91ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 109.4MB in the end (delta: -22.2MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB.
[2024-11-07 11:14:16,372 INFO L158 Benchmark]: TraceAbstraction took 7695.91ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 108.7MB in the beginning and 340.3MB in the end (delta: -231.6MB). Peak memory consumption was 307.0MB. Max. memory is 16.1GB.
[2024-11-07 11:14:16,372 INFO L158 Benchmark]: Witness Printer took 73.54ms. Allocated memory is still 679.5MB. Free memory was 340.3MB in the beginning and 327.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 11:14:16,373 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.56ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 340.27ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 92.4MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 36.48ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 44.54ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 87.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 526.91ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 109.4MB in the end (delta: -22.2MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 7695.91ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 108.7MB in the beginning and 340.3MB in the end (delta: -231.6MB). Peak memory consumption was 307.0MB. Max. memory is 16.1GB.
* Witness Printer took 73.54ms. Allocated memory is still 679.5MB. Free memory was 340.3MB in the beginning and 327.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 19]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L714] 0 int __unbuffered_p2_EAX = 0;
[L716] 0 int __unbuffered_p2_EBX = 0;
[L717] 0 _Bool main$tmp_guard0;
[L718] 0 _Bool main$tmp_guard1;
[L720] 0 int x = 0;
[L721] 0 _Bool x$flush_delayed;
[L722] 0 int x$mem_tmp;
[L723] 0 _Bool x$r_buff0_thd0;
[L724] 0 _Bool x$r_buff0_thd1;
[L725] 0 _Bool x$r_buff0_thd2;
[L726] 0 _Bool x$r_buff0_thd3;
[L727] 0 _Bool x$r_buff1_thd0;
[L728] 0 _Bool x$r_buff1_thd1;
[L729] 0 _Bool x$r_buff1_thd2;
[L730] 0 _Bool x$r_buff1_thd3;
[L731] 0 _Bool x$read_delayed;
[L732] 0 int *x$read_delayed_var;
[L733] 0 int x$w_buff0;
[L734] 0 _Bool x$w_buff0_used;
[L735] 0 int x$w_buff1;
[L736] 0 _Bool x$w_buff1_used;
[L738] 0 int y = 0;
[L739] 0 _Bool weak$$choice0;
[L740] 0 _Bool weak$$choice2;
[L831] 0 pthread_t t1897;
[L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L833] 0 pthread_t t1898;
[L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-2, t1898=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L835] 0 pthread_t t1899;
[L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-2, t1898=-1, t1899=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L774] 2 x$w_buff1 = x$w_buff0
[L775] 2 x$w_buff0 = 1
[L776] 2 x$w_buff1_used = x$w_buff0_used
[L777] 2 x$w_buff0_used = (_Bool)1
[L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19] COND FALSE 2 !(!expression)
[L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L783] 2 x$r_buff0_thd2 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L786] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L803] 3 __unbuffered_p2_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L806] 3 __unbuffered_p2_EBX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L744] 1 y = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L749] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L750] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L751] 1 x$flush_delayed = weak$$choice2
[L752] 1 x$mem_tmp = x
[L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L760] 1 __unbuffered_p0_EAX = x
[L761] 1 x = x$flush_delayed ? x$mem_tmp : x
[L762] 1 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L789] 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)
[L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L791] 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
[L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-2, t1898=-1, t1899=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L840] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L840] RET 0 assume_abort_if_not(main$tmp_guard0)
[L842] 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)
[L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L844] 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
[L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-2, t1898=-1, t1899=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-2, t1898=-1, t1899=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L851] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L19] 0 reach_error()
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1410 IncrementalHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 42 mSDtfsCounter, 1410 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=9, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 1009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-11-07 11:14:16,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE