./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c --full-output --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1c4755c5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 c31f1603fd15e011308b2e8fcd1cd45b23f0b00ac0b8b466c4f212460081639c --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.3.0-dev-1c4755c-m [2024-12-17 21:06:02,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-17 21:06:02,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-12-17 21:06:02,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-17 21:06:02,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-17 21:06:02,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-17 21:06:02,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-17 21:06:02,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-17 21:06:02,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-17 21:06:02,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-17 21:06:02,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-17 21:06:02,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-17 21:06:02,242 INFO L153 SettingsManager]: * Use SBE=true [2024-12-17 21:06:02,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-17 21:06:02,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-17 21:06:02,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-17 21:06:02,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-17 21:06:02,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-17 21:06:02,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-17 21:06:02,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-17 21:06:02,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-17 21:06:02,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-17 21:06:02,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-17 21:06:02,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-17 21:06:02,243 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-17 21:06:02,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-17 21:06:02,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-17 21:06:02,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-17 21:06:02,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-17 21:06:02,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-17 21:06:02,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 21:06:02,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-17 21:06:02,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-17 21:06:02,244 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-17 21:06:02,244 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2024-12-17 21:06:02,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-17 21:06:02,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-17 21:06:02,244 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-12-17 21:06:02,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-17 21:06:02,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-17 21:06:02,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-12-17 21:06:02,245 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-12-17 21:06:02,245 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-12-17 21:06:02,245 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-jdk21/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 -> c31f1603fd15e011308b2e8fcd1cd45b23f0b00ac0b8b466c4f212460081639c Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2024-12-17 21:06:02,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-17 21:06:02,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-17 21:06:02,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-17 21:06:02,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-17 21:06:02,513 INFO L274 PluginConnector]: CDTParser initialized [2024-12-17 21:06:02,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2024-12-17 21:06:03,636 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/256be09a9/db3465b02528473fbb76fd0b3134d95a/FLAG007bfa0a3 [2024-12-17 21:06:03,891 INFO L384 CDTParser]: Found 1 translation units. [2024-12-17 21:06:03,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2024-12-17 21:06:03,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/256be09a9/db3465b02528473fbb76fd0b3134d95a/FLAG007bfa0a3 [2024-12-17 21:06:03,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/256be09a9/db3465b02528473fbb76fd0b3134d95a [2024-12-17 21:06:03,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-17 21:06:03,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-17 21:06:03,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-17 21:06:03,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-17 21:06:03,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-17 21:06:03,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:06:03" (1/1) ... [2024-12-17 21:06:03,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53333e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:03, skipping insertion in model container [2024-12-17 21:06:03,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:06:03" (1/1) ... [2024-12-17 21:06:03,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-17 21:06:04,048 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/mult-dist.wvr.c[2155,2168] [2024-12-17 21:06:04,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 21:06:04,058 INFO L200 MainTranslator]: Completed pre-run [2024-12-17 21:06:04,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/mult-dist.wvr.c[2155,2168] [2024-12-17 21:06:04,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 21:06:04,085 INFO L204 MainTranslator]: Completed translation [2024-12-17 21:06:04,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:04 WrapperNode [2024-12-17 21:06:04,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-17 21:06:04,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-17 21:06:04,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-17 21:06:04,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-17 21:06:04,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:04" (1/1) ... [2024-12-17 21:06:04,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:04" (1/1) ... [2024-12-17 21:06:04,107 INFO L138 Inliner]: procedures = 21, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2024-12-17 21:06:04,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-17 21:06:04,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-17 21:06:04,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-17 21:06:04,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-17 21:06:04,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:04" (1/1) ... [2024-12-17 21:06:04,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:04" (1/1) ... [2024-12-17 21:06:04,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:04" (1/1) ... [2024-12-17 21:06:04,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:04" (1/1) ... [2024-12-17 21:06:04,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:04" (1/1) ... [2024-12-17 21:06:04,122 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:04" (1/1) ... [2024-12-17 21:06:04,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:04" (1/1) ... [2024-12-17 21:06:04,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:04" (1/1) ... [2024-12-17 21:06:04,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:04" (1/1) ... [2024-12-17 21:06:04,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-17 21:06:04,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-17 21:06:04,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-17 21:06:04,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-17 21:06:04,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:04" (1/1) ... [2024-12-17 21:06:04,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 21:06:04,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 21:06:04,151 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-12-17 21:06:04,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-12-17 21:06:04,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-17 21:06:04,168 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-12-17 21:06:04,168 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-12-17 21:06:04,168 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-12-17 21:06:04,168 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-12-17 21:06:04,168 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-12-17 21:06:04,168 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-12-17 21:06:04,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-17 21:06:04,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-17 21:06:04,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-17 21:06:04,169 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-17 21:06:04,221 INFO L234 CfgBuilder]: Building ICFG [2024-12-17 21:06:04,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-17 21:06:04,323 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-17 21:06:04,323 INFO L283 CfgBuilder]: Performing block encoding [2024-12-17 21:06:04,403 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-17 21:06:04,403 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-17 21:06:04,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:06:04 BoogieIcfgContainer [2024-12-17 21:06:04,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-17 21:06:04,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-17 21:06:04,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-17 21:06:04,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-17 21:06:04,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:06:03" (1/3) ... [2024-12-17 21:06:04,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef01d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:06:04, skipping insertion in model container [2024-12-17 21:06:04,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:04" (2/3) ... [2024-12-17 21:06:04,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef01d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:06:04, skipping insertion in model container [2024-12-17 21:06:04,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:06:04" (3/3) ... [2024-12-17 21:06:04,418 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2024-12-17 21:06:04,428 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-17 21:06:04,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-dist.wvr.c that has 4 procedures, 23 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-12-17 21:06:04,430 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-17 21:06:04,462 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-12-17 21:06:04,496 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 21:06:04,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-12-17 21:06:04,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 21:06:04,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-12-17 21:06:04,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-12-17 21:06:04,548 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 21:06:04,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 21:06:04,563 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52d78562, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 21:06:04,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-12-17 21:06:04,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 21:06:04,762 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 21:06:04,762 INFO L139 ounterexampleChecker]: Examining path program with hash -1909108040, occurence #1 [2024-12-17 21:06:04,762 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 21:06:04,762 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 21:06:04,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 21:06:04,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2022854732, now seen corresponding path program 1 times [2024-12-17 21:06:04,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 21:06:04,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33223261] [2024-12-17 21:06:04,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 21:06:04,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 21:06:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 21:06:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 21:06:05,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 21:06:05,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33223261] [2024-12-17 21:06:05,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33223261] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 21:06:05,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 21:06:05,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-17 21:06:05,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120113207] [2024-12-17 21:06:05,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 21:06:05,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-17 21:06:05,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 21:06:05,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-17 21:06:05,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-12-17 21:06:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 21:06:05,570 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 21:06:05,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 21:06:05,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 21:06:05,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-17 21:06:05,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-17 21:06:05,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 21:06:05,837 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 21:06:05,837 INFO L139 ounterexampleChecker]: Examining path program with hash -1909108040, occurence #2 [2024-12-17 21:06:05,837 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 21:06:05,837 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-12-17 21:06:05,851 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 21:06:05,851 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-12-17 21:06:05,851 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 21:06:05,851 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-12-17 21:06:05,851 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 21:06:05,851 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2024-12-17 21:06:05,851 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 21:06:05,852 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 21:06:05,852 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 21:06:05,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 21:06:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2084985710, now seen corresponding path program 1 times [2024-12-17 21:06:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 21:06:05,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918838670] [2024-12-17 21:06:05,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 21:06:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 21:06:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 21:06:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 21:06:06,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 21:06:06,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918838670] [2024-12-17 21:06:06,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918838670] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 21:06:06,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10774991] [2024-12-17 21:06:06,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 21:06:06,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 21:06:06,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 21:06:06,396 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 21:06:06,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-17 21:06:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 21:06:06,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-12-17 21:06:06,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 21:06:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 21:06:06,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 21:06:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 21:06:16,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10774991] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 21:06:16,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 21:06:16,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2024-12-17 21:06:16,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55844818] [2024-12-17 21:06:16,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 21:06:16,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-12-17 21:06:16,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 21:06:16,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-12-17 21:06:16,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=703, Unknown=3, NotChecked=0, Total=870 [2024-12-17 21:06:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 21:06:16,195 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 21:06:16,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6) internal successors, (48), 30 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) [2024-12-17 21:06:16,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-12-17 21:06:16,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 21:06:33,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:06:44,603 WARN L286 SmtUtils]: Spent 8.93s on a formula simplification. DAG size of input: 77 DAG size of output: 77 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 21:06:49,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:06:50,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:06:52,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:06:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-17 21:06:59,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-12-17 21:06:59,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-12-17 21:07:00,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 21:07:00,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 21:07:00,049 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 21:07:00,049 INFO L139 ounterexampleChecker]: Examining path program with hash -1909108040, occurence #3 [2024-12-17 21:07:00,049 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 21:07:00,049 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-12-17 21:07:00,049 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 21:07:00,049 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-12-17 21:07:00,049 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 21:07:00,049 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-12-17 21:07:00,050 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 21:07:00,050 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2024-12-17 21:07:00,050 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 21:07:00,050 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 21:07:00,050 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 21:07:00,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 21:07:00,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1230957004, now seen corresponding path program 2 times [2024-12-17 21:07:00,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 21:07:00,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555116760] [2024-12-17 21:07:00,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 21:07:00,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 21:07:00,090 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 21:07:00,090 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 21:07:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 21:07:01,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 21:07:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555116760] [2024-12-17 21:07:01,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555116760] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 21:07:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520873372] [2024-12-17 21:07:01,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 21:07:01,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 21:07:01,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 21:07:01,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 21:07:01,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-17 21:07:01,093 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 21:07:01,093 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 21:07:01,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-12-17 21:07:01,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 21:07:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 21:07:01,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 21:07:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 21:07:16,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520873372] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 21:07:16,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 21:07:16,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 49 [2024-12-17 21:07:16,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481046037] [2024-12-17 21:07:16,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 21:07:16,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-12-17 21:07:16,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 21:07:16,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-12-17 21:07:16,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1926, Unknown=4, NotChecked=0, Total=2352 [2024-12-17 21:07:16,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 21:07:16,310 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 21:07:16,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 21:07:16,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-12-17 21:07:16,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-12-17 21:07:16,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 21:08:42,324 WARN L286 SmtUtils]: Spent 1.05m on a formula simplification. DAG size of input: 106 DAG size of output: 106 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 21:11:04,987 WARN L286 SmtUtils]: Spent 1.98m on a formula simplification. DAG size of input: 180 DAG size of output: 120 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 21:12:40,567 WARN L286 SmtUtils]: Spent 1.28m on a formula simplification. DAG size of input: 106 DAG size of output: 106 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 21:12:44,836 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse45 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse13 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse36 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse37 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse9 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse10 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse23 (mod c_~a~0 4294967296)) (.cse35 (mod c_~b~0 4294967296)) (.cse22 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse29 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse14 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse46 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse7 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse18 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse47 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse44 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse31 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296))) (let ((.cse1 (+ 2 .cse44 .cse31)) (.cse12 (+ 4294967297 .cse47)) (.cse8 (+ 4294967294 .cse18)) (.cse6 (+ .cse0 1)) (.cse20 (+ .cse7 4294967294)) (.cse30 (+ .cse14 .cse46)) (.cse21 (+ .cse0 4294967297)) (.cse11 (+ .cse22 .cse29)) (.cse24 (< .cse29 .cse35)) (.cse33 (< .cse10 .cse23)) (.cse25 (< .cse35 (+ .cse9 1))) (.cse34 (< .cse23 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1))) (.cse26 (< .cse47 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse17 (+ .cse47 1)) (.cse28 (+ .cse37 .cse22)) (.cse3 (+ .cse36 1)) (.cse32 (+ .cse13 .cse31)) (.cse38 (+ .cse44 .cse45)) (.cse4 (+ .cse37 2 .cse45)) (.cse42 (+ .cse36 4294967297)) (.cse43 (+ .cse0 4294967294)) (.cse5 (+ .cse44 .cse31)) (.cse40 (+ 4294967297 .cse18)) (.cse41 (+ .cse36 4294967294)) (.cse19 (+ 2 .cse22 .cse29)) (.cse16 (+ .cse37 .cse45)) (.cse39 (+ .cse18 1)) (.cse2 (+ .cse13 .cse14)) (.cse15 (+ .cse27 .cse46))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse0 .cse4) (< .cse5 .cse3)) (or (< .cse2 .cse6) (< .cse7 .cse1)) (or (< .cse8 (+ .cse9 .cse10)) (< .cse11 .cse12)) (or (< .cse7 (+ .cse13 2 .cse14)) (< .cse15 .cse6)) (or (< .cse16 .cse17) (< .cse18 .cse19)) (or (< .cse20 .cse5) (< .cse2 .cse21)) (or (< .cse8 .cse11) (< .cse16 .cse12)) (or (< .cse22 .cse23) .cse24 (< .cse23 (+ .cse10 1)) .cse25 .cse26) (< .cse27 4294967295) (or (< .cse20 .cse2) (< .cse15 .cse21)) (or (< .cse28 .cse12) (< .cse8 (+ .cse10 .cse29))) (or (< .cse30 .cse6) (< .cse7 (+ .cse13 2 .cse31))) (or (< .cse20 .cse32) (< .cse30 .cse21)) (or .cse33 .cse34 (< .cse9 .cse35) .cse26) (or (< .cse36 (+ .cse37 2 .cse22)) (< .cse38 .cse39)) (or (< .cse16 .cse40) (< .cse41 .cse11)) (or (< .cse11 .cse17) (< .cse18 (+ .cse9 2 .cse10))) (or .cse24 .cse33 .cse25 .cse34 .cse26) (or (< .cse2 .cse42) (< .cse43 .cse5)) (or (< .cse15 4294967300) (< 4294967298 .cse2)) (or (< .cse18 (+ 2 .cse10 .cse29)) (< .cse28 .cse17)) (or (< .cse38 .cse40) (< .cse41 .cse28)) (or (< .cse32 .cse3) (< .cse0 (+ 2 .cse44 .cse45))) (or (< .cse32 .cse42) (< .cse43 .cse38)) (or (< .cse36 .cse4) (< .cse5 .cse39)) (or (< .cse5 .cse42) (< .cse43 .cse16)) (or (< .cse5 .cse40) (< .cse41 .cse16)) (or (< .cse36 .cse19) (< .cse16 .cse39)) (or (< 2 .cse2) (< .cse15 4))))) is different from false [2024-12-17 21:13:45,905 WARN L286 SmtUtils]: Spent 43.16s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 21:13:48,005 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse42 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse13 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse33 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse34 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse9 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse45 (mod c_~b~0 4294967296)) (.cse22 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse29 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse14 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse43 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse7 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse18 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse44 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse41 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse31 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296))) (let ((.cse1 (+ 2 .cse41 .cse31)) (.cse12 (+ 4294967297 .cse44)) (.cse8 (+ 4294967294 .cse18)) (.cse6 (+ .cse0 1)) (.cse20 (+ .cse7 4294967294)) (.cse30 (+ .cse14 .cse43)) (.cse21 (+ .cse0 4294967297)) (.cse11 (+ .cse22 .cse29)) (.cse24 (< .cse29 .cse45)) (.cse25 (< .cse45 (+ .cse9 1))) (.cse23 (mod c_~a~0 4294967296)) (.cse26 (< .cse44 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse10 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse17 (+ .cse44 1)) (.cse28 (+ .cse34 .cse22)) (.cse3 (+ .cse33 1)) (.cse32 (+ .cse13 .cse31)) (.cse35 (+ .cse41 .cse42)) (.cse4 (+ .cse34 2 .cse42)) (.cse39 (+ .cse33 4294967297)) (.cse40 (+ .cse0 4294967294)) (.cse5 (+ .cse41 .cse31)) (.cse37 (+ 4294967297 .cse18)) (.cse38 (+ .cse33 4294967294)) (.cse19 (+ 2 .cse22 .cse29)) (.cse16 (+ .cse34 .cse42)) (.cse36 (+ .cse18 1)) (.cse2 (+ .cse13 .cse14)) (.cse15 (+ .cse27 .cse43))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse0 .cse4) (< .cse5 .cse3)) (or (< .cse2 .cse6) (< .cse7 .cse1)) (or (< .cse8 (+ .cse9 .cse10)) (< .cse11 .cse12)) (or (< .cse7 (+ .cse13 2 .cse14)) (< .cse15 .cse6)) (or (< .cse16 .cse17) (< .cse18 .cse19)) (or (< .cse20 .cse5) (< .cse2 .cse21)) (or (< .cse8 .cse11) (< .cse16 .cse12)) (or (< .cse22 .cse23) .cse24 (< .cse23 (+ .cse10 1)) .cse25 .cse26) (< .cse27 4294967295) (or (< .cse20 .cse2) (< .cse15 .cse21)) (or (< .cse28 .cse12) (< .cse8 (+ .cse10 .cse29))) (or (< .cse30 .cse6) (< .cse7 (+ .cse13 2 .cse31))) (or (< .cse20 .cse32) (< .cse30 .cse21)) (or (< .cse33 (+ .cse34 2 .cse22)) (< .cse35 .cse36)) (or (< .cse16 .cse37) (< .cse38 .cse11)) (or (< .cse11 .cse17) (< .cse18 (+ .cse9 2 .cse10))) (or .cse24 (< .cse10 .cse23) .cse25 (< .cse23 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) .cse26) (or (< .cse2 .cse39) (< .cse40 .cse5)) (or (< .cse15 4294967300) (< 4294967298 .cse2)) (or (< .cse18 (+ 2 .cse10 .cse29)) (< .cse28 .cse17)) (or (< .cse35 .cse37) (< .cse38 .cse28)) (or (< .cse32 .cse3) (< .cse0 (+ 2 .cse41 .cse42))) (or (< .cse32 .cse39) (< .cse40 .cse35)) (or (< .cse33 .cse4) (< .cse5 .cse36)) (or (< .cse5 .cse39) (< .cse40 .cse16)) (or (< .cse5 .cse37) (< .cse38 .cse16)) (or (< .cse33 .cse19) (< .cse16 .cse36)) (or (< 2 .cse2) (< .cse15 4))))) is different from false [2024-12-17 21:13:52,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse43 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse13 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse34 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse35 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse22 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse24 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse33 (mod (+ c_~b~0 c_~a~0) 4294967296)) (.cse14 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse44 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse7 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse18 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse45 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse42 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse30 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296))) (let ((.cse1 (+ 2 .cse42 .cse30)) (.cse12 (+ 4294967297 .cse45)) (.cse8 (+ 4294967294 .cse18)) (.cse6 (+ .cse0 1)) (.cse20 (+ .cse7 4294967294)) (.cse29 (+ .cse14 .cse44)) (.cse21 (+ .cse0 4294967297)) (.cse23 (mod c_~a~0 4294967296)) (.cse32 (mod c_thread1Thread1of1ForFork2_~i~0 4294967296)) (.cse25 (mod c_~b~0 4294967296)) (.cse26 (< .cse45 .cse33)) (.cse11 (+ .cse22 .cse24)) (.cse9 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse10 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse17 (+ .cse45 1)) (.cse28 (+ .cse35 .cse22)) (.cse3 (+ .cse34 1)) (.cse31 (+ .cse13 .cse30)) (.cse36 (+ .cse42 .cse43)) (.cse4 (+ .cse35 2 .cse43)) (.cse40 (+ .cse34 4294967297)) (.cse41 (+ .cse0 4294967294)) (.cse5 (+ .cse42 .cse30)) (.cse38 (+ 4294967297 .cse18)) (.cse39 (+ .cse34 4294967294)) (.cse19 (+ 2 .cse22 .cse24)) (.cse16 (+ .cse35 .cse43)) (.cse37 (+ .cse18 1)) (.cse2 (+ .cse13 .cse14)) (.cse15 (+ .cse27 .cse44))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse0 .cse4) (< .cse5 .cse3)) (or (< .cse2 .cse6) (< .cse7 .cse1)) (or (< .cse8 (+ .cse9 .cse10)) (< .cse11 .cse12)) (or (< .cse7 (+ .cse13 2 .cse14)) (< .cse15 .cse6)) (or (< .cse16 .cse17) (< .cse18 .cse19)) (or (< .cse20 .cse5) (< .cse2 .cse21)) (or (< .cse8 .cse11) (< .cse16 .cse12)) (or (< .cse22 .cse23) (< .cse24 .cse25) (< .cse23 (+ .cse10 1)) (< .cse25 (+ .cse9 1)) .cse26) (< .cse27 4294967295) (or (< .cse20 .cse2) (< .cse15 .cse21)) (or (< .cse28 .cse12) (< .cse8 (+ .cse10 .cse24))) (or (< .cse29 .cse6) (< .cse7 (+ .cse13 2 .cse30))) (or (< .cse20 .cse31) (< .cse29 .cse21)) (or (and (<= 0 (div c_thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ 5 .cse23 c_thread3Thread1of1ForFork1_~i~2 .cse25) (+ .cse9 .cse32 .cse33))) (and (<= 5 c_thread1Thread1of1ForFork2_~i~0) (<= (+ 4294967291 c_thread2Thread1of1ForFork0_~i~1 c_thread1Thread1of1ForFork2_~i~0) (+ .cse23 .cse25)))) (or (< .cse10 .cse23) (< .cse23 (+ .cse32 1)) (< .cse9 .cse25) .cse26) (or (< .cse34 (+ .cse35 2 .cse22)) (< .cse36 .cse37)) (or (< .cse16 .cse38) (< .cse39 .cse11)) (or (< .cse11 .cse17) (< .cse18 (+ .cse9 2 .cse10))) (or (< .cse2 .cse40) (< .cse41 .cse5)) (<= 4 c_thread2Thread1of1ForFork0_~i~1) (or (< .cse15 4294967300) (< 4294967298 .cse2)) (or (< .cse18 (+ 2 .cse10 .cse24)) (< .cse28 .cse17)) (or (< .cse36 .cse38) (< .cse39 .cse28)) (or (< .cse31 .cse3) (< .cse0 (+ 2 .cse42 .cse43))) (or (< .cse31 .cse40) (< .cse41 .cse36)) (or (< .cse34 .cse4) (< .cse5 .cse37)) (or (< .cse5 .cse40) (< .cse41 .cse16)) (or (< .cse5 .cse38) (< .cse39 .cse16)) (or (< .cse34 .cse19) (< .cse16 .cse37)) (or (< 2 .cse2) (< .cse15 4))))) is different from false [2024-12-17 21:14:25,258 WARN L286 SmtUtils]: Spent 24.83s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 21:15:03,309 WARN L286 SmtUtils]: Spent 27.57s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 21:15:53,468 WARN L286 SmtUtils]: Spent 31.28s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 21:15:55,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:15:57,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:16:00,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:16:02,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:16:04,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:16:06,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:17:33,629 WARN L286 SmtUtils]: Spent 1.23m on a formula simplification that was a NOOP. DAG size: 98 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 21:17:35,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:17:37,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:17:39,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:17:42,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:17:44,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:17:46,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:17:48,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:17:50,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:17:52,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:17:54,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:17:57,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:17:59,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:01,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:03,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:05,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:07,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:10,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:12,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:15,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:17,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:18,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:20,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:23,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:26,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:29,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:31,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:33,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:35,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:38,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:40,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:42,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:44,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:46,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:49,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:51,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:53,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:54,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:56,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:18:59,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:19:01,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:19:03,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:19:06,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:19:08,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:19:10,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:19:12,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:19:14,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:19:15,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:19:17,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:19:38,104 WARN L286 SmtUtils]: Spent 14.80s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 21:19:39,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:19:41,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:19:43,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:19:45,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:20:23,356 WARN L286 SmtUtils]: Spent 28.96s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 21:20:25,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:20:26,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:20:28,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:20:30,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:20:32,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:20:34,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:20:36,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:20:38,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 21:20:42,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15