./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 01849734 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.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 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-0184973-m [2025-04-24 17:47:29,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 17:47:29,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 17:47:29,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 17:47:29,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 17:47:29,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 17:47:29,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 17:47:29,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 17:47:29,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 17:47:29,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 17:47:29,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 17:47:29,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 17:47:29,669 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 17:47:29,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 17:47:29,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 17:47:29,669 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 17:47:29,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 17:47:29,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 17:47:29,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 17:47:29,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 17:47:29,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 17:47:29,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 17:47:29,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 17:47:29,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 17:47:29,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 17:47:29,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 17:47:29,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 17:47:29,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 17:47:29,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 17:47:29,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 17:47:29,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:47:29,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 17:47:29,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 17:47:29,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 17:47:29,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 17:47:29,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:47:29,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 17:47:29,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 17:47:29,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 17:47:29,673 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 17:47:29,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 17:47:29,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 17:47:29,673 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 17:47:29,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 17:47:29,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 17:47:29,674 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 17:47:29,674 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 17:47:29,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 [2025-04-24 17:47:29,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 17:47:29,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 17:47:29,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 17:47:29,940 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 17:47:29,941 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 17:47:29,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-04-24 17:47:31,182 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e19a65c6c/f3f791083fa34f0bb5c2bf3801d3cb56/FLAG91bbdb4ae [2025-04-24 17:47:31,333 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 17:47:31,334 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-04-24 17:47:31,341 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e19a65c6c/f3f791083fa34f0bb5c2bf3801d3cb56/FLAG91bbdb4ae [2025-04-24 17:47:32,383 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e19a65c6c/f3f791083fa34f0bb5c2bf3801d3cb56 [2025-04-24 17:47:32,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 17:47:32,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 17:47:32,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 17:47:32,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 17:47:32,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 17:47:32,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 05:47:32" (1/1) ... [2025-04-24 17:47:32,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36beb1ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32, skipping insertion in model container [2025-04-24 17:47:32,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 05:47:32" (1/1) ... [2025-04-24 17:47:32,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 17:47:32,535 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c[2996,3009] [2025-04-24 17:47:32,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 17:47:32,557 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 17:47:32,587 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c[2996,3009] [2025-04-24 17:47:32,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 17:47:32,598 INFO L204 MainTranslator]: Completed translation [2025-04-24 17:47:32,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32 WrapperNode [2025-04-24 17:47:32,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 17:47:32,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 17:47:32,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 17:47:32,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 17:47:32,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32" (1/1) ... [2025-04-24 17:47:32,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32" (1/1) ... [2025-04-24 17:47:32,627 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-04-24 17:47:32,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 17:47:32,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 17:47:32,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 17:47:32,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 17:47:32,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32" (1/1) ... [2025-04-24 17:47:32,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32" (1/1) ... [2025-04-24 17:47:32,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32" (1/1) ... [2025-04-24 17:47:32,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32" (1/1) ... [2025-04-24 17:47:32,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32" (1/1) ... [2025-04-24 17:47:32,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32" (1/1) ... [2025-04-24 17:47:32,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32" (1/1) ... [2025-04-24 17:47:32,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32" (1/1) ... [2025-04-24 17:47:32,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32" (1/1) ... [2025-04-24 17:47:32,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 17:47:32,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 17:47:32,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 17:47:32,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 17:47:32,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32" (1/1) ... [2025-04-24 17:47:32,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:47:32,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:47:32,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-24 17:47:32,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-24 17:47:32,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 17:47:32,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-24 17:47:32,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-24 17:47:32,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-24 17:47:32,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-24 17:47:32,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-24 17:47:32,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-24 17:47:32,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 17:47:32,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-24 17:47:32,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-24 17:47:32,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 17:47:32,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 17:47:32,713 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 17:47:32,778 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 17:47:32,779 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 17:47:32,940 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 17:47:32,940 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 17:47:33,071 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 17:47:33,071 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 17:47:33,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 05:47:33 BoogieIcfgContainer [2025-04-24 17:47:33,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 17:47:33,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 17:47:33,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 17:47:33,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 17:47:33,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 05:47:32" (1/3) ... [2025-04-24 17:47:33,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670ab3c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 05:47:33, skipping insertion in model container [2025-04-24 17:47:33,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:32" (2/3) ... [2025-04-24 17:47:33,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670ab3c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 05:47:33, skipping insertion in model container [2025-04-24 17:47:33,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 05:47:33" (3/3) ... [2025-04-24 17:47:33,081 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2025-04-24 17:47:33,090 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 17:47:33,092 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-threaded-sum-3.wvr.c that has 4 procedures, 33 locations, 32 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-24 17:47:33,092 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 17:47:33,131 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-24 17:47:33,155 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 17:47:33,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 17:47:33,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:47:33,158 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) [2025-04-24 17:47:33,159 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 [2025-04-24 17:47:33,215 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 17:47:33,225 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 17:47:33,230 INFO L340 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;@52346223, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 17:47:33,230 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-24 17:47:33,406 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 17:47:33,406 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:33,406 INFO L139 ounterexampleChecker]: Examining path program with hash 1958280314, occurence #1 [2025-04-24 17:47:33,406 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:47:33,406 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:33,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:33,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1844757762, now seen corresponding path program 1 times [2025-04-24 17:47:33,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:33,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788091270] [2025-04-24 17:47:33,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:47:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:33,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-24 17:47:33,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-24 17:47:33,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:47:33,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:47:36,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:36,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788091270] [2025-04-24 17:47:36,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788091270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:47:36,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:47:36,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-24 17:47:36,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743562105] [2025-04-24 17:47:36,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:47:36,619 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-24 17:47:36,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:36,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-24 17:47:36,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-24 17:47:36,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:36,639 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:36,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 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) [2025-04-24 17:47:36,642 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:38,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:38,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 17:47:38,046 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 17:47:38,046 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:38,047 INFO L139 ounterexampleChecker]: Examining path program with hash -1087463001, occurence #1 [2025-04-24 17:47:38,047 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:47:38,047 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:38,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:38,047 INFO L85 PathProgramCache]: Analyzing trace with hash -323692154, now seen corresponding path program 2 times [2025-04-24 17:47:38,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:38,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892114051] [2025-04-24 17:47:38,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 17:47:38,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:38,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 126 statements into 2 equivalence classes. [2025-04-24 17:47:38,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 126 of 126 statements. [2025-04-24 17:47:38,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 17:47:38,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-04-24 17:47:38,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:38,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892114051] [2025-04-24 17:47:38,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892114051] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:47:38,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080487098] [2025-04-24 17:47:38,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 17:47:38,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:47:38,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:47:38,613 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:47:38,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-24 17:47:38,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 126 statements into 2 equivalence classes. [2025-04-24 17:47:38,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 126 of 126 statements. [2025-04-24 17:47:38,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 17:47:38,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:38,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-24 17:47:38,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:47:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-04-24 17:47:38,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:47:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-04-24 17:47:39,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080487098] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:47:39,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 17:47:39,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-04-24 17:47:39,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398827064] [2025-04-24 17:47:39,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 17:47:39,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-24 17:47:39,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:39,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-24 17:47:39,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-24 17:47:39,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:39,019 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:39,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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) [2025-04-24 17:47:39,019 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:39,019 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:39,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:39,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-24 17:47:39,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-24 17:47:39,511 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-24 17:47:39,511 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 17:47:39,511 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:39,511 INFO L139 ounterexampleChecker]: Examining path program with hash 904978570, occurence #1 [2025-04-24 17:47:39,511 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:47:39,511 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:39,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:39,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1664434872, now seen corresponding path program 3 times [2025-04-24 17:47:39,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:39,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021468972] [2025-04-24 17:47:39,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 17:47:39,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:39,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 5 equivalence classes. [2025-04-24 17:47:39,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 109 statements. [2025-04-24 17:47:39,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-24 17:47:39,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-04-24 17:47:39,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:39,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021468972] [2025-04-24 17:47:39,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021468972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:47:39,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:47:39,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 17:47:39,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051276405] [2025-04-24 17:47:39,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:47:39,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 17:47:39,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:39,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 17:47:39,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-24 17:47:39,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:39,683 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:39,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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) [2025-04-24 17:47:39,683 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:39,683 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-24 17:47:39,683 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:39,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:39,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-24 17:47:39,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:39,840 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-24 17:47:39,840 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 17:47:39,840 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:39,840 INFO L139 ounterexampleChecker]: Examining path program with hash -1947848553, occurence #1 [2025-04-24 17:47:39,841 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:47:39,841 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:39,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:39,841 INFO L85 PathProgramCache]: Analyzing trace with hash 117212384, now seen corresponding path program 4 times [2025-04-24 17:47:39,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:39,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905124609] [2025-04-24 17:47:39,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 17:47:39,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:39,853 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 146 statements into 2 equivalence classes. [2025-04-24 17:47:39,980 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 146 of 146 statements. [2025-04-24 17:47:39,981 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 17:47:39,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-04-24 17:47:40,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:40,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905124609] [2025-04-24 17:47:40,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905124609] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:47:40,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:47:40,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-24 17:47:40,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023907967] [2025-04-24 17:47:40,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:47:40,399 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 17:47:40,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:40,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 17:47:40,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-24 17:47:40,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:40,400 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:40,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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) [2025-04-24 17:47:40,400 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:40,400 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-24 17:47:40,400 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:40,400 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:40,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:40,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-24 17:47:40,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:40,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:47:40,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-24 17:47:40,686 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 17:47:40,686 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:40,687 INFO L139 ounterexampleChecker]: Examining path program with hash 97524000, occurence #1 [2025-04-24 17:47:40,687 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:47:40,687 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:40,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1512702384, now seen corresponding path program 5 times [2025-04-24 17:47:40,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:40,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790769789] [2025-04-24 17:47:40,688 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-24 17:47:40,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:40,705 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 246 statements into 9 equivalence classes. [2025-04-24 17:47:41,533 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 246 of 246 statements. [2025-04-24 17:47:41,533 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-04-24 17:47:41,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2025-04-24 17:47:42,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:42,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790769789] [2025-04-24 17:47:42,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790769789] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:47:42,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:47:42,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-24 17:47:42,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178693760] [2025-04-24 17:47:42,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:47:42,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 17:47:42,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:42,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 17:47:42,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-24 17:47:42,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:42,336 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:42,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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) [2025-04-24 17:47:42,336 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:42,336 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-24 17:47:42,336 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:42,336 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:47:42,336 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:42,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:42,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-24 17:47:42,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:42,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:47:42,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:47:42,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-24 17:47:42,555 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 17:47:42,556 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:42,556 INFO L139 ounterexampleChecker]: Examining path program with hash 1198902059, occurence #1 [2025-04-24 17:47:42,556 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:47:42,556 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:42,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:42,556 INFO L85 PathProgramCache]: Analyzing trace with hash -503186005, now seen corresponding path program 6 times [2025-04-24 17:47:42,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:42,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176261964] [2025-04-24 17:47:42,556 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-24 17:47:42,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:42,570 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 224 statements into 9 equivalence classes. [2025-04-24 17:47:42,585 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 67 of 224 statements. [2025-04-24 17:47:42,585 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-24 17:47:42,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-04-24 17:47:42,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:42,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176261964] [2025-04-24 17:47:42,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176261964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:47:42,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:47:42,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 17:47:42,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352715784] [2025-04-24 17:47:42,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:47:42,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 17:47:42,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:42,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 17:47:42,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-24 17:47:42,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:42,755 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:42,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) [2025-04-24 17:47:42,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:42,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-24 17:47:42,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:42,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:47:42,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:47:42,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:42,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:42,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-24 17:47:42,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:42,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:47:42,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:47:42,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:47:42,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-24 17:47:42,932 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 17:47:42,932 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:42,933 INFO L139 ounterexampleChecker]: Examining path program with hash -276850822, occurence #1 [2025-04-24 17:47:42,933 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:47:42,933 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:42,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:42,933 INFO L85 PathProgramCache]: Analyzing trace with hash 734508718, now seen corresponding path program 7 times [2025-04-24 17:47:42,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:42,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757503909] [2025-04-24 17:47:42,933 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-24 17:47:42,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:42,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-04-24 17:47:43,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-04-24 17:47:43,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:47:43,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-04-24 17:47:43,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:43,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757503909] [2025-04-24 17:47:43,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757503909] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:47:43,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:47:43,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 17:47:43,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787457553] [2025-04-24 17:47:43,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:47:43,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 17:47:43,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:43,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 17:47:43,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-24 17:47:43,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:43,560 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:43,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) 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) [2025-04-24 17:47:43,560 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:43,560 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-24 17:47:43,560 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:43,560 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:47:43,560 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:47:43,560 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:47:43,560 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:43,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:43,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-24 17:47:43,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:43,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:47:43,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:47:43,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:47:43,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:43,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-24 17:47:43,707 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 17:47:43,707 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:43,707 INFO L139 ounterexampleChecker]: Examining path program with hash 231683641, occurence #1 [2025-04-24 17:47:43,707 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:47:43,708 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:43,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1369837689, now seen corresponding path program 8 times [2025-04-24 17:47:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:43,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395339353] [2025-04-24 17:47:43,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 17:47:43,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:43,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 294 statements into 2 equivalence classes. [2025-04-24 17:47:43,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 294 statements. [2025-04-24 17:47:43,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 17:47:43,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2025-04-24 17:47:43,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:43,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395339353] [2025-04-24 17:47:43,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395339353] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:47:43,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:47:43,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 17:47:43,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20757029] [2025-04-24 17:47:43,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:47:43,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 17:47:43,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:43,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 17:47:43,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-24 17:47:43,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:43,848 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:43,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) [2025-04-24 17:47:43,848 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:43,848 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-24 17:47:43,848 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:43,848 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:47:43,848 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:47:43,848 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:47:43,848 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:43,848 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:44,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:47:44,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-24 17:47:44,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:44,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:47:44,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:47:44,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:47:44,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:44,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:44,410 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-24 17:47:44,410 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 17:47:44,410 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:44,411 INFO L139 ounterexampleChecker]: Examining path program with hash -1173322635, occurence #1 [2025-04-24 17:47:44,411 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:47:44,411 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:44,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:44,412 INFO L85 PathProgramCache]: Analyzing trace with hash 183081680, now seen corresponding path program 9 times [2025-04-24 17:47:44,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:44,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417965002] [2025-04-24 17:47:44,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 17:47:44,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:44,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 764 statements into 16 equivalence classes. [2025-04-24 17:47:44,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 163 of 764 statements. [2025-04-24 17:47:44,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-24 17:47:44,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:48:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4059 backedges. 529 proven. 12 refuted. 0 times theorem prover too weak. 3518 trivial. 0 not checked. [2025-04-24 17:48:24,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:48:24,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417965002] [2025-04-24 17:48:24,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417965002] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:48:24,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640549018] [2025-04-24 17:48:24,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 17:48:24,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:48:24,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:48:24,105 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:48:24,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-24 17:48:24,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 764 statements into 16 equivalence classes. [2025-04-24 17:48:24,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 163 of 764 statements. [2025-04-24 17:48:24,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-24 17:48:24,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:48:24,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-24 17:48:24,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:51:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4059 backedges. 216 proven. 25 refuted. 2 times theorem prover too weak. 3816 trivial. 0 not checked. [2025-04-24 17:51:20,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:51:28,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4059 backedges. 209 proven. 19 refuted. 0 times theorem prover too weak. 3831 trivial. 0 not checked. [2025-04-24 17:51:28,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640549018] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:51:28,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 17:51:28,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 21] total 69 [2025-04-24 17:51:28,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371450679] [2025-04-24 17:51:28,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 17:51:28,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-04-24 17:51:28,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:51:28,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-04-24 17:51:28,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=4138, Unknown=42, NotChecked=0, Total=4692 [2025-04-24 17:51:28,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:51:28,363 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:51:28,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 3.1739130434782608) internal successors, (219), 69 states have internal predecessors, (219), 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) [2025-04-24 17:51:28,364 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2025-04-24 17:51:28,364 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-24 17:51:28,364 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:51:28,364 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:51:28,364 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:51:28,364 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:51:28,364 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:51:28,364 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:51:28,364 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:51:35,033 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:51:43,151 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:51:47,161 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:51:51,196 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:51:55,214 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:51:59,239 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:52:03,251 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:52:11,887 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:52:15,899 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:52:19,910 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:52:23,928 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:52:27,958 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:52:31,974 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:52:45,077 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:52:49,104 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:52:53,866 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:52:57,902 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:53:00,994 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:53:02,748 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:53:02,769 WARN L330 ript$VariableManager]: TermVariable v_y_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:53:02,770 WARN L330 ript$VariableManager]: TermVariable v_z_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:53:02,774 WARN L330 ript$VariableManager]: TermVariable v_y_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:53:02,774 WARN L330 ript$VariableManager]: TermVariable v_z_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:53:02,777 WARN L330 ript$VariableManager]: TermVariable v_y_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:53:02,777 WARN L330 ript$VariableManager]: TermVariable v_z_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:53:02,969 WARN L330 ript$VariableManager]: TermVariable v_y_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:53:02,969 WARN L330 ript$VariableManager]: TermVariable v_z_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:53:05,950 WARN L330 ript$VariableManager]: TermVariable v_y_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:53:05,951 WARN L330 ript$VariableManager]: TermVariable v_z_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:53:05,956 WARN L330 ript$VariableManager]: TermVariable v_y_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:53:05,957 WARN L330 ript$VariableManager]: TermVariable v_z_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:53:09,725 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:53:21,892 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 26 DAG size of output: 23 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 17:53:24,407 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:53:44,006 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 24 DAG size of output: 21 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 17:54:01,031 WARN L286 SmtUtils]: Spent 16.10s on a formula simplification. DAG size of input: 62 DAG size of output: 59 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 17:54:13,137 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 29 DAG size of output: 25 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 17:54:25,640 WARN L286 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 60 DAG size of output: 57 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 17:54:25,696 WARN L330 ript$VariableManager]: TermVariable v_y_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:54:25,696 WARN L330 ript$VariableManager]: TermVariable v_z_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:54:25,699 WARN L330 ript$VariableManager]: TermVariable v_y_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:54:25,699 WARN L330 ript$VariableManager]: TermVariable v_z_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:54:25,901 WARN L330 ript$VariableManager]: TermVariable v_y_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:54:25,902 WARN L330 ript$VariableManager]: TermVariable v_z_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:54:29,111 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:54:41,298 WARN L286 SmtUtils]: Spent 8.00s on a formula simplification. DAG size of input: 60 DAG size of output: 45 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 17:54:48,197 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:55:28,110 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:55:32,367 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:55:36,385 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:55:40,470 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:55:53,715 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:55:58,626 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:56:05,428 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:56:06,772 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:56:12,360 WARN L330 ript$VariableManager]: TermVariable v_y_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:56:12,360 WARN L330 ript$VariableManager]: TermVariable v_z_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:56:12,366 WARN L330 ript$VariableManager]: TermVariable v_y_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:56:12,366 WARN L330 ript$VariableManager]: TermVariable v_z_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:56:12,370 WARN L330 ript$VariableManager]: TermVariable v_y_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:56:12,371 WARN L330 ript$VariableManager]: TermVariable v_z_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:56:16,579 WARN L330 ript$VariableManager]: TermVariable v_y_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:56:16,579 WARN L330 ript$VariableManager]: TermVariable v_z_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-24 17:56:18,473 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-24 17:56:32,425 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:56:40,819 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:56:45,075 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:56:49,384 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:56:53,456 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:56:57,467 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 17:57:01,477 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []