./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -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/weaver/parallel-ticket-4.wvr.c -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 d87195cdf1d0fd4bcadf67f37be6f46388ea22a2ec77b383d012327e126a2173 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -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-19 04:27:31,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 04:27:31,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 04:27:31,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 04:27:31,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 04:27:31,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 04:27:31,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 04:27:31,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 04:27:31,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 04:27:31,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 04:27:31,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 04:27:31,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 04:27:31,124 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 04:27:31,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 04:27:31,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 04:27:31,126 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 04:27:31,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 04:27:31,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 04:27:31,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 04:27:31,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 04:27:31,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 04:27:31,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 04:27:31,131 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 04:27:31,132 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 04:27:31,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 04:27:31,132 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 04:27:31,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 04:27:31,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 04:27:31,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 04:27:31,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 04:27:31,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 04:27:31,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 04:27:31,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 04:27:31,135 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 04:27:31,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 04:27:31,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 04:27:31,136 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 04:27:31,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 04:27:31,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 04:27:31,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 04:27:31,137 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 04:27:31,138 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 -> d87195cdf1d0fd4bcadf67f37be6f46388ea22a2ec77b383d012327e126a2173 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 -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 04:27:31,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 04:27:31,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 04:27:31,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 04:27:31,428 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 04:27:31,428 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 04:27:31,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c [2024-10-19 04:27:32,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 04:27:33,085 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 04:27:33,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c [2024-10-19 04:27:33,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/89dd89e3d/8850ddee5db94ee29788b9902304850f/FLAG1e692b599 [2024-10-19 04:27:33,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/89dd89e3d/8850ddee5db94ee29788b9902304850f [2024-10-19 04:27:33,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 04:27:33,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 04:27:33,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 04:27:33,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 04:27:33,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 04:27:33,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 04:27:33" (1/1) ... [2024-10-19 04:27:33,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8f20f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:27:33, skipping insertion in model container [2024-10-19 04:27:33,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 04:27:33" (1/1) ... [2024-10-19 04:27:33,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 04:27:33,379 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c[3578,3591] [2024-10-19 04:27:33,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 04:27:33,401 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 04:27:33,436 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c[3578,3591] [2024-10-19 04:27:33,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 04:27:33,456 INFO L204 MainTranslator]: Completed translation [2024-10-19 04:27:33,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:27:33 WrapperNode [2024-10-19 04:27:33,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 04:27:33,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 04:27:33,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 04:27:33,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 04:27:33,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:27:33" (1/1) ... [2024-10-19 04:27:33,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:27:33" (1/1) ... [2024-10-19 04:27:33,510 INFO L138 Inliner]: procedures = 22, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-10-19 04:27:33,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 04:27:33,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 04:27:33,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 04:27:33,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 04:27:33,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:27:33" (1/1) ... [2024-10-19 04:27:33,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:27:33" (1/1) ... [2024-10-19 04:27:33,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:27:33" (1/1) ... [2024-10-19 04:27:33,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:27:33" (1/1) ... [2024-10-19 04:27:33,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:27:33" (1/1) ... [2024-10-19 04:27:33,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:27:33" (1/1) ... [2024-10-19 04:27:33,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:27:33" (1/1) ... [2024-10-19 04:27:33,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:27:33" (1/1) ... [2024-10-19 04:27:33,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 04:27:33,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 04:27:33,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 04:27:33,549 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 04:27:33,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:27:33" (1/1) ... [2024-10-19 04:27:33,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 04:27:33,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:27:33,584 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-19 04:27:33,587 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-19 04:27:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 04:27:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-19 04:27:33,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-19 04:27:33,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-19 04:27:33,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-19 04:27:33,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-19 04:27:33,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-19 04:27:33,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-19 04:27:33,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-19 04:27:33,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 04:27:33,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-19 04:27:33,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-19 04:27:33,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 04:27:33,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 04:27:33,635 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 04:27:33,738 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 04:27:33,744 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 04:27:34,052 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 04:27:34,052 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 04:27:34,294 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 04:27:34,296 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-19 04:27:34,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 04:27:34 BoogieIcfgContainer [2024-10-19 04:27:34,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 04:27:34,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 04:27:34,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 04:27:34,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 04:27:34,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 04:27:33" (1/3) ... [2024-10-19 04:27:34,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cc1a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 04:27:34, skipping insertion in model container [2024-10-19 04:27:34,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:27:33" (2/3) ... [2024-10-19 04:27:34,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cc1a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 04:27:34, skipping insertion in model container [2024-10-19 04:27:34,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 04:27:34" (3/3) ... [2024-10-19 04:27:34,309 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2024-10-19 04:27:34,324 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 04:27:34,324 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-19 04:27:34,324 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 04:27:34,377 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-19 04:27:34,429 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 04:27:34,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 04:27:34,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:27:34,433 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-19 04:27:34,435 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-19 04:27:34,533 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 04:27:34,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:27:34,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 04:27:34,564 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;@7122e77c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 04:27:34,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-19 04:27:35,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 04:27:35,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:27:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1023722523, now seen corresponding path program 1 times [2024-10-19 04:27:35,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:27:35,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048709128] [2024-10-19 04:27:35,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:35,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:36,818 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-19 04:27:36,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:27:36,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048709128] [2024-10-19 04:27:36,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048709128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 04:27:36,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 04:27:36,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-19 04:27:36,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184927693] [2024-10-19 04:27:36,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 04:27:36,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-19 04:27:36,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:27:36,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 04:27:36,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-19 04:27:36,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:27:36,857 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:27:36,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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-19 04:27:36,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:27:37,140 INFO L85 PathProgramCache]: Analyzing trace with hash -310278785, now seen corresponding path program 1 times [2024-10-19 04:27:37,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:37,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:37,279 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-19 04:27:37,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:37,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:37,365 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-19 04:27:37,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 04:27:37,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-19 04:27:37,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1739043674, now seen corresponding path program 1 times [2024-10-19 04:27:37,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:37,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:37,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:37,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1836006830, now seen corresponding path program 1 times [2024-10-19 04:27:37,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:37,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:37,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:38,127 INFO L85 PathProgramCache]: Analyzing trace with hash 849582489, now seen corresponding path program 1 times [2024-10-19 04:27:38,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:38,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:38,206 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-19 04:27:38,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:38,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:38,261 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-19 04:27:38,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 04:27:38,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-19 04:27:38,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1739043649, now seen corresponding path program 1 times [2024-10-19 04:27:38,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:38,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:38,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:38,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1836006807, now seen corresponding path program 1 times [2024-10-19 04:27:38,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:38,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:38,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:38,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1800523067, now seen corresponding path program 1 times [2024-10-19 04:27:38,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:38,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:38,856 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-19 04:27:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:38,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:38,934 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-19 04:27:38,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 04:27:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-10-19 04:27:39,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1739043610, now seen corresponding path program 1 times [2024-10-19 04:27:39,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:39,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:39,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:39,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1836006768, now seen corresponding path program 1 times [2024-10-19 04:27:39,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:39,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:39,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash -462963824, now seen corresponding path program 1 times [2024-10-19 04:27:39,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:39,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:39,615 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-19 04:27:39,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:39,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:39,675 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-19 04:27:39,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 04:27:39,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-10-19 04:27:39,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1836006720, now seen corresponding path program 1 times [2024-10-19 04:27:39,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:39,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:39,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:40,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1157000807, now seen corresponding path program 1 times [2024-10-19 04:27:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:40,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:40,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:40,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1815791, now seen corresponding path program 1 times [2024-10-19 04:27:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:40,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:40,476 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-19 04:27:40,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:40,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:40,533 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-19 04:27:40,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 04:27:40,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2024-10-19 04:27:40,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1836006667, now seen corresponding path program 1 times [2024-10-19 04:27:40,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:40,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:40,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:41,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1157000852, now seen corresponding path program 1 times [2024-10-19 04:27:41,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:41,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:41,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1589192456, now seen corresponding path program 1 times [2024-10-19 04:27:41,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:41,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:41,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:41,378 INFO L85 PathProgramCache]: Analyzing trace with hash -728804611, now seen corresponding path program 1 times [2024-10-19 04:27:41,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:41,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:41,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:41,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1296302550, now seen corresponding path program 1 times [2024-10-19 04:27:41,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:41,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:41,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:41,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1530683971, now seen corresponding path program 1 times [2024-10-19 04:27:41,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:41,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:41,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:41,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1530683968, now seen corresponding path program 1 times [2024-10-19 04:27:41,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:41,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:41,708 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-19 04:27:41,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:41,778 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-19 04:27:41,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 04:27:41,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2024-10-19 04:27:42,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1157000932, now seen corresponding path program 1 times [2024-10-19 04:27:42,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:42,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:42,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:42,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1589192522, now seen corresponding path program 1 times [2024-10-19 04:27:42,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:42,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:42,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:42,335 INFO L85 PathProgramCache]: Analyzing trace with hash -728804547, now seen corresponding path program 1 times [2024-10-19 04:27:42,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:42,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:42,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1296302492, now seen corresponding path program 1 times [2024-10-19 04:27:42,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:42,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:42,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1530683913, now seen corresponding path program 1 times [2024-10-19 04:27:42,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:42,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:43,177 INFO L85 PathProgramCache]: Analyzing trace with hash -918898169, now seen corresponding path program 1 times [2024-10-19 04:27:43,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:43,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:43,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:43,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1170609506, now seen corresponding path program 1 times [2024-10-19 04:27:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:43,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1929141023, now seen corresponding path program 1 times [2024-10-19 04:27:43,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:43,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:43,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1661617183, now seen corresponding path program 1 times [2024-10-19 04:27:43,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:43,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:43,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:43,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 04:27:43,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable0,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-10-19 04:27:43,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 04:27:43,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:27:43,626 INFO L85 PathProgramCache]: Analyzing trace with hash 173029533, now seen corresponding path program 2 times [2024-10-19 04:27:43,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:27:43,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227310173] [2024-10-19 04:27:43,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:43,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:43,714 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-19 04:27:43,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:27:43,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227310173] [2024-10-19 04:27:43,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227310173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 04:27:43,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 04:27:43,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-19 04:27:43,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556830263] [2024-10-19 04:27:43,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 04:27:43,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-19 04:27:43,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:27:43,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 04:27:43,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-19 04:27:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:27:43,720 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:27:43,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-19 04:27:43,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 04:27:43,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:27:44,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1170609625, now seen corresponding path program 1 times [2024-10-19 04:27:44,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:44,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:44,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1929141142, now seen corresponding path program 1 times [2024-10-19 04:27:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:44,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:44,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:44,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1249254013, now seen corresponding path program 1 times [2024-10-19 04:27:44,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:44,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:44,989 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-19 04:27:44,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:44,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:45,053 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-19 04:27:45,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 04:27:45,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2024-10-19 04:27:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 04:27:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:27:45,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-10-19 04:27:45,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 04:27:45,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:27:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash 528452173, now seen corresponding path program 3 times [2024-10-19 04:27:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:27:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855268856] [2024-10-19 04:27:45,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:46,048 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-19 04:27:46,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:27:46,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855268856] [2024-10-19 04:27:46,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855268856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 04:27:46,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 04:27:46,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-19 04:27:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495239435] [2024-10-19 04:27:46,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 04:27:46,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-19 04:27:46,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:27:46,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 04:27:46,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-19 04:27:46,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:27:46,051 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:27:46,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-19 04:27:46,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 04:27:46,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:27:46,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:27:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash -389760234, now seen corresponding path program 1 times [2024-10-19 04:27:46,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:46,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:46,923 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-19 04:27:46,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:46,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:46,954 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-19 04:27:46,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 04:27:46,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2024-10-19 04:27:48,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1169621300, now seen corresponding path program 1 times [2024-10-19 04:27:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:48,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:48,207 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-19 04:27:48,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:48,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:48,242 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-19 04:27:48,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 04:27:48,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2024-10-19 04:27:49,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 04:27:49,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:27:49,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:27:49,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45 [2024-10-19 04:27:49,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 04:27:49,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:27:49,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1589586771, now seen corresponding path program 4 times [2024-10-19 04:27:49,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:27:49,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661662755] [2024-10-19 04:27:49,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:49,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:49,175 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-19 04:27:49,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:27:49,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661662755] [2024-10-19 04:27:49,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661662755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 04:27:49,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 04:27:49,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-19 04:27:49,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624782458] [2024-10-19 04:27:49,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 04:27:49,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-19 04:27:49,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:27:49,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 04:27:49,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-19 04:27:49,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:27:49,177 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:27:49,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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-19 04:27:49,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 04:27:49,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:27:49,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:27:49,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:27:50,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1883215814, now seen corresponding path program 1 times [2024-10-19 04:27:50,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:50,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:50,350 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-19 04:27:50,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:50,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:50,402 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-19 04:27:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 04:27:50,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2024-10-19 04:27:52,348 INFO L85 PathProgramCache]: Analyzing trace with hash 706589169, now seen corresponding path program 1 times [2024-10-19 04:27:52,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:52,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:52,428 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-19 04:27:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:52,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:52,486 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-19 04:27:52,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 04:27:52,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2024-10-19 04:27:54,398 INFO L85 PathProgramCache]: Analyzing trace with hash -275702302, now seen corresponding path program 1 times [2024-10-19 04:27:54,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:54,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:54,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:54,839 INFO L85 PathProgramCache]: Analyzing trace with hash -314230899, now seen corresponding path program 1 times [2024-10-19 04:27:54,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:54,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:27:54,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:54,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:55,030 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-19 04:27:55,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 04:27:55,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1457, Unknown=0, NotChecked=0, Total=1640 [2024-10-19 04:27:56,458 INFO L85 PathProgramCache]: Analyzing trace with hash -275702036, now seen corresponding path program 1 times [2024-10-19 04:27:56,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:56,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:56,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:57,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1555611530, now seen corresponding path program 1 times [2024-10-19 04:27:57,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:57,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:57,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:57,121 INFO L85 PathProgramCache]: Analyzing trace with hash -391033459, now seen corresponding path program 1 times [2024-10-19 04:27:57,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:57,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:57,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:27:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:27:57,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1551171135, now seen corresponding path program 1 times [2024-10-19 04:27:57,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:57,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:57,884 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-19 04:27:57,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:27:57,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:27:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:27:57,939 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-19 04:27:57,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-19 04:27:57,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2024-10-19 04:28:00,339 INFO L85 PathProgramCache]: Analyzing trace with hash 353824342, now seen corresponding path program 1 times [2024-10-19 04:28:00,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:28:00,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:28:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:28:00,443 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-19 04:28:00,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:28:00,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:28:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:28:00,513 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-19 04:28:00,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-19 04:28:00,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2196, Unknown=0, NotChecked=0, Total=2450 [2024-10-19 04:28:02,693 INFO L85 PathProgramCache]: Analyzing trace with hash -666537763, now seen corresponding path program 1 times [2024-10-19 04:28:02,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:28:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:28:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:28:02,815 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-19 04:28:02,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:28:02,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:28:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:28:02,871 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-19 04:28:02,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-19 04:28:02,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=2673, Unknown=0, NotChecked=0, Total=2970 [2024-10-19 04:28:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 04:28:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:28:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 04:28:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 04:28:05,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-10-19 04:28:05,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-10-19 04:28:05,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-10-19 04:28:05,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-10-19 04:28:05,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-10-19 04:28:05,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,SelfDestructingSolverStorable50,SelfDestructingSolverStorable61,SelfDestructingSolverStorable51,SelfDestructingSolverStorable62,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable46,SelfDestructingSolverStorable57,SelfDestructingSolverStorable47,SelfDestructingSolverStorable58,SelfDestructingSolverStorable48,SelfDestructingSolverStorable59,SelfDestructingSolverStorable49 [2024-10-19 04:28:05,119 INFO L414 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 04:28:05,122 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-19 04:28:05,122 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-19 04:28:05,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.10 04:28:05 BasicIcfg [2024-10-19 04:28:05,125 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-19 04:28:05,126 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-19 04:28:05,126 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-19 04:28:05,126 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-19 04:28:05,126 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 04:27:34" (3/4) ... [2024-10-19 04:28:05,128 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-19 04:28:05,131 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-19 04:28:05,132 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-19 04:28:05,132 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-19 04:28:05,132 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-10-19 04:28:05,136 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 85 nodes and edges [2024-10-19 04:28:05,137 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-19 04:28:05,137 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-19 04:28:05,137 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-19 04:28:05,227 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-10-19 04:28:05,228 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2024-10-19 04:28:05,228 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-19 04:28:05,228 INFO L158 Benchmark]: Toolchain (without parser) took 32116.76ms. Allocated memory was 151.0MB in the beginning and 658.5MB in the end (delta: 507.5MB). Free memory was 96.4MB in the beginning and 532.2MB in the end (delta: -435.8MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. [2024-10-19 04:28:05,228 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 151.0MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 04:28:05,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.20ms. Allocated memory is still 151.0MB. Free memory was 96.4MB in the beginning and 83.1MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-19 04:28:05,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.60ms. Allocated memory is still 151.0MB. Free memory was 83.1MB in the beginning and 81.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 04:28:05,229 INFO L158 Benchmark]: Boogie Preprocessor took 36.96ms. Allocated memory is still 151.0MB. Free memory was 81.0MB in the beginning and 79.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 04:28:05,229 INFO L158 Benchmark]: RCFGBuilder took 748.46ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 79.2MB in the beginning and 136.4MB in the end (delta: -57.2MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-10-19 04:28:05,229 INFO L158 Benchmark]: TraceAbstraction took 30825.49ms. Allocated memory was 195.0MB in the beginning and 658.5MB in the end (delta: 463.5MB). Free memory was 135.4MB in the beginning and 537.4MB in the end (delta: -402.1MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2024-10-19 04:28:05,230 INFO L158 Benchmark]: Witness Printer took 102.14ms. Allocated memory is still 658.5MB. Free memory was 537.4MB in the beginning and 532.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-19 04:28:05,231 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.21ms. Allocated memory is still 151.0MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.20ms. Allocated memory is still 151.0MB. Free memory was 96.4MB in the beginning and 83.1MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.60ms. Allocated memory is still 151.0MB. Free memory was 83.1MB in the beginning and 81.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.96ms. Allocated memory is still 151.0MB. Free memory was 81.0MB in the beginning and 79.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 748.46ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 79.2MB in the beginning and 136.4MB in the end (delta: -57.2MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * TraceAbstraction took 30825.49ms. Allocated memory was 195.0MB in the beginning and 658.5MB in the end (delta: 463.5MB). Free memory was 135.4MB in the beginning and 537.4MB in the end (delta: -402.1MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. * Witness Printer took 102.14ms. Allocated memory is still 658.5MB. Free memory was 537.4MB in the beginning and 532.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 139546, independent: 137019, independent conditional: 135822, independent unconditional: 1197, dependent: 2527, dependent conditional: 2486, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 139546, independent: 137019, independent conditional: 135822, independent unconditional: 1197, dependent: 2527, dependent conditional: 2486, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 139546, independent: 137019, independent conditional: 135822, independent unconditional: 1197, dependent: 2527, dependent conditional: 2486, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 139546, independent: 137019, independent conditional: 135822, independent unconditional: 1197, dependent: 2527, dependent conditional: 2486, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163260, independent: 137019, independent conditional: 135822, independent unconditional: 1197, dependent: 26241, dependent conditional: 26159, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163260, independent: 137019, independent conditional: 33950, independent unconditional: 103069, dependent: 26241, dependent conditional: 21135, dependent unconditional: 5106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163260, independent: 137019, independent conditional: 33950, independent unconditional: 103069, dependent: 26241, dependent conditional: 21135, dependent unconditional: 5106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2837, independent: 1404, independent conditional: 232, independent unconditional: 1172, dependent: 1433, dependent conditional: 1391, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2837, independent: 1221, independent conditional: 0, independent unconditional: 1221, dependent: 1616, dependent conditional: 0, dependent unconditional: 1616, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1616, independent: 183, independent conditional: 150, independent unconditional: 33, dependent: 1433, dependent conditional: 1391, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1616, independent: 183, independent conditional: 150, independent unconditional: 33, dependent: 1433, dependent conditional: 1391, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16834, independent: 1988, independent conditional: 1336, independent unconditional: 652, dependent: 14846, dependent conditional: 13784, dependent unconditional: 1062, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 163260, independent: 135615, independent conditional: 33718, independent unconditional: 101897, dependent: 24808, dependent conditional: 19744, dependent unconditional: 5064, unknown: 2837, unknown conditional: 1623, unknown unconditional: 1214] , Statistics on independence cache: Total cache size (in pairs): 2837, Positive cache size: 1404, Positive conditional cache size: 232, Positive unconditional cache size: 1172, Negative cache size: 1433, Negative conditional cache size: 1391, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 106896, Maximal queried relation: 19, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163260, independent: 137019, independent conditional: 135822, independent unconditional: 1197, dependent: 26241, dependent conditional: 26159, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163260, independent: 137019, independent conditional: 33950, independent unconditional: 103069, dependent: 26241, dependent conditional: 21135, dependent unconditional: 5106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163260, independent: 137019, independent conditional: 33950, independent unconditional: 103069, dependent: 26241, dependent conditional: 21135, dependent unconditional: 5106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2837, independent: 1404, independent conditional: 232, independent unconditional: 1172, dependent: 1433, dependent conditional: 1391, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2837, independent: 1221, independent conditional: 0, independent unconditional: 1221, dependent: 1616, dependent conditional: 0, dependent unconditional: 1616, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1616, independent: 183, independent conditional: 150, independent unconditional: 33, dependent: 1433, dependent conditional: 1391, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1616, independent: 183, independent conditional: 150, independent unconditional: 33, dependent: 1433, dependent conditional: 1391, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16834, independent: 1988, independent conditional: 1336, independent unconditional: 652, dependent: 14846, dependent conditional: 13784, dependent unconditional: 1062, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 163260, independent: 135615, independent conditional: 33718, independent unconditional: 101897, dependent: 24808, dependent conditional: 19744, dependent unconditional: 5064, unknown: 2837, unknown conditional: 1623, unknown unconditional: 1214] , Statistics on independence cache: Total cache size (in pairs): 2837, Positive cache size: 1404, Positive conditional cache size: 232, Positive unconditional cache size: 1172, Negative cache size: 1433, Negative conditional cache size: 1391, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 106896 ], Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 1.9s, Number of persistent set computation: 1713, Number of trivial persistent sets: 787, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1213, independent: 1172, independent conditional: 0, independent unconditional: 1172, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 139546, independent: 137019, independent conditional: 135822, independent unconditional: 1197, dependent: 2527, dependent conditional: 2486, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 139546, independent: 137019, independent conditional: 135822, independent unconditional: 1197, dependent: 2527, dependent conditional: 2486, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 139546, independent: 137019, independent conditional: 135822, independent unconditional: 1197, dependent: 2527, dependent conditional: 2486, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 139546, independent: 137019, independent conditional: 135822, independent unconditional: 1197, dependent: 2527, dependent conditional: 2486, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163260, independent: 137019, independent conditional: 135822, independent unconditional: 1197, dependent: 26241, dependent conditional: 26159, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163260, independent: 137019, independent conditional: 33950, independent unconditional: 103069, dependent: 26241, dependent conditional: 21135, dependent unconditional: 5106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163260, independent: 137019, independent conditional: 33950, independent unconditional: 103069, dependent: 26241, dependent conditional: 21135, dependent unconditional: 5106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2837, independent: 1404, independent conditional: 232, independent unconditional: 1172, dependent: 1433, dependent conditional: 1391, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2837, independent: 1221, independent conditional: 0, independent unconditional: 1221, dependent: 1616, dependent conditional: 0, dependent unconditional: 1616, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1616, independent: 183, independent conditional: 150, independent unconditional: 33, dependent: 1433, dependent conditional: 1391, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1616, independent: 183, independent conditional: 150, independent unconditional: 33, dependent: 1433, dependent conditional: 1391, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16834, independent: 1988, independent conditional: 1336, independent unconditional: 652, dependent: 14846, dependent conditional: 13784, dependent unconditional: 1062, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 163260, independent: 135615, independent conditional: 33718, independent unconditional: 101897, dependent: 24808, dependent conditional: 19744, dependent unconditional: 5064, unknown: 2837, unknown conditional: 1623, unknown unconditional: 1214] , Statistics on independence cache: Total cache size (in pairs): 2837, Positive cache size: 1404, Positive conditional cache size: 232, Positive unconditional cache size: 1172, Negative cache size: 1433, Negative conditional cache size: 1391, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 106896, Maximal queried relation: 19, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163260, independent: 137019, independent conditional: 135822, independent unconditional: 1197, dependent: 26241, dependent conditional: 26159, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163260, independent: 137019, independent conditional: 33950, independent unconditional: 103069, dependent: 26241, dependent conditional: 21135, dependent unconditional: 5106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163260, independent: 137019, independent conditional: 33950, independent unconditional: 103069, dependent: 26241, dependent conditional: 21135, dependent unconditional: 5106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2837, independent: 1404, independent conditional: 232, independent unconditional: 1172, dependent: 1433, dependent conditional: 1391, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2837, independent: 1221, independent conditional: 0, independent unconditional: 1221, dependent: 1616, dependent conditional: 0, dependent unconditional: 1616, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1616, independent: 183, independent conditional: 150, independent unconditional: 33, dependent: 1433, dependent conditional: 1391, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1616, independent: 183, independent conditional: 150, independent unconditional: 33, dependent: 1433, dependent conditional: 1391, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16834, independent: 1988, independent conditional: 1336, independent unconditional: 652, dependent: 14846, dependent conditional: 13784, dependent unconditional: 1062, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 163260, independent: 135615, independent conditional: 33718, independent unconditional: 101897, dependent: 24808, dependent conditional: 19744, dependent unconditional: 5064, unknown: 2837, unknown conditional: 1623, unknown unconditional: 1214] , Statistics on independence cache: Total cache size (in pairs): 2837, Positive cache size: 1404, Positive conditional cache size: 232, Positive unconditional cache size: 1172, Negative cache size: 1433, Negative conditional cache size: 1391, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 106896 ], Independence queries for same thread: 0 - PositiveResult [Line: 146]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 79 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 30.6s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 29.3s, 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: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 716 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 0.0s, ConditionalCommutativityCheckTime: 18.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 15, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 74, ConditionalCommutativityTraceChecks: 44, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-19 04:28:05,260 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-19 04:28:05,463 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 Result: TRUE