./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/fib_unsafe-6.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR_WITH_CONTEXT -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version b86fb0b7
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-6.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 854e371c98b43d805c328b457758892c4a501d7b326c2672c089850792494a4b --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR_WITH_CONTEXT -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m
[2024-10-17 02:53:45,972 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-17 02:53:46,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-10-17 02:53:46,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-17 02:53:46,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-17 02:53:46,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-17 02:53:46,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-17 02:53:46,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-17 02:53:46,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-17 02:53:46,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-17 02:53:46,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-17 02:53:46,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-17 02:53:46,048 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-17 02:53:46,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-17 02:53:46,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-17 02:53:46,051 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-17 02:53:46,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-17 02:53:46,052 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-17 02:53:46,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-17 02:53:46,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-17 02:53:46,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-17 02:53:46,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-17 02:53:46,053 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-17 02:53:46,053 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-17 02:53:46,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-17 02:53:46,053 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-17 02:53:46,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-17 02:53:46,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-17 02:53:46,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-17 02:53:46,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-17 02:53:46,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-17 02:53:46,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-17 02:53:46,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-17 02:53:46,054 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP
[2024-10-17 02:53:46,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-17 02:53:46,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-17 02:53:46,055 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-10-17 02:53:46,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-17 02:53:46,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-17 02:53:46,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-10-17 02:53:46,055 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-10-17 02:53:46,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 -> GemCutter
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 -> 854e371c98b43d805c328b457758892c4a501d7b326c2672c089850792494a4b
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> GENERATOR_WITH_CONTEXT
[2024-10-17 02:53:46,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-17 02:53:46,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-17 02:53:46,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-17 02:53:46,271 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-17 02:53:46,271 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-17 02:53:46,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-6.i
[2024-10-17 02:53:47,458 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-17 02:53:47,640 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-17 02:53:47,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-6.i
[2024-10-17 02:53:47,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2662bf8c8/5aad8d6272be493bb156622b853de262/FLAGab773f440
[2024-10-17 02:53:47,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2662bf8c8/5aad8d6272be493bb156622b853de262
[2024-10-17 02:53:47,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-17 02:53:47,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-17 02:53:47,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-17 02:53:47,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-17 02:53:47,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-17 02:53:47,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 02:53:47" (1/1) ...
[2024-10-17 02:53:47,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6424154e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:53:47, skipping insertion in model container
[2024-10-17 02:53:47,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 02:53:47" (1/1) ...
[2024-10-17 02:53:47,724 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-17 02:53:47,985 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-6.i[30243,30256]
[2024-10-17 02:53:48,000 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-17 02:53:48,013 INFO L200 MainTranslator]: Completed pre-run
[2024-10-17 02:53:48,036 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-6.i[30243,30256]
[2024-10-17 02:53:48,043 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-17 02:53:48,074 INFO L204 MainTranslator]: Completed translation
[2024-10-17 02:53:48,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:53:48 WrapperNode
[2024-10-17 02:53:48,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-17 02:53:48,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-17 02:53:48,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-17 02:53:48,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-17 02:53:48,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:53:48" (1/1) ...
[2024-10-17 02:53:48,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:53:48" (1/1) ...
[2024-10-17 02:53:48,145 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66
[2024-10-17 02:53:48,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-17 02:53:48,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-17 02:53:48,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-17 02:53:48,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-17 02:53:48,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:53:48" (1/1) ...
[2024-10-17 02:53:48,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:53:48" (1/1) ...
[2024-10-17 02:53:48,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:53:48" (1/1) ...
[2024-10-17 02:53:48,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:53:48" (1/1) ...
[2024-10-17 02:53:48,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:53:48" (1/1) ...
[2024-10-17 02:53:48,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:53:48" (1/1) ...
[2024-10-17 02:53:48,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:53:48" (1/1) ...
[2024-10-17 02:53:48,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:53:48" (1/1) ...
[2024-10-17 02:53:48,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-17 02:53:48,167 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-17 02:53:48,168 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-17 02:53:48,168 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-17 02:53:48,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:53:48" (1/1) ...
[2024-10-17 02:53:48,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-17 02:53:48,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-17 02:53:48,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-10-17 02:53:48,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-10-17 02:53:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure t1
[2024-10-17 02:53:48,230 INFO L138 BoogieDeclarations]: Found implementation of procedure t1
[2024-10-17 02:53:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure t2
[2024-10-17 02:53:48,231 INFO L138 BoogieDeclarations]: Found implementation of procedure t2
[2024-10-17 02:53:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-10-17 02:53:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-17 02:53:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-17 02:53:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-10-17 02:53:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-17 02:53:48,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-17 02:53:48,232 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-10-17 02:53:48,317 INFO L238 CfgBuilder]: Building ICFG
[2024-10-17 02:53:48,319 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-17 02:53:48,424 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-17 02:53:48,424 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-17 02:53:48,513 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-17 02:53:48,513 INFO L314 CfgBuilder]: Removed 3 assume(true) statements.
[2024-10-17 02:53:48,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 02:53:48 BoogieIcfgContainer
[2024-10-17 02:53:48,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-17 02:53:48,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-17 02:53:48,515 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-17 02:53:48,517 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-17 02:53:48,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 02:53:47" (1/3) ...
[2024-10-17 02:53:48,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5efaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 02:53:48, skipping insertion in model container
[2024-10-17 02:53:48,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:53:48" (2/3) ...
[2024-10-17 02:53:48,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5efaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 02:53:48, skipping insertion in model container
[2024-10-17 02:53:48,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 02:53:48" (3/3) ...
[2024-10-17 02:53:48,520 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-6.i
[2024-10-17 02:53:48,533 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-17 02:53:48,533 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-10-17 02:53:48,534 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-17 02:53:48,565 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-17 02:53:48,598 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-17 02:53:48,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-10-17 02:53:48,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-17 02:53:48,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-10-17 02:53:48,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process
[2024-10-17 02:53:48,660 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-10-17 02:53:48,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-17 02:53:48,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-10-17 02:53:48,683 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=PARTIAL_ORDER_FA, 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;@1854372c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR_WITH_CONTEXT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false
[2024-10-17 02:53:48,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations.
[2024-10-17 02:53:49,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-17 02:53:49,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-17 02:53:49,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1703157173, now seen corresponding path program 1 times
[2024-10-17 02:53:49,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-17 02:53:49,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973022540]
[2024-10-17 02:53:49,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-17 02:53:49,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-17 02:53:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-17 02:53:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-17 02:53:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-17 02:53:49,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973022540]
[2024-10-17 02:53:49,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973022540] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-17 02:53:49,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-17 02:53:49,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-17 02:53:49,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723552050]
[2024-10-17 02:53:49,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-17 02:53:49,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-17 02:53:49,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-17 02:53:49,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-17 02:53:49,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-17 02:53:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-17 02:53:49,340 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-17 02:53:49,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-17 02:53:49,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-17 02:53:49,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-17 02:53:49,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-17 02:53:49,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-17 02:53:49,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-17 02:53:49,419 INFO L85 PathProgramCache]: Analyzing trace with hash 311074172, now seen corresponding path program 1 times
[2024-10-17 02:53:49,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-17 02:53:49,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956081681]
[2024-10-17 02:53:49,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-17 02:53:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-17 02:53:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-17 02:53:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-17 02:53:49,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-17 02:53:49,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956081681]
[2024-10-17 02:53:49,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956081681] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-17 02:53:49,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183900791]
[2024-10-17 02:53:49,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-17 02:53:49,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-17 02:53:49,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-17 02:53:49,582 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-17 02:53:49,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-10-17 02:53:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-17 02:53:49,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-10-17 02:53:49,667 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-17 02:53:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-17 02:53:49,715 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-17 02:53:49,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-17 02:53:49,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183900791] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-17 02:53:49,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-10-17 02:53:49,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7
[2024-10-17 02:53:49,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693156228]
[2024-10-17 02:53:49,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-10-17 02:53:49,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-10-17 02:53:49,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-17 02:53:49,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-10-17 02:53:49,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2024-10-17 02:53:49,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-17 02:53:49,754 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-17 02:53:49,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-10-17 02:53:49,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-17 02:53:49,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-17 02:53:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-17 02:53:49,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-17 02:53:49,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-10-17 02:53:50,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1
[2024-10-17 02:53:50,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-17 02:53:50,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-17 02:53:50,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1499777035, now seen corresponding path program 2 times
[2024-10-17 02:53:50,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-17 02:53:50,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227462032]
[2024-10-17 02:53:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-17 02:53:50,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-17 02:53:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-17 02:53:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-17 02:53:50,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-17 02:53:50,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227462032]
[2024-10-17 02:53:50,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227462032] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-17 02:53:50,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547584869]
[2024-10-17 02:53:50,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-10-17 02:53:50,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-17 02:53:50,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-17 02:53:50,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-17 02:53:50,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-10-17 02:53:50,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-10-17 02:53:50,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-10-17 02:53:50,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-10-17 02:53:50,281 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-17 02:53:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-17 02:53:50,346 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-17 02:53:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-17 02:53:50,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547584869] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-17 02:53:50,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-10-17 02:53:50,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13
[2024-10-17 02:53:50,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183150636]
[2024-10-17 02:53:50,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-10-17 02:53:50,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-10-17 02:53:50,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-17 02:53:50,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-10-17 02:53:50,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156
[2024-10-17 02:53:50,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-17 02:53:50,437 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-17 02:53:50,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 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-10-17 02:53:50,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-17 02:53:50,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-17 02:53:50,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-17 02:53:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-17 02:53:50,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-17 02:53:50,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-10-17 02:53:50,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-10-17 02:53:50,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-17 02:53:50,737 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-17 02:53:50,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-17 02:53:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1238457173, now seen corresponding path program 3 times
[2024-10-17 02:53:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-17 02:53:50,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565173916]
[2024-10-17 02:53:50,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-17 02:53:50,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-17 02:53:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-17 02:53:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-17 02:53:51,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-17 02:53:51,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565173916]
[2024-10-17 02:53:51,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565173916] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-17 02:53:51,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987760389]
[2024-10-17 02:53:51,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-10-17 02:53:51,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-17 02:53:51,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-17 02:53:51,029 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-17 02:53:51,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-10-17 02:53:51,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s)
[2024-10-17 02:53:51,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-10-17 02:53:51,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-10-17 02:53:51,110 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-17 02:53:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-17 02:53:51,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-17 02:53:51,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987760389] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-17 02:53:51,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-10-17 02:53:51,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 24
[2024-10-17 02:53:51,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962737243]
[2024-10-17 02:53:51,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-17 02:53:51,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-10-17 02:53:51,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-17 02:53:51,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-10-17 02:53:51,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552
[2024-10-17 02:53:51,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-17 02:53:51,291 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-17 02:53:51,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 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-10-17 02:53:51,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-17 02:53:51,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-17 02:53:51,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2024-10-17 02:53:51,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-17 02:53:51,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-17 02:53:51,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-17 02:53:51,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-10-17 02:53:51,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-10-17 02:53:51,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-10-17 02:53:51,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-17 02:53:51,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-17 02:53:51,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-17 02:53:51,632 INFO L85 PathProgramCache]: Analyzing trace with hash -858179553, now seen corresponding path program 1 times
[2024-10-17 02:53:51,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-17 02:53:51,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173843486]
[2024-10-17 02:53:51,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-17 02:53:51,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-17 02:53:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-17 02:53:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-17 02:53:51,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-17 02:53:51,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173843486]
[2024-10-17 02:53:51,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173843486] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-17 02:53:51,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643957147]
[2024-10-17 02:53:51,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-17 02:53:51,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-17 02:53:51,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-17 02:53:51,829 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-17 02:53:51,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-10-17 02:53:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-17 02:53:51,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-10-17 02:53:51,901 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-17 02:53:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2024-10-17 02:53:52,011 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-17 02:53:52,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643957147] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-17 02:53:52,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-10-17 02:53:52,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20
[2024-10-17 02:53:52,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884241094]
[2024-10-17 02:53:52,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-17 02:53:52,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-10-17 02:53:52,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-17 02:53:52,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-10-17 02:53:52,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380
[2024-10-17 02:53:52,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-17 02:53:52,014 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-17 02:53:52,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 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-10-17 02:53:52,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-17 02:53:52,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-17 02:53:52,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2024-10-17 02:53:52,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-10-17 02:53:52,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-17 02:53:52,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-17 02:53:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-17 02:53:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-10-17 02:53:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-10-17 02:53:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-10-17 02:53:52,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-10-17 02:53:52,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-17 02:53:52,303 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-17 02:53:52,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-17 02:53:52,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1002281397, now seen corresponding path program 1 times
[2024-10-17 02:53:52,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-17 02:53:52,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546271264]
[2024-10-17 02:53:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-17 02:53:52,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-17 02:53:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-17 02:53:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-17 02:53:52,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-17 02:53:52,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546271264]
[2024-10-17 02:53:52,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546271264] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-17 02:53:52,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040758769]
[2024-10-17 02:53:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-17 02:53:52,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-17 02:53:52,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-17 02:53:52,450 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-17 02:53:52,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-10-17 02:53:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-17 02:53:52,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-10-17 02:53:52,522 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-17 02:53:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-17 02:53:52,580 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-17 02:53:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-17 02:53:52,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040758769] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-17 02:53:52,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-10-17 02:53:52,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 17
[2024-10-17 02:53:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875781845]
[2024-10-17 02:53:52,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-10-17 02:53:52,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-10-17 02:53:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-17 02:53:52,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-10-17 02:53:52,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272
[2024-10-17 02:53:52,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-17 02:53:52,707 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-17 02:53:52,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 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-10-17 02:53:52,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-17 02:53:52,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-17 02:53:52,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2024-10-17 02:53:52,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-10-17 02:53:52,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-10-17 02:53:52,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-17 02:53:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-17 02:53:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-17 02:53:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-10-17 02:53:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-10-17 02:53:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-10-17 02:53:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-10-17 02:53:52,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2024-10-17 02:53:52,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-17 02:53:52,968 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-17 02:53:52,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-17 02:53:52,969 INFO L85 PathProgramCache]: Analyzing trace with hash 404632523, now seen corresponding path program 2 times
[2024-10-17 02:53:52,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-17 02:53:52,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608637602]
[2024-10-17 02:53:52,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-17 02:53:52,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-17 02:53:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-17 02:53:52,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-17 02:53:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-17 02:53:53,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-17 02:53:53,051 INFO L332 BasicCegarLoop]: Counterexample is feasible
[2024-10-17 02:53:53,052 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining)
[2024-10-17 02:53:53,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining)
[2024-10-17 02:53:53,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining)
[2024-10-17 02:53:53,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-10-17 02:53:53,061 INFO L414 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1]
[2024-10-17 02:53:53,141 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-17 02:53:53,141 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-17 02:53:53,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 02:53:53 BasicIcfg
[2024-10-17 02:53:53,143 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-17 02:53:53,144 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-17 02:53:53,144 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-17 02:53:53,144 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-17 02:53:53,144 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 02:53:48" (3/4) ...
[2024-10-17 02:53:53,148 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample
[2024-10-17 02:53:53,225 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml
[2024-10-17 02:53:53,225 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-17 02:53:53,225 INFO L158 Benchmark]: Toolchain (without parser) took 5549.16ms. Allocated memory was 192.9MB in the beginning and 299.9MB in the end (delta: 107.0MB). Free memory was 121.1MB in the beginning and 157.9MB in the end (delta: -36.8MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB.
[2024-10-17 02:53:53,225 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 192.9MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-17 02:53:53,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.49ms. Allocated memory is still 192.9MB. Free memory was 120.9MB in the beginning and 99.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
[2024-10-17 02:53:53,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.26ms. Allocated memory is still 192.9MB. Free memory was 99.4MB in the beginning and 159.3MB in the end (delta: -59.9MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB.
[2024-10-17 02:53:53,226 INFO L158 Benchmark]: Boogie Preprocessor took 17.62ms. Allocated memory is still 192.9MB. Free memory was 159.3MB in the beginning and 158.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-17 02:53:53,226 INFO L158 Benchmark]: RCFGBuilder took 345.73ms. Allocated memory is still 192.9MB. Free memory was 158.3MB in the beginning and 136.3MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2024-10-17 02:53:53,226 INFO L158 Benchmark]: TraceAbstraction took 4628.85ms. Allocated memory was 192.9MB in the beginning and 299.9MB in the end (delta: 107.0MB). Free memory was 135.2MB in the beginning and 173.7MB in the end (delta: -38.4MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB.
[2024-10-17 02:53:53,226 INFO L158 Benchmark]: Witness Printer took 81.25ms. Allocated memory is still 299.9MB. Free memory was 173.7MB in the beginning and 157.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-10-17 02:53:53,227 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.16ms. Allocated memory is still 192.9MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 396.49ms. Allocated memory is still 192.9MB. Free memory was 120.9MB in the beginning and 99.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 69.26ms. Allocated memory is still 192.9MB. Free memory was 99.4MB in the beginning and 159.3MB in the end (delta: -59.9MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 17.62ms. Allocated memory is still 192.9MB. Free memory was 159.3MB in the beginning and 158.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 345.73ms. Allocated memory is still 192.9MB. Free memory was 158.3MB in the beginning and 136.3MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* TraceAbstraction took 4628.85ms. Allocated memory was 192.9MB in the beginning and 299.9MB in the end (delta: 107.0MB). Free memory was 135.2MB in the beginning and 173.7MB in the end (delta: -38.4MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB.
* Witness Printer took 81.25ms. Allocated memory is still 299.9MB. Free memory was 173.7MB in the beginning and 157.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: Partial order reduction statistics
Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3095, independent: 2595, independent conditional: 2348, independent unconditional: 247, dependent: 500, dependent conditional: 493, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2602, independent: 2595, independent conditional: 2348, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2602, independent: 2595, independent conditional: 2348, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2602, independent: 2595, independent conditional: 2348, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2609, independent: 2595, independent conditional: 2348, independent unconditional: 247, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2609, independent: 2595, independent conditional: 0, independent unconditional: 2595, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2609, independent: 2595, independent conditional: 0, independent unconditional: 2595, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 238, independent: 231, independent conditional: 0, independent unconditional: 231, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 238, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 355, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 286, dependent conditional: 0, dependent unconditional: 286, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2609, independent: 2364, independent conditional: 0, independent unconditional: 2364, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 238, unknown conditional: 0, unknown unconditional: 238] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 231, Positive conditional cache size: 0, Positive unconditional cache size: 231, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2348, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2609, independent: 2595, independent conditional: 2348, independent unconditional: 247, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2609, independent: 2595, independent conditional: 0, independent unconditional: 2595, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2609, independent: 2595, independent conditional: 0, independent unconditional: 2595, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 238, independent: 231, independent conditional: 0, independent unconditional: 231, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 238, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 355, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 286, dependent conditional: 0, dependent unconditional: 286, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2609, independent: 2364, independent conditional: 0, independent unconditional: 2364, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 238, unknown conditional: 0, unknown unconditional: 238] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 231, Positive conditional cache size: 0, Positive unconditional cache size: 231, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2348 ], Independence queries for same thread: 493, Persistent sets #1 benchmarks: Persistent set computation time: 0.4s, Number of persistent set computation: 34, Number of trivial persistent sets: 20, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 254, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3095, independent: 2595, independent conditional: 2348, independent unconditional: 247, dependent: 500, dependent conditional: 493, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2602, independent: 2595, independent conditional: 2348, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2602, independent: 2595, independent conditional: 2348, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2602, independent: 2595, independent conditional: 2348, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2609, independent: 2595, independent conditional: 2348, independent unconditional: 247, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2609, independent: 2595, independent conditional: 0, independent unconditional: 2595, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2609, independent: 2595, independent conditional: 0, independent unconditional: 2595, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 238, independent: 231, independent conditional: 0, independent unconditional: 231, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 238, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 355, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 286, dependent conditional: 0, dependent unconditional: 286, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2609, independent: 2364, independent conditional: 0, independent unconditional: 2364, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 238, unknown conditional: 0, unknown unconditional: 238] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 231, Positive conditional cache size: 0, Positive unconditional cache size: 231, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2348, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2609, independent: 2595, independent conditional: 2348, independent unconditional: 247, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2609, independent: 2595, independent conditional: 0, independent unconditional: 2595, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2609, independent: 2595, independent conditional: 0, independent unconditional: 2595, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 238, independent: 231, independent conditional: 0, independent unconditional: 231, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 238, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 355, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 286, dependent conditional: 0, dependent unconditional: 286, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2609, independent: 2364, independent conditional: 0, independent unconditional: 2364, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 238, unknown conditional: 0, unknown unconditional: 238] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 231, Positive conditional cache size: 0, Positive unconditional cache size: 231, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2348 ], Independence queries for same thread: 493
- CounterExampleResult [Line: 681]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L682] 0 int i, j;
[L685] 0 int p, q;
[L702] 0 int cur = 1, prev = 0, next = 0;
[L703] 0 int x;
[L713] 0 pthread_t id1, id2;
VAL [\old(argc)=611, \old(argv)={612:613}, argc=611, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0]
[L715] 0 i = 1
VAL [\old(argc)=611, \old(argv)={612:613}, argc=611, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0]
[L718] 0 j = 1
VAL [\old(argc)=611, \old(argv)={612:613}, argc=611, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L720] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0))
VAL [\old(arg)={0:0}, \old(argc)=611, \old(argv)={612:613}, argc=611, cur=1, i=1, id1=-2, j=1, next=0, p=0, prev=0, q=0, x=0]
[L687] 1 p = 0
VAL [\old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L721] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=611, \old(argv)={612:613}, arg={0:0}, argc=611, cur=1, i=1, id1=-2, id2=-1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L695] 2 q = 0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L722] CALL, EXPR 0 fib()
[L705] 0 x = 0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L687] COND TRUE 1 p < 6
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=0, prev=0, q=0, x=0]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0]
[L695] COND TRUE 2 q < 6
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=0, x=0]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0]
[L705] COND TRUE 0 x < 14
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1]
[L687] COND TRUE 1 p < 6
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=1, prev=1, q=1, x=1]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1]
[L695] COND TRUE 2 q < 6
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=1, x=1]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1]
[L705] COND TRUE 0 x < 14
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2]
[L687] COND TRUE 1 p < 6
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=2, prev=1, q=2, x=2]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2]
[L695] COND TRUE 2 q < 6
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=2, x=2]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2]
[L705] COND TRUE 0 x < 14
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3]
[L687] COND TRUE 1 p < 6
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=3, prev=2, q=3, x=3]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3]
[L695] COND TRUE 2 q < 6
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=3, x=3]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3]
[L705] COND TRUE 0 x < 14
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4]
[L687] COND TRUE 1 p < 6
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=4, prev=3, q=4, x=4]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4]
[L695] COND TRUE 2 q < 6
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=4, x=4]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4]
[L705] COND TRUE 0 x < 14
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5]
[L687] COND TRUE 1 p < 6
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=5, prev=5, q=5, x=5]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5]
[L695] COND TRUE 2 q < 6
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=5, x=5]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=6, x=5]
[L705] COND TRUE 0 x < 14
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6]
[L687] COND FALSE 1 !(p < 6)
[L692] 1 return ((void *)0);
[L695] COND FALSE 2 !(q < 6)
[L700] 2 return ((void *)0);
[L705] COND TRUE 0 x < 14
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=21, i=233, j=377, next=21, p=6, prev=13, q=6, x=7]
[L705] COND TRUE 0 x < 14
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=34, i=233, j=377, next=34, p=6, prev=21, q=6, x=8]
[L705] COND TRUE 0 x < 14
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=55, i=233, j=377, next=55, p=6, prev=34, q=6, x=9]
[L705] COND TRUE 0 x < 14
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=89, i=233, j=377, next=89, p=6, prev=55, q=6, x=10]
[L705] COND TRUE 0 x < 14
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=144, i=233, j=377, next=144, p=6, prev=89, q=6, x=11]
[L705] COND TRUE 0 x < 14
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=233, i=233, j=377, next=233, p=6, prev=144, q=6, x=12]
[L705] COND TRUE 0 x < 14
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=377, i=233, j=377, next=377, p=6, prev=233, q=6, x=13]
[L705] COND TRUE 0 x < 14
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=610, i=233, j=377, next=610, p=6, prev=377, q=6, x=14]
[L705] COND FALSE 0 !(x < 14)
[L710] 0 return prev;
[L722] RET, EXPR 0 fib()
[L722] 0 int correct = fib();
[L724] 0 _Bool assert_cond = i < correct && j < correct;
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=611, \old(argv)={612:613}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, argc=611, assert_cond=0, correct=377, cur=610, i=233, id1=-2, id2=-1, j=377, next=610, p=6, prev=377, q=6, x=14]
[L726] CALL 0 __VERIFIER_assert(assert_cond)
[L681] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=610, expression=0, i=233, j=377, next=610, p=6, prev=377, q=6, x=14]
[L681] 0 reach_error()
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=610, expression=0, i=233, j=377, next=610, p=6, prev=377, q=6, x=14]
- UnprovableResult [Line: 720]: 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: 721]: 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 for errors in thread instance: ULTIMATE.start with 1 thread instances
CFG has 5 procedures, 38 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 55, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 763 ConstructedInterpolants, 0 QuantifiedInterpolants, 1885 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1180 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 656/2014 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, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 0.0s, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0
RESULT: Ultimate proved your program to be incorrect!
[2024-10-17 02:53:53,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0
[2024-10-17 02:53:53,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE