./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 44c38e66 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/parallel-misc-2.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 c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-44c38e6-m [2025-04-24 19:53:32,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 19:53:32,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 19:53:32,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 19:53:32,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 19:53:32,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 19:53:32,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 19:53:32,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 19:53:32,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 19:53:32,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 19:53:32,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 19:53:32,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 19:53:32,575 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 19:53:32,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 19:53:32,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 19:53:32,576 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 19:53:32,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 19:53:32,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 19:53:32,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 19:53:32,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 19:53:32,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 19:53:32,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 19:53:32,576 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 19:53:32,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 19:53:32,576 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 19:53:32,576 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 19:53:32,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 19:53:32,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 19:53:32,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 19:53:32,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 19:53:32,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 19:53:32,577 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 19:53:32,577 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 -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf [2025-04-24 19:53:32,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 19:53:32,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 19:53:32,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 19:53:32,827 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 19:53:32,827 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 19:53:32,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-04-24 19:53:34,089 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/722a1d787/c646ab118516485da9109c25ac323cfc/FLAG48f8855d3 [2025-04-24 19:53:34,320 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 19:53:34,320 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-04-24 19:53:34,332 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/722a1d787/c646ab118516485da9109c25ac323cfc/FLAG48f8855d3 [2025-04-24 19:53:35,140 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/722a1d787/c646ab118516485da9109c25ac323cfc [2025-04-24 19:53:35,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 19:53:35,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 19:53:35,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 19:53:35,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 19:53:35,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 19:53:35,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 07:53:35" (1/1) ... [2025-04-24 19:53:35,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5abc6ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35, skipping insertion in model container [2025-04-24 19:53:35,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 07:53:35" (1/1) ... [2025-04-24 19:53:35,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 19:53:35,327 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/parallel-misc-2.wvr.c[2249,2262] [2025-04-24 19:53:35,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 19:53:35,339 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 19:53:35,370 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/parallel-misc-2.wvr.c[2249,2262] [2025-04-24 19:53:35,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 19:53:35,386 INFO L204 MainTranslator]: Completed translation [2025-04-24 19:53:35,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35 WrapperNode [2025-04-24 19:53:35,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 19:53:35,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 19:53:35,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 19:53:35,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 19:53:35,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35" (1/1) ... [2025-04-24 19:53:35,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35" (1/1) ... [2025-04-24 19:53:35,416 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-04-24 19:53:35,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 19:53:35,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 19:53:35,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 19:53:35,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 19:53:35,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35" (1/1) ... [2025-04-24 19:53:35,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35" (1/1) ... [2025-04-24 19:53:35,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35" (1/1) ... [2025-04-24 19:53:35,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35" (1/1) ... [2025-04-24 19:53:35,429 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35" (1/1) ... [2025-04-24 19:53:35,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35" (1/1) ... [2025-04-24 19:53:35,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35" (1/1) ... [2025-04-24 19:53:35,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35" (1/1) ... [2025-04-24 19:53:35,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35" (1/1) ... [2025-04-24 19:53:35,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 19:53:35,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 19:53:35,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 19:53:35,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 19:53:35,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35" (1/1) ... [2025-04-24 19:53:35,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 19:53:35,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 19:53:35,474 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 19:53:35,476 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 19:53:35,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 19:53:35,492 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-24 19:53:35,492 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-24 19:53:35,492 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-24 19:53:35,492 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-24 19:53:35,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 19:53:35,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 19:53:35,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 19:53:35,493 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 19:53:35,561 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 19:53:35,562 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 19:53:35,733 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 19:53:35,733 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 19:53:35,824 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 19:53:35,825 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 19:53:35,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 07:53:35 BoogieIcfgContainer [2025-04-24 19:53:35,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 19:53:35,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 19:53:35,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 19:53:35,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 19:53:35,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 07:53:35" (1/3) ... [2025-04-24 19:53:35,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8d84b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 07:53:35, skipping insertion in model container [2025-04-24 19:53:35,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:53:35" (2/3) ... [2025-04-24 19:53:35,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8d84b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 07:53:35, skipping insertion in model container [2025-04-24 19:53:35,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 07:53:35" (3/3) ... [2025-04-24 19:53:35,832 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-04-24 19:53:35,841 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 19:53:35,843 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 29 locations, 30 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-24 19:53:35,844 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 19:53:35,889 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-24 19:53:35,925 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:53:35,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 19:53:35,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 19:53:35,928 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 19:53:35,930 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 19:53:35,985 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:53:36,000 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:53:36,006 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;@2ca1fd16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:53:36,006 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-24 19:53:36,225 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:53:36,225 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:53:36,226 INFO L139 ounterexampleChecker]: Examining path program with hash -1112909302, occurence #1 [2025-04-24 19:53:36,226 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:53:36,226 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:53:36,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:53:36,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1464225346, now seen corresponding path program 1 times [2025-04-24 19:53:36,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:53:36,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824022366] [2025-04-24 19:53:36,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:53:36,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:53:36,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-24 19:53:36,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-24 19:53:36,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:53:36,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:53:36,568 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 19:53:36,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:53:36,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824022366] [2025-04-24 19:53:36,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824022366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:53:36,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:53:36,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 19:53:36,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280602946] [2025-04-24 19:53:36,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:53:36,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:53:36,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:53:36,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:53:36,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:53:36,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:53:36,591 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:53:36,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 19:53:36,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:53:36,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 19:53:36,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 19:53:36,674 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:53:36,675 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:53:36,675 INFO L139 ounterexampleChecker]: Examining path program with hash -687417324, occurence #1 [2025-04-24 19:53:36,675 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:53:36,675 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:53:36,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:53:36,675 INFO L85 PathProgramCache]: Analyzing trace with hash -910422195, now seen corresponding path program 1 times [2025-04-24 19:53:36,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:53:36,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739355363] [2025-04-24 19:53:36,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:53:36,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:53:36,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-24 19:53:36,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 19:53:36,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:53:36,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:53:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:53:36,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:53:36,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739355363] [2025-04-24 19:53:36,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739355363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:53:36,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:53:36,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 19:53:36,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42546235] [2025-04-24 19:53:36,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:53:36,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:53:36,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:53:36,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:53:36,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:53:36,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:53:36,906 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:53:36,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 19:53:36,906 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 19:53:36,906 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:53:36,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 19:53:36,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:53:36,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-24 19:53:36,985 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:53:36,985 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:53:36,985 INFO L139 ounterexampleChecker]: Examining path program with hash -1719521395, occurence #1 [2025-04-24 19:53:36,985 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:53:36,985 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:53:36,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:53:36,986 INFO L85 PathProgramCache]: Analyzing trace with hash 817022079, now seen corresponding path program 1 times [2025-04-24 19:53:36,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:53:36,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539172124] [2025-04-24 19:53:36,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:53:36,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:53:37,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-24 19:53:37,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-24 19:53:37,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:53:37,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:53:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 19:53:37,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:53:37,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539172124] [2025-04-24 19:53:37,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539172124] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 19:53:37,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413841388] [2025-04-24 19:53:37,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:53:37,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 19:53:37,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 19:53:37,477 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 19:53:37,477 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 19:53:37,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-24 19:53:37,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-24 19:53:37,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:53:37,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:53:37,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-24 19:53:37,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 19:53:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 19:53:37,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 19:53:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413841388] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:53:37,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-24 19:53:37,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-04-24 19:53:37,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101730664] [2025-04-24 19:53:37,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:53:37,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:53:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:53:37,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:53:37,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-24 19:53:37,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:53:37,624 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:53:37,624 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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 19:53:37,624 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 19:53:37,624 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:53:37,624 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:53:37,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 19:53:37,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:53:37,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:53:37,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-24 19:53:37,895 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,SelfDestructingSolverStorable2 [2025-04-24 19:53:37,895 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:53:37,895 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:53:37,895 INFO L139 ounterexampleChecker]: Examining path program with hash 1282604392, occurence #1 [2025-04-24 19:53:37,895 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:53:37,895 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:53:37,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:53:37,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1024522145, now seen corresponding path program 1 times [2025-04-24 19:53:37,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:53:37,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686678385] [2025-04-24 19:53:37,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:53:37,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:53:37,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-24 19:53:37,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-24 19:53:37,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:53:37,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:53:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 19:53:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:53:38,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686678385] [2025-04-24 19:53:38,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686678385] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 19:53:38,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140958084] [2025-04-24 19:53:38,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:53:38,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 19:53:38,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 19:53:38,271 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 19:53:38,274 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 19:53:38,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-24 19:53:38,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-24 19:53:38,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:53:38,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:53:38,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-24 19:53:38,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 19:53:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 19:53:38,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 19:53:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 19:53:38,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140958084] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 19:53:38,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 19:53:38,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2025-04-24 19:53:38,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760469732] [2025-04-24 19:53:38,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 19:53:38,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-24 19:53:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:53:38,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-24 19:53:38,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-24 19:53:38,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:53:38,598 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:53:38,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 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 19:53:38,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 19:53:38,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:53:38,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:53:38,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:53:39,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 19:53:39,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:53:39,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:53:39,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-24 19:53:39,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-24 19:53:39,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 19:53:39,701 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:53:39,701 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:53:39,701 INFO L139 ounterexampleChecker]: Examining path program with hash 327941973, occurence #1 [2025-04-24 19:53:39,702 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:53:39,702 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:53:39,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:53:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2126736295, now seen corresponding path program 2 times [2025-04-24 19:53:39,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:53:39,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687551184] [2025-04-24 19:53:39,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:53:39,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:53:39,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-04-24 19:53:39,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-04-24 19:53:39,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 19:53:39,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:53:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-04-24 19:53:40,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:53:40,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687551184] [2025-04-24 19:53:40,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687551184] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 19:53:40,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252196821] [2025-04-24 19:53:40,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:53:40,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 19:53:40,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 19:53:40,283 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 19:53:40,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-24 19:53:40,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-04-24 19:53:40,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-04-24 19:53:40,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 19:53:40,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:53:40,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-24 19:53:40,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 19:53:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 19:53:41,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 19:53:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 19:53:41,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252196821] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 19:53:41,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 19:53:41,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 29 [2025-04-24 19:53:41,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189962303] [2025-04-24 19:53:41,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 19:53:41,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-24 19:53:41,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:53:41,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-24 19:53:41,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2025-04-24 19:53:41,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:53:41,887 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:53:41,887 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.379310344827586) internal successors, (214), 29 states have internal predecessors, (214), 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 19:53:41,887 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 19:53:41,887 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:53:41,887 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:53:41,887 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-04-24 19:53:41,887 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:53:52,171 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:54:01,490 WARN L286 SmtUtils]: Spent 7.16s on a formula simplification. DAG size of input: 60 DAG size of output: 29 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 19:54:22,039 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:54:26,136 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:54:27,684 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:54:54,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 19:54:54,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:54:54,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:54:54,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-24 19:54:54,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-24 19:54:54,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-24 19:54:54,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 19:54:54,545 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:54:54,545 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:54:54,545 INFO L139 ounterexampleChecker]: Examining path program with hash 1853161006, occurence #1 [2025-04-24 19:54:54,545 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:54:54,545 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:54:54,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:54:54,546 INFO L85 PathProgramCache]: Analyzing trace with hash 270988792, now seen corresponding path program 3 times [2025-04-24 19:54:54,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:54:54,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108509156] [2025-04-24 19:54:54,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 19:54:54,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:54:54,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 15 equivalence classes. [2025-04-24 19:54:54,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 216 of 216 statements. [2025-04-24 19:54:54,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-04-24 19:54:54,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:55:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 27 proven. 1087 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:55:19,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:55:19,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108509156] [2025-04-24 19:55:19,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108509156] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 19:55:19,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413268694] [2025-04-24 19:55:19,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 19:55:19,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 19:55:19,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 19:55:19,132 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 19:55:19,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-24 19:55:19,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 15 equivalence classes. [2025-04-24 19:55:21,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 216 of 216 statements. [2025-04-24 19:55:21,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-04-24 19:55:21,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:55:21,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-24 19:55:21,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 19:56:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 8 proven. 1108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:56:42,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 19:57:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 8 proven. 1108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:57:12,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413268694] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 19:57:12,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 19:57:12,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 49, 48] total 143 [2025-04-24 19:57:12,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652167098] [2025-04-24 19:57:12,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 19:57:12,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 143 states [2025-04-24 19:57:12,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:57:12,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2025-04-24 19:57:12,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2391, Invalid=17895, Unknown=20, NotChecked=0, Total=20306 [2025-04-24 19:57:12,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:57:12,516 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:57:12,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 143 states, 143 states have (on average 4.335664335664336) internal successors, (620), 143 states have internal predecessors, (620), 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 19:57:12,517 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 19:57:12,517 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:57:12,517 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:57:12,517 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-24 19:57:12,517 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2025-04-24 19:57:12,517 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:57:23,478 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 19:57:27,968 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:57:42,847 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 19:57:56,877 WARN L286 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 44 DAG size of output: 32 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 19:58:08,023 WARN L286 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 54 DAG size of output: 37 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 19:58:15,987 WARN L286 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 53 DAG size of output: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 19:58:26,501 WARN L286 SmtUtils]: Spent 8.78s on a formula simplification. DAG size of input: 70 DAG size of output: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 19:58:31,946 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:58:41,599 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 19:59:05,782 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 80 DAG size of output: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 19:59:27,796 WARN L286 SmtUtils]: Spent 14.33s on a formula simplification. DAG size of input: 65 DAG size of output: 24 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 19:59:41,130 WARN L286 SmtUtils]: Spent 12.11s on a formula simplification. DAG size of input: 62 DAG size of output: 52 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 19:59:43,491 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:59:45,166 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 20:00:12,608 WARN L286 SmtUtils]: Spent 14.98s on a formula simplification. DAG size of input: 87 DAG size of output: 41 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 20:00:27,135 WARN L286 SmtUtils]: Spent 9.32s on a formula simplification. DAG size of input: 83 DAG size of output: 46 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 20:00:31,172 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 20:01:01,632 WARN L286 SmtUtils]: Spent 16.13s on a formula simplification. DAG size of input: 80 DAG size of output: 53 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 20:01:06,396 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 20:01:10,400 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 20:01:14,464 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 20:01:18,691 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 20:01:28,418 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 20:01:32,430 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 20:01:35,182 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 20:01:36,236 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 20:01:54,189 WARN L286 SmtUtils]: Spent 13.07s on a formula simplification. DAG size of input: 91 DAG size of output: 44 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 20:02:18,025 WARN L286 SmtUtils]: Spent 14.49s on a formula simplification. DAG size of input: 96 DAG size of output: 51 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 20:02:30,850 WARN L286 SmtUtils]: Spent 11.55s on a formula simplification. DAG size of input: 59 DAG size of output: 40 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 20:02:40,992 WARN L286 SmtUtils]: Spent 7.49s on a formula simplification. DAG size of input: 72 DAG size of output: 24 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 20:02:54,016 WARN L286 SmtUtils]: Spent 11.72s on a formula simplification. DAG size of input: 69 DAG size of output: 37 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 20:02:58,091 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 20:03:00,799 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 20:03:04,033 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 20:03:07,625 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 20:03:11,964 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse52 (+ c_~i1~0 1))) (let ((.cse7 (mod .cse52 2)) (.cse48 (mod (+ c_~i2~0 12) 4294967296)) (.cse49 (mod (+ 5 c_~i2~0) 4294967296)) (.cse5 (mod c_~i1~0 2)) (.cse9 (* c_~N~0 2)) (.cse10 (* 4294967295 c_~i2~0))) (let ((.cse15 (mod (+ c_~i1~0 20) 4294967296)) (.cse21 (mod (+ 23 c_~i2~0) 4294967296)) (.cse30 (mod (+ c_~i2~0 17) 4294967296)) (.cse14 (mod (+ c_~i2~0 11) 4294967296)) (.cse37 (mod (+ .cse9 3 .cse10) 4294967296)) (.cse2 (+ .cse9 .cse5)) (.cse22 (mod (+ c_~i1~0 18) 4294967296)) (.cse8 (mod (+ c_~i2~0 20) 4294967296)) (.cse19 (mod c_~i1~0 4294967296)) (.cse23 (mod (+ 21 c_~i2~0) 4294967296)) (.cse35 (mod (+ c_~i1~0 14) 4294967296)) (.cse33 (mod (+ c_~i1~0 4) 4294967296)) (.cse18 (+ .cse49 .cse5 1)) (.cse29 (mod (+ c_~i1~0 15) 4294967296)) (.cse40 (mod (+ 7 c_~i2~0) 4294967296)) (.cse36 (mod (+ c_~i1~0 4294967288) 4294967296)) (.cse31 (mod (+ c_~i1~0 12) 4294967296)) (.cse26 (mod (+ 14 c_~i2~0) 4294967296)) (.cse43 (mod (+ c_~i2~0 18) 4294967296)) (.cse44 (mod (+ c_~i1~0 16) 4294967296)) (.cse17 (mod (+ c_~i1~0 2) 4294967296)) (.cse13 (mod (+ c_~i1~0 7) 4294967296)) (.cse4 (mod (+ c_~i2~0 10) 4294967296)) (.cse27 (mod (+ c_~i1~0 10) 4294967296)) (.cse0 (mod (+ .cse9 .cse10 1) 4294967296)) (.cse24 (mod (+ c_~i1~0 4294967290) 4294967296)) (.cse25 (mod (+ c_~i1~0 11) 4294967296)) (.cse47 (mod (+ c_~i2~0 13) 4294967296)) (.cse6 (mod (+ c_~i1~0 17) 4294967296)) (.cse45 (mod (+ 19 c_~i2~0) 4294967296)) (.cse41 (mod (+ c_~i1~0 19) 4294967296)) (.cse16 (mod (+ 22 c_~i2~0) 4294967296)) (.cse20 (mod (+ 3 c_~i2~0) 4294967296)) (.cse38 (mod (+ c_~i1~0 8) 4294967296)) (.cse28 (+ .cse48 .cse5 1)) (.cse1 (* (div c_~N~0 2147483648) 4294967296)) (.cse11 (mod (+ c_~i1~0 4294967286) 4294967296)) (.cse12 (+ .cse7 .cse9)) (.cse39 (mod (+ c_~i1~0 5) 4294967296)) (.cse34 (mod (+ 6 c_~i2~0) 4294967296)) (.cse50 (mod .cse52 4294967296)) (.cse46 (mod (+ c_~i2~0 4) 4294967296)) (.cse3 (mod (+ c_~i1~0 6) 4294967296)) (.cse32 (mod (+ 15 c_~i2~0) 4294967296)) (.cse51 (mod (+ c_~i1~0 13) 4294967296)) (.cse42 (mod (+ 16 c_~i2~0) 4294967296))) (and (<= (+ .cse0 .cse1 (mod (+ c_~i1~0 4294967289) 4294967296) 6) .cse2) (< .cse3 (+ .cse4 .cse5 1)) (< .cse6 (+ .cse7 .cse8 1)) (<= (+ (mod (+ .cse9 4 .cse10) 4294967296) .cse1 6 .cse11) .cse12) (< .cse13 (+ .cse7 .cse14 1)) (< .cse15 (+ .cse16 .cse5 1)) (< .cse17 .cse18) (< .cse19 (+ .cse20 .cse5 1)) (< (mod (+ c_~i1~0 21) 4294967296) (+ .cse7 .cse21 1)) (< .cse22 (+ .cse23 .cse5 1)) (<= (+ .cse1 (mod (+ .cse9 .cse10) 4294967296) 6 .cse24) .cse12) (< .cse25 (+ .cse7 .cse26 1)) (< .cse15 (+ .cse5 .cse21 1)) (< .cse27 .cse28) (< .cse29 (+ .cse7 .cse30 1)) (< .cse3 (+ (mod (+ 8 c_~i2~0) 4294967296) .cse5 1)) (< .cse31 (+ .cse32 .cse5 1)) (< .cse33 (+ .cse34 .cse5 1)) (< .cse35 (+ .cse30 .cse5 1)) (<= (+ .cse1 .cse36 6 .cse37) .cse12) (< .cse38 (+ .cse14 .cse5 1)) (< .cse39 (+ .cse7 .cse40 1)) (<= (+ .cse1 (mod (+ c_~i1~0 4294967287) 4294967296) 6 .cse37) .cse2) (< .cse22 (+ .cse8 .cse5 1)) (< .cse19 (+ .cse5 (mod (+ 2 c_~i2~0) 4294967296) 1)) (< .cse41 (+ .cse7 .cse23 1)) (< .cse35 (+ .cse42 .cse5 1)) (< .cse33 .cse18) (< .cse29 (+ .cse43 .cse7 1)) (< .cse3 (+ .cse5 .cse40 1)) (<= (+ (mod (+ .cse9 2 .cse10) 4294967296) .cse1 .cse36 6) .cse12) (< .cse31 (+ .cse26 .cse5 1)) (<= (+ .cse1 (mod (+ .cse9 6 .cse10) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse12) (< .cse44 (+ .cse43 .cse5 1)) (< .cse44 (+ .cse45 .cse5 1)) (< .cse17 (+ .cse5 .cse46 1)) (< .cse13 (+ .cse7 .cse4 1)) (< .cse27 (+ .cse47 .cse5 1)) (<= (+ .cse0 .cse1 6 .cse24) .cse12) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse7 .cse48 1)) (< .cse25 (+ .cse7 .cse47 1)) (< .cse6 (+ .cse7 .cse45 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse7 .cse49 1)) (< .cse41 (+ .cse7 .cse16 1)) (< .cse50 (+ .cse7 .cse20 1)) (< .cse38 .cse28) (<= (+ .cse1 (mod (+ .cse9 5 .cse10) 4294967296) 6 .cse11) .cse12) (< .cse39 (+ .cse7 .cse34 1)) (< .cse50 (+ .cse7 .cse46 1)) (< .cse3 (+ (mod (+ 9 c_~i2~0) 4294967296) .cse5 1)) (< .cse51 (+ .cse7 .cse32 1)) (< .cse51 (+ .cse7 .cse42 1)))))) is different from false