./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/mult-dist.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 c31f1603fd15e011308b2e8fcd1cd45b23f0b00ac0b8b466c4f212460081639c --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-19 04:16:14,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 04:16:14,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 04:16:14,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 04:16:14,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 04:16:14,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 04:16:14,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 04:16:14,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 04:16:14,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 04:16:14,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 04:16:14,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 04:16:14,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 04:16:14,959 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 04:16:14,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 04:16:14,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 04:16:14,960 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 04:16:14,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 04:16:14,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 04:16:14,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 04:16:14,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 04:16:14,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 04:16:14,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 04:16:14,963 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 04:16:14,963 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 04:16:14,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 04:16:14,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 04:16:14,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 04:16:14,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 04:16:14,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 04:16:14,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 04:16:14,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 04:16:14,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 04:16:14,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 04:16:14,966 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 04:16:14,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 04:16:14,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 04:16:14,967 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 04:16:14,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 04:16:14,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 04:16:14,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 04:16:14,968 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 04:16:14,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c31f1603fd15e011308b2e8fcd1cd45b23f0b00ac0b8b466c4f212460081639c Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 04:16:15,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 04:16:15,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 04:16:15,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 04:16:15,260 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 04:16:15,261 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 04:16:15,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2024-10-19 04:16:16,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 04:16:16,893 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 04:16:16,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2024-10-19 04:16:16,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/742202ffa/708269d74ffe4db6b768a7d21d5a7cb9/FLAG614aa5751 [2024-10-19 04:16:17,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/742202ffa/708269d74ffe4db6b768a7d21d5a7cb9 [2024-10-19 04:16:17,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 04:16:17,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 04:16:17,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 04:16:17,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 04:16:17,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 04:16:17,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 04:16:17" (1/1) ... [2024-10-19 04:16:17,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abe5443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:16:17, skipping insertion in model container [2024-10-19 04:16:17,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 04:16:17" (1/1) ... [2024-10-19 04:16:17,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 04:16:17,520 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c[2155,2168] [2024-10-19 04:16:17,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 04:16:17,531 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 04:16:17,547 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c[2155,2168] [2024-10-19 04:16:17,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 04:16:17,564 INFO L204 MainTranslator]: Completed translation [2024-10-19 04:16:17,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:16:17 WrapperNode [2024-10-19 04:16:17,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 04:16:17,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 04:16:17,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 04:16:17,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 04:16:17,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:16:17" (1/1) ... [2024-10-19 04:16:17,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:16:17" (1/1) ... [2024-10-19 04:16:17,593 INFO L138 Inliner]: procedures = 21, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2024-10-19 04:16:17,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 04:16:17,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 04:16:17,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 04:16:17,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 04:16:17,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:16:17" (1/1) ... [2024-10-19 04:16:17,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:16:17" (1/1) ... [2024-10-19 04:16:17,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:16:17" (1/1) ... [2024-10-19 04:16:17,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:16:17" (1/1) ... [2024-10-19 04:16:17,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:16:17" (1/1) ... [2024-10-19 04:16:17,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:16:17" (1/1) ... [2024-10-19 04:16:17,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:16:17" (1/1) ... [2024-10-19 04:16:17,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:16:17" (1/1) ... [2024-10-19 04:16:17,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 04:16:17,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 04:16:17,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 04:16:17,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 04:16:17,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:16:17" (1/1) ... [2024-10-19 04:16:17,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 04:16:17,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:16:17,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-19 04:16:17,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-19 04:16:17,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 04:16:17,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-19 04:16:17,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-19 04:16:17,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-19 04:16:17,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-19 04:16:17,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-19 04:16:17,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-19 04:16:17,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 04:16:17,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 04:16:17,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 04:16:17,713 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 04:16:17,832 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 04:16:17,835 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 04:16:18,047 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 04:16:18,047 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 04:16:18,214 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 04:16:18,214 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-19 04:16:18,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 04:16:18 BoogieIcfgContainer [2024-10-19 04:16:18,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 04:16:18,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 04:16:18,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 04:16:18,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 04:16:18,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 04:16:17" (1/3) ... [2024-10-19 04:16:18,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c04dcde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 04:16:18, skipping insertion in model container [2024-10-19 04:16:18,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:16:17" (2/3) ... [2024-10-19 04:16:18,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c04dcde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 04:16:18, skipping insertion in model container [2024-10-19 04:16:18,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 04:16:18" (3/3) ... [2024-10-19 04:16:18,225 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2024-10-19 04:16:18,242 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 04:16:18,242 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-19 04:16:18,243 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 04:16:18,288 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-19 04:16:18,329 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 04:16:18,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 04:16:18,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:16:18,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 04:16:18,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-19 04:16:18,419 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 04:16:18,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:16:18,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 04:16:18,443 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;@483e38c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 04:16:18,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-19 04:16:19,073 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-10-19 04:16:19,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:16:19,076 INFO L85 PathProgramCache]: Analyzing trace with hash 465831969, now seen corresponding path program 1 times [2024-10-19 04:16:19,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:16:19,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235505518] [2024-10-19 04:16:19,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:16:19,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:16:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:16:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:16:20,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:16:20,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235505518] [2024-10-19 04:16:20,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235505518] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 04:16:20,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17730419] [2024-10-19 04:16:20,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:16:20,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 04:16:20,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:16:20,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 04:16:20,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-19 04:16:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:16:20,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-19 04:16:20,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 04:16:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:16:20,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 04:16:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:16:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17730419] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 04:16:21,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 04:16:21,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-10-19 04:16:21,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132383220] [2024-10-19 04:16:21,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 04:16:21,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-19 04:16:21,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:16:21,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-19 04:16:21,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2024-10-19 04:16:21,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:16:21,054 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:16:21,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 04:16:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:16:23,936 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-10-19 04:16:24,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-19 04:16:24,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-19 04:16:24,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-19 04:16:24,252 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-10-19 04:16:24,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:16:24,253 INFO L85 PathProgramCache]: Analyzing trace with hash 571738369, now seen corresponding path program 1 times [2024-10-19 04:16:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:16:24,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868306692] [2024-10-19 04:16:24,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:16:24,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:16:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:16:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:16:25,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:16:25,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868306692] [2024-10-19 04:16:25,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868306692] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 04:16:25,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383600524] [2024-10-19 04:16:25,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:16:25,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 04:16:25,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:16:25,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 04:16:25,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-19 04:16:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:16:25,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-19 04:16:25,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 04:16:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:16:27,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 04:16:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:16:34,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383600524] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 04:16:34,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 04:16:34,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 37 [2024-10-19 04:16:34,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202636661] [2024-10-19 04:16:34,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 04:16:34,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-19 04:16:34,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:16:34,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-19 04:16:34,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2024-10-19 04:16:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:16:34,310 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:16:34,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 37 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 04:16:34,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-19 04:16:34,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:17:06,886 WARN L286 SmtUtils]: Spent 24.64s on a formula simplification. DAG size of input: 121 DAG size of output: 79 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 04:18:37,575 WARN L286 SmtUtils]: Spent 1.44m on a formula simplification. DAG size of input: 120 DAG size of output: 119 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 04:19:40,364 WARN L286 SmtUtils]: Spent 54.91s on a formula simplification. DAG size of input: 104 DAG size of output: 103 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 04:19:44,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-19 04:19:53,701 WARN L286 SmtUtils]: Spent 7.99s on a formula simplification. DAG size of input: 131 DAG size of output: 132 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 04:19:56,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-19 04:20:22,277 WARN L286 SmtUtils]: Spent 23.26s on a formula simplification. DAG size of input: 142 DAG size of output: 137 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 04:20:31,679 WARN L286 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 04:20:44,281 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-10-19 04:20:49,060 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-10-19 04:20:54,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-19 04:20:54,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-19 04:20:54,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-19 04:20:54,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 04:20:54,443 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-10-19 04:20:54,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:20:54,444 INFO L85 PathProgramCache]: Analyzing trace with hash 919442113, now seen corresponding path program 2 times [2024-10-19 04:20:54,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:20:54,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941067379] [2024-10-19 04:20:54,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:20:54,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:20:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:20:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:20:56,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:20:56,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941067379] [2024-10-19 04:20:56,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941067379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 04:20:56,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808415228] [2024-10-19 04:20:56,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 04:20:56,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 04:20:56,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:20:56,653 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 04:20:56,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-19 04:20:56,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-19 04:20:56,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 04:20:56,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-19 04:20:56,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 04:21:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:00,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 04:22:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 80 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:22:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808415228] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 04:22:10,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 04:22:10,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 67 [2024-10-19 04:22:10,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597856778] [2024-10-19 04:22:10,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 04:22:10,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-19 04:22:10,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:22:10,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-19 04:22:10,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=832, Invalid=3573, Unknown=17, NotChecked=0, Total=4422 [2024-10-19 04:22:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:22:10,196 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:22:10,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 04:22:10,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-19 04:22:10,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-10-19 04:22:10,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:22:34,621 WARN L286 SmtUtils]: Spent 21.75s on a formula simplification. DAG size of input: 118 DAG size of output: 91 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 04:22:36,788 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296))) (let ((.cse38 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse23 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse28 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse12 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse24 (mod c_~a~0 4294967296)) (.cse5 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse29 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse21 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse22 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse15 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse6 (+ .cse8 1)) (.cse34 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse13 (mod c_~b~0 4294967296)) (.cse18 (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296))) (let ((.cse16 (+ (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse18)) (.cse20 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse9 (< .cse34 .cse13)) (.cse10 (< .cse13 .cse6)) (.cse25 (< .cse15 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse27 (+ .cse21 .cse22)) (.cse2 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (+ .cse5 .cse29)) (.cse17 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse31 (< .cse12 .cse24)) (.cse32 (< .cse24 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1))) (.cse1 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse4 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296)) (.cse19 (+ .cse28 1)) (.cse3 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse14 (+ .cse23 .cse13)) (.cse37 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse35 (+ .cse13 .cse38)) (.cse11 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse30 (+ .cse34 1))) (and (or (< .cse0 (+ .cse1 1)) (< .cse2 (+ 2 .cse3 .cse4)) (< .cse5 .cse6)) (let ((.cse7 (+ .cse2 4294967294))) (or (< .cse7 (+ .cse3 .cse4)) (< .cse7 (+ .cse8 .cse4)) (< .cse0 (+ .cse1 4294967297)))) (or .cse9 .cse10 (and (or (< (+ 4294967295 .cse11) (+ .cse12 .cse13)) (< .cse14 (+ 4294967297 .cse15))) (or (< .cse14 (+ .cse15 1)) (< .cse11 (+ .cse12 .cse13 1))))) (or (< .cse16 (+ .cse17 1)) (< .cse18 .cse19) (< .cse20 (+ .cse21 2 .cse22))) (or (< .cse23 .cse24) .cse9 (< .cse24 (+ .cse12 1)) .cse10 .cse25) (let ((.cse26 (+ 4294967294 .cse20))) (or (< .cse16 (+ .cse17 4294967297)) (< .cse26 .cse27) (< .cse26 (+ .cse21 .cse28)))) (or (< .cse17 (+ .cse5 2 .cse29)) (< .cse22 .cse30) (< .cse27 (+ .cse2 1))) (or .cse9 .cse31 .cse10 .cse32 .cse25) (let ((.cse33 (+ .cse17 4294967294))) (or (< .cse33 (+ .cse29 .cse34)) (< .cse27 (+ .cse2 4294967297)) (< .cse33 .cse0))) (or .cse31 .cse32 (< .cse8 .cse13)) (or (let ((.cse36 (+ .cse4 .cse13))) (and (or (< (+ .cse1 4294967295) .cse35) (< .cse36 (+ .cse37 4294967297))) (or (< .cse1 (+ .cse13 1 .cse38)) (< .cse36 (+ .cse37 1))))) (< .cse13 .cse19) (< .cse3 .cse13)) (or (and (or (< (+ .cse37 4294967295) .cse14) (< .cse35 (+ 4294967297 .cse11))) (or (< .cse37 (+ .cse23 .cse13 1)) (< .cse35 (+ .cse11 1)))) (< .cse13 .cse30) (< .cse28 .cse13)))))) is different from false [2024-10-19 04:22:38,836 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse26 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse79 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse62 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse69 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse65 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse52 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse63 (mod c_~b~0 4294967296)) (.cse7 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse18 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296))) (let ((.cse15 (+ .cse18 4294967295)) (.cse17 (+ 4294967297 .cse7)) (.cse8 (+ .cse52 .cse63 1)) (.cse5 (+ .cse63 .cse65)) (.cse20 (+ .cse7 1)) (.cse32 (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse75 (mod (+ 7 c_thread2Thread1of1ForFork0_~i~1) 4294967296)) (.cse76 (+ .cse69 1)) (.cse47 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse36 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse78 (+ .cse62 1)) (.cse53 (mod c_~a~0 4294967296)) (.cse48 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse2 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse73 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse27 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse9 (+ 4294967295 .cse7)) (.cse11 (+ 4294967297 .cse79)) (.cse10 (+ .cse52 .cse63)) (.cse6 (+ .cse79 1)) (.cse54 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse33 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse68 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296)) (.cse71 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse42 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse67 (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296)) (.cse77 (+ .cse26 1))) (let ((.cse35 (< .cse67 .cse77)) (.cse37 (+ .cse71 2 .cse42)) (.cse3 (+ 2 .cse33 .cse68)) (.cse40 (+ .cse62 .cse68)) (.cse39 (+ .cse33 .cse68)) (.cse45 (and (or (< .cse9 (+ .cse54 .cse63)) (< .cse10 .cse11)) (or (< .cse10 .cse6) (< .cse7 (+ .cse54 .cse63 1))))) (.cse57 (+ .cse73 2 .cse27)) (.cse34 (+ .cse2 1)) (.cse51 (+ .cse48 4294967294)) (.cse43 (< .cse69 .cse63)) (.cse60 (< .cse54 .cse53)) (.cse44 (< .cse63 .cse78)) (.cse61 (< .cse53 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1))) (.cse55 (< .cse79 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse31 (+ .cse36 4294967297)) (.cse22 (+ .cse71 .cse67)) (.cse28 (+ 4294967294 .cse47)) (.cse64 (+ .cse73 .cse68)) (.cse4 (< .cse73 .cse78)) (.cse56 (< .cse42 .cse76)) (.cse25 (+ .cse27 .cse42)) (.cse1 (+ .cse48 1)) (.cse50 (+ .cse18 4294967297)) (.cse19 (+ .cse63 1 .cse65)) (.cse16 (+ .cse68 .cse63)) (.cse49 (+ .cse18 1)) (.cse14 (< .cse63 .cse77)) (.cse21 (< .cse33 .cse63)) (.cse70 (+ .cse32 .cse75)) (.cse46 (+ .cse36 1)) (.cse23 (+ .cse2 4294967297)) (.cse59 (+ .cse71 .cse26)) (.cse24 (+ .cse36 4294967294)) (.cse74 (and (or (< .cse15 .cse10) (< .cse5 .cse17)) (or (< .cse18 .cse8) (< .cse5 .cse20)))) (.cse12 (< .cse63 .cse76)) (.cse13 (< .cse26 .cse63)) (.cse66 (< .cse75 (+ .cse33 1))) (.cse30 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) .cse75)) (.cse29 (+ .cse32 .cse67)) (.cse72 (+ .cse27 .cse69)) (.cse38 (+ .cse2 4294967294)) (.cse0 (+ .cse73 .cse27)) (.cse58 (+ .cse71 .cse42)) (.cse41 (+ .cse48 4294967297))) (and (or (< .cse0 .cse1) (< .cse2 .cse3) .cse4) (or (and (or (< .cse5 .cse6) (< .cse7 .cse8)) (or (< .cse9 .cse10) (< .cse5 .cse11))) .cse12 .cse13) (or .cse14 (and (or (< .cse15 .cse5) (< .cse16 .cse17)) (or (< .cse18 .cse19) (< .cse16 .cse20))) .cse21) (or (< .cse22 .cse23) (< .cse24 .cse25) (< .cse24 (+ .cse26 .cse27))) (or (< .cse28 .cse29) (< .cse30 .cse31) (< .cse28 (+ .cse32 .cse33))) (or (< .cse29 .cse34) .cse35 (< .cse36 .cse37)) (or (< .cse38 .cse39) (< .cse38 .cse40) (< .cse0 .cse41)) (or (< .cse36 (+ 2 .cse27 .cse42)) .cse35 (< .cse22 .cse34)) (or .cse43 .cse44 .cse45) (or (< .cse29 .cse46) .cse35 (< .cse47 .cse37)) (or (< .cse48 .cse3) (< .cse0 .cse49) .cse4) (or (< .cse0 .cse50) (< .cse51 .cse40) (< .cse51 .cse39)) (or .cse45 .cse12 .cse13) (or (< .cse52 .cse53) .cse43 (< .cse53 (+ .cse54 1)) .cse44 .cse55) (or .cse56 (< .cse2 .cse57) (< .cse58 .cse1)) (or (< .cse30 4294967302) (< 4294967300 .cse29)) (or (< .cse29 .cse31) (< .cse28 .cse58) (< .cse28 .cse59)) (or .cse60 .cse61 (< .cse62 .cse63) .cse55) (or (< .cse36 .cse57) .cse56 (< .cse58 .cse34)) (or (< .cse64 .cse50) (< .cse51 (+ .cse62 .cse65)) (< .cse51 (+ .cse33 .cse65))) (or .cse43 .cse60 .cse44 .cse61 .cse55) (= c_thread1Thread1of1ForFork2_~i~0 0) (or .cse66 (< .cse47 (+ .cse32 2 .cse67)) (< .cse30 .cse46)) (or (< .cse38 .cse64) (< .cse38 (+ .cse68 .cse69)) (< .cse25 .cse41)) (or (< .cse70 .cse31) (< .cse28 .cse22) (< .cse28 (+ .cse71 .cse33))) (or (< .cse24 .cse72) (< .cse58 .cse23) (< .cse24 .cse0)) (or (< .cse64 .cse49) (< .cse48 (+ 2 .cse33 .cse65)) .cse4) (or .cse56 (< .cse25 .cse1) (< .cse2 (+ .cse73 2 .cse68))) (or .cse14 .cse74 .cse21) (or (and (or (< (+ .cse48 4294967295) .cse5) (< .cse16 .cse50)) (or (< .cse48 .cse19) (< .cse16 .cse49))) .cse14 .cse21) (or (< .cse47 (+ .cse71 2 .cse67)) .cse66 (< .cse70 .cse46)) (or (< .cse29 .cse23) (< .cse24 .cse59) (< .cse24 .cse58)) (or .cse74 .cse12 .cse13) (or .cse66 (< .cse30 6) (< 4 .cse29)) (or (< .cse38 .cse72) (< .cse38 .cse0) (< .cse58 .cse41)))))) is different from false [2024-10-19 04:23:11,094 WARN L286 SmtUtils]: Spent 29.51s on a formula simplification. DAG size of input: 120 DAG size of output: 93 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 04:23:16,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse26 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse80 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse63 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse70 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse66 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse52 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse64 (mod c_~b~0 4294967296)) (.cse7 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse18 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296))) (let ((.cse59 (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296)) (.cse15 (+ .cse18 4294967295)) (.cse17 (+ 4294967297 .cse7)) (.cse8 (+ .cse52 .cse64 1)) (.cse5 (+ .cse64 .cse66)) (.cse20 (+ .cse7 1)) (.cse32 (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse76 (mod (+ 7 c_thread2Thread1of1ForFork0_~i~1) 4294967296)) (.cse77 (+ .cse70 1)) (.cse47 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse36 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse79 (+ .cse63 1)) (.cse53 (mod c_~a~0 4294967296)) (.cse48 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse2 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse74 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse27 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse9 (+ 4294967295 .cse7)) (.cse11 (+ 4294967297 .cse80)) (.cse10 (+ .cse52 .cse64)) (.cse6 (+ .cse80 1)) (.cse54 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse33 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse69 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296)) (.cse72 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse42 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse68 (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296)) (.cse78 (+ .cse26 1))) (let ((.cse35 (< .cse68 .cse78)) (.cse37 (+ .cse72 2 .cse42)) (.cse3 (+ 2 .cse33 .cse69)) (.cse40 (+ .cse63 .cse69)) (.cse39 (+ .cse33 .cse69)) (.cse45 (and (or (< .cse9 (+ .cse54 .cse64)) (< .cse10 .cse11)) (or (< .cse10 .cse6) (< .cse7 (+ .cse54 .cse64 1))))) (.cse57 (+ .cse74 2 .cse27)) (.cse34 (+ .cse2 1)) (.cse51 (+ .cse48 4294967294)) (.cse43 (< .cse70 .cse64)) (.cse61 (< .cse54 .cse53)) (.cse44 (< .cse64 .cse79)) (.cse62 (< .cse53 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1))) (.cse55 (< .cse80 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse31 (+ .cse36 4294967297)) (.cse22 (+ .cse72 .cse68)) (.cse28 (+ 4294967294 .cse47)) (.cse65 (+ .cse74 .cse69)) (.cse4 (< .cse74 .cse79)) (.cse56 (< .cse42 .cse77)) (.cse25 (+ .cse27 .cse42)) (.cse1 (+ .cse48 1)) (.cse50 (+ .cse18 4294967297)) (.cse19 (+ .cse64 1 .cse66)) (.cse16 (+ .cse69 .cse64)) (.cse49 (+ .cse18 1)) (.cse14 (< .cse64 .cse78)) (.cse21 (< .cse33 .cse64)) (.cse71 (+ .cse32 .cse76)) (.cse46 (+ .cse36 1)) (.cse23 (+ .cse2 4294967297)) (.cse60 (+ .cse72 .cse26)) (.cse24 (+ .cse36 4294967294)) (.cse75 (and (or (< .cse15 .cse10) (< .cse5 .cse17)) (or (< .cse18 .cse8) (< .cse5 .cse20)))) (.cse12 (< .cse64 .cse77)) (.cse13 (< .cse26 .cse64)) (.cse67 (< .cse76 (+ .cse33 1))) (.cse30 (+ .cse59 .cse76)) (.cse29 (+ .cse32 .cse68)) (.cse73 (+ .cse27 .cse70)) (.cse38 (+ .cse2 4294967294)) (.cse0 (+ .cse74 .cse27)) (.cse58 (+ .cse72 .cse42)) (.cse41 (+ .cse48 4294967297))) (and (or (< .cse0 .cse1) (< .cse2 .cse3) .cse4) (or (and (or (< .cse5 .cse6) (< .cse7 .cse8)) (or (< .cse9 .cse10) (< .cse5 .cse11))) .cse12 .cse13) (or .cse14 (and (or (< .cse15 .cse5) (< .cse16 .cse17)) (or (< .cse18 .cse19) (< .cse16 .cse20))) .cse21) (or (< .cse22 .cse23) (< .cse24 .cse25) (< .cse24 (+ .cse26 .cse27))) (or (< .cse28 .cse29) (< .cse30 .cse31) (< .cse28 (+ .cse32 .cse33))) (or (< .cse29 .cse34) .cse35 (< .cse36 .cse37)) (or (< .cse38 .cse39) (< .cse38 .cse40) (< .cse0 .cse41)) (or (< .cse36 (+ 2 .cse27 .cse42)) .cse35 (< .cse22 .cse34)) (or .cse43 .cse44 .cse45) (or (< .cse29 .cse46) .cse35 (< .cse47 .cse37)) (or (< .cse48 .cse3) (< .cse0 .cse49) .cse4) (or (< .cse0 .cse50) (< .cse51 .cse40) (< .cse51 .cse39)) (or .cse45 .cse12 .cse13) (or (< .cse52 .cse53) .cse43 (< .cse53 (+ .cse54 1)) .cse44 .cse55) (or .cse56 (< .cse2 .cse57) (< .cse58 .cse1)) (or (< .cse30 4294967302) (< 4294967300 .cse29)) (< .cse59 4294967295) (or (< .cse29 .cse31) (< .cse28 .cse58) (< .cse28 .cse60)) (or .cse61 .cse62 (< .cse63 .cse64) .cse55) (or (< .cse36 .cse57) .cse56 (< .cse58 .cse34)) (or (< .cse65 .cse50) (< .cse51 (+ .cse63 .cse66)) (< .cse51 (+ .cse33 .cse66))) (or .cse43 .cse61 .cse44 .cse62 .cse55) (or .cse67 (< .cse47 (+ .cse32 2 .cse68)) (< .cse30 .cse46)) (or (< .cse38 .cse65) (< .cse38 (+ .cse69 .cse70)) (< .cse25 .cse41)) (or (< .cse71 .cse31) (< .cse28 .cse22) (< .cse28 (+ .cse72 .cse33))) (or (< .cse24 .cse73) (< .cse58 .cse23) (< .cse24 .cse0)) (or (< .cse65 .cse49) (< .cse48 (+ 2 .cse33 .cse66)) .cse4) (or .cse56 (< .cse25 .cse1) (< .cse2 (+ .cse74 2 .cse69))) (or .cse14 .cse75 .cse21) (or (and (or (< (+ .cse48 4294967295) .cse5) (< .cse16 .cse50)) (or (< .cse48 .cse19) (< .cse16 .cse49))) .cse14 .cse21) (or (< .cse47 (+ .cse72 2 .cse68)) .cse67 (< .cse71 .cse46)) (or (< .cse29 .cse23) (< .cse24 .cse60) (< .cse24 .cse58)) (or .cse75 .cse12 .cse13) (or .cse67 (< .cse30 6) (< 4 .cse29)) (or (< .cse38 .cse73) (< .cse38 .cse0) (< .cse58 .cse41)))))) is different from false [2024-10-19 04:23:18,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296))) (let ((.cse38 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse23 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse28 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse5 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse31 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse21 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse22 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse15 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse6 (+ .cse8 1)) (.cse12 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse24 (mod c_~a~0 4294967296)) (.cse34 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse13 (mod c_~b~0 4294967296)) (.cse18 (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296))) (let ((.cse16 (+ (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse18)) (.cse20 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse9 (< .cse34 .cse13)) (.cse29 (< .cse12 .cse24)) (.cse10 (< .cse13 .cse6)) (.cse30 (< .cse24 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1))) (.cse25 (< .cse15 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse27 (+ .cse21 .cse22)) (.cse2 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (+ .cse5 .cse31)) (.cse17 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse1 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse4 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296)) (.cse19 (+ .cse28 1)) (.cse3 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse14 (+ .cse23 .cse13)) (.cse37 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse35 (+ .cse13 .cse38)) (.cse11 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse32 (+ .cse34 1))) (and (or (< .cse0 (+ .cse1 1)) (< .cse2 (+ 2 .cse3 .cse4)) (< .cse5 .cse6)) (let ((.cse7 (+ .cse2 4294967294))) (or (< .cse7 (+ .cse3 .cse4)) (< .cse7 (+ .cse8 .cse4)) (< .cse0 (+ .cse1 4294967297)))) (or .cse9 .cse10 (and (or (< (+ 4294967295 .cse11) (+ .cse12 .cse13)) (< .cse14 (+ 4294967297 .cse15))) (or (< .cse14 (+ .cse15 1)) (< .cse11 (+ .cse12 .cse13 1))))) (or (< .cse16 (+ .cse17 1)) (< .cse18 .cse19) (< .cse20 (+ .cse21 2 .cse22))) (or (< .cse23 .cse24) .cse9 (< .cse24 (+ .cse12 1)) .cse10 .cse25) (let ((.cse26 (+ 4294967294 .cse20))) (or (< .cse16 (+ .cse17 4294967297)) (< .cse26 .cse27) (< .cse26 (+ .cse21 .cse28)))) (or .cse29 .cse30 (< .cse8 .cse13) .cse25) (or (< .cse17 (+ .cse5 2 .cse31)) (< .cse22 .cse32) (< .cse27 (+ .cse2 1))) (or .cse9 .cse29 .cse10 .cse30 .cse25) (let ((.cse33 (+ .cse17 4294967294))) (or (< .cse33 (+ .cse31 .cse34)) (< .cse27 (+ .cse2 4294967297)) (< .cse33 .cse0))) (or (let ((.cse36 (+ .cse4 .cse13))) (and (or (< (+ .cse1 4294967295) .cse35) (< .cse36 (+ .cse37 4294967297))) (or (< .cse1 (+ .cse13 1 .cse38)) (< .cse36 (+ .cse37 1))))) (< .cse13 .cse19) (< .cse3 .cse13)) (or (and (or (< (+ .cse37 4294967295) .cse14) (< .cse35 (+ 4294967297 .cse11))) (or (< .cse37 (+ .cse23 .cse13 1)) (< .cse35 (+ .cse11 1)))) (< .cse13 .cse32) (< .cse28 .cse13)))))) is different from false [2024-10-19 04:24:10,685 WARN L286 SmtUtils]: Spent 39.31s on a formula simplification. DAG size of input: 122 DAG size of output: 123 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 04:24:15,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296))) (let ((.cse36 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse23 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse28 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse5 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse29 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse21 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse22 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse15 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse6 (+ .cse8 1)) (.cse32 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse13 (mod c_~b~0 4294967296)) (.cse18 (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296))) (let ((.cse16 (+ (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse18)) (.cse20 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse9 (< .cse32 .cse13)) (.cse12 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse10 (< .cse13 .cse6)) (.cse24 (mod c_~a~0 4294967296)) (.cse25 (< .cse15 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse27 (+ .cse21 .cse22)) (.cse2 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (+ .cse5 .cse29)) (.cse17 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse1 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse4 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296)) (.cse19 (+ .cse28 1)) (.cse3 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse14 (+ .cse23 .cse13)) (.cse35 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse33 (+ .cse13 .cse36)) (.cse11 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse30 (+ .cse32 1))) (and (or (< .cse0 (+ .cse1 1)) (< .cse2 (+ 2 .cse3 .cse4)) (< .cse5 .cse6)) (let ((.cse7 (+ .cse2 4294967294))) (or (< .cse7 (+ .cse3 .cse4)) (< .cse7 (+ .cse8 .cse4)) (< .cse0 (+ .cse1 4294967297)))) (or .cse9 .cse10 (and (or (< (+ 4294967295 .cse11) (+ .cse12 .cse13)) (< .cse14 (+ 4294967297 .cse15))) (or (< .cse14 (+ .cse15 1)) (< .cse11 (+ .cse12 .cse13 1))))) (or (< .cse16 (+ .cse17 1)) (< .cse18 .cse19) (< .cse20 (+ .cse21 2 .cse22))) (or (< .cse23 .cse24) .cse9 (< .cse24 (+ .cse12 1)) .cse10 .cse25) (let ((.cse26 (+ 4294967294 .cse20))) (or (< .cse16 (+ .cse17 4294967297)) (< .cse26 .cse27) (< .cse26 (+ .cse21 .cse28)))) (or (< .cse17 (+ .cse5 2 .cse29)) (< .cse22 .cse30) (< .cse27 (+ .cse2 1))) (or .cse9 (< .cse12 .cse24) .cse10 (< .cse24 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) .cse25) (let ((.cse31 (+ .cse17 4294967294))) (or (< .cse31 (+ .cse29 .cse32)) (< .cse27 (+ .cse2 4294967297)) (< .cse31 .cse0))) (or (let ((.cse34 (+ .cse4 .cse13))) (and (or (< (+ .cse1 4294967295) .cse33) (< .cse34 (+ .cse35 4294967297))) (or (< .cse1 (+ .cse13 1 .cse36)) (< .cse34 (+ .cse35 1))))) (< .cse13 .cse19) (< .cse3 .cse13)) (or (and (or (< (+ .cse35 4294967295) .cse14) (< .cse33 (+ 4294967297 .cse11))) (or (< .cse35 (+ .cse23 .cse13 1)) (< .cse33 (+ .cse11 1)))) (< .cse13 .cse30) (< .cse28 .cse13)))))) is different from false [2024-10-19 04:24:17,698 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse26 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse78 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse62 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse67 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse63 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse52 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse74 (mod c_~b~0 4294967296)) (.cse7 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse18 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296))) (let ((.cse59 (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296)) (.cse15 (+ .cse18 4294967295)) (.cse17 (+ 4294967297 .cse7)) (.cse8 (+ .cse52 .cse74 1)) (.cse5 (+ .cse74 .cse63)) (.cse20 (+ .cse7 1)) (.cse32 (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse73 (mod (+ 7 c_thread2Thread1of1ForFork0_~i~1) 4294967296)) (.cse75 (+ .cse67 1)) (.cse47 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse36 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse77 (+ .cse62 1)) (.cse48 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse2 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse71 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse27 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse9 (+ 4294967295 .cse7)) (.cse11 (+ 4294967297 .cse78)) (.cse10 (+ .cse52 .cse74)) (.cse6 (+ .cse78 1)) (.cse54 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse33 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse66 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296)) (.cse69 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse42 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse65 (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296)) (.cse76 (+ .cse26 1))) (let ((.cse35 (< .cse65 .cse76)) (.cse37 (+ .cse69 2 .cse42)) (.cse3 (+ 2 .cse33 .cse66)) (.cse40 (+ .cse62 .cse66)) (.cse39 (+ .cse33 .cse66)) (.cse45 (and (or (< .cse9 (+ .cse54 .cse74)) (< .cse10 .cse11)) (or (< .cse10 .cse6) (< .cse7 (+ .cse54 .cse74 1))))) (.cse57 (+ .cse71 2 .cse27)) (.cse34 (+ .cse2 1)) (.cse51 (+ .cse48 4294967294)) (.cse43 (< .cse67 .cse74)) (.cse44 (< .cse74 .cse77)) (.cse53 (mod c_~a~0 4294967296)) (.cse55 (< .cse78 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse31 (+ .cse36 4294967297)) (.cse22 (+ .cse69 .cse65)) (.cse28 (+ 4294967294 .cse47)) (.cse61 (+ .cse71 .cse66)) (.cse4 (< .cse71 .cse77)) (.cse56 (< .cse42 .cse75)) (.cse25 (+ .cse27 .cse42)) (.cse1 (+ .cse48 1)) (.cse50 (+ .cse18 4294967297)) (.cse19 (+ .cse74 1 .cse63)) (.cse16 (+ .cse66 .cse74)) (.cse49 (+ .cse18 1)) (.cse14 (< .cse74 .cse76)) (.cse21 (< .cse33 .cse74)) (.cse68 (+ .cse32 .cse73)) (.cse46 (+ .cse36 1)) (.cse23 (+ .cse2 4294967297)) (.cse60 (+ .cse69 .cse26)) (.cse24 (+ .cse36 4294967294)) (.cse72 (and (or (< .cse15 .cse10) (< .cse5 .cse17)) (or (< .cse18 .cse8) (< .cse5 .cse20)))) (.cse12 (< .cse74 .cse75)) (.cse13 (< .cse26 .cse74)) (.cse64 (< .cse73 (+ .cse33 1))) (.cse30 (+ .cse59 .cse73)) (.cse29 (+ .cse32 .cse65)) (.cse70 (+ .cse27 .cse67)) (.cse38 (+ .cse2 4294967294)) (.cse0 (+ .cse71 .cse27)) (.cse58 (+ .cse69 .cse42)) (.cse41 (+ .cse48 4294967297))) (and (or (< .cse0 .cse1) (< .cse2 .cse3) .cse4) (or (and (or (< .cse5 .cse6) (< .cse7 .cse8)) (or (< .cse9 .cse10) (< .cse5 .cse11))) .cse12 .cse13) (or .cse14 (and (or (< .cse15 .cse5) (< .cse16 .cse17)) (or (< .cse18 .cse19) (< .cse16 .cse20))) .cse21) (or (< .cse22 .cse23) (< .cse24 .cse25) (< .cse24 (+ .cse26 .cse27))) (or (< .cse28 .cse29) (< .cse30 .cse31) (< .cse28 (+ .cse32 .cse33))) (or (< .cse29 .cse34) .cse35 (< .cse36 .cse37)) (or (< .cse38 .cse39) (< .cse38 .cse40) (< .cse0 .cse41)) (or (< .cse36 (+ 2 .cse27 .cse42)) .cse35 (< .cse22 .cse34)) (or .cse43 .cse44 .cse45) (or (< .cse29 .cse46) .cse35 (< .cse47 .cse37)) (or (< .cse48 .cse3) (< .cse0 .cse49) .cse4) (or (< .cse0 .cse50) (< .cse51 .cse40) (< .cse51 .cse39)) (or .cse45 .cse12 .cse13) (or (< .cse52 .cse53) .cse43 (< .cse53 (+ .cse54 1)) .cse44 .cse55) (or .cse56 (< .cse2 .cse57) (< .cse58 .cse1)) (or (< .cse30 4294967302) (< 4294967300 .cse29)) (< .cse59 4294967295) (or (< .cse29 .cse31) (< .cse28 .cse58) (< .cse28 .cse60)) (or (< .cse36 .cse57) .cse56 (< .cse58 .cse34)) (or (< .cse61 .cse50) (< .cse51 (+ .cse62 .cse63)) (< .cse51 (+ .cse33 .cse63))) (or .cse43 (< .cse54 .cse53) .cse44 (< .cse53 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) .cse55) (or .cse64 (< .cse47 (+ .cse32 2 .cse65)) (< .cse30 .cse46)) (or (< .cse38 .cse61) (< .cse38 (+ .cse66 .cse67)) (< .cse25 .cse41)) (or (< .cse68 .cse31) (< .cse28 .cse22) (< .cse28 (+ .cse69 .cse33))) (or (< .cse24 .cse70) (< .cse58 .cse23) (< .cse24 .cse0)) (or (< .cse61 .cse49) (< .cse48 (+ 2 .cse33 .cse63)) .cse4) (or .cse56 (< .cse25 .cse1) (< .cse2 (+ .cse71 2 .cse66))) (or .cse14 .cse72 .cse21) (or (and (or (< (+ .cse48 4294967295) .cse5) (< .cse16 .cse50)) (or (< .cse48 .cse19) (< .cse16 .cse49))) .cse14 .cse21) (or (< .cse47 (+ .cse69 2 .cse65)) .cse64 (< .cse68 .cse46)) (or (< .cse29 .cse23) (< .cse24 .cse60) (< .cse24 .cse58)) (or .cse72 .cse12 .cse13) (or .cse64 (< .cse30 6) (< 4 .cse29)) (or (< .cse38 .cse70) (< .cse38 .cse0) (< .cse58 .cse41)))))) is different from false Killed by 15