./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/mult-dist.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/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 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-13 01:30:11,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 01:30:11,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-11-13 01:30:11,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 01:30:11,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 01:30:11,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 01:30:11,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 01:30:11,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 01:30:11,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 01:30:11,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 01:30:11,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 01:30:11,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 01:30:11,559 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 01:30:11,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 01:30:11,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 01:30:11,562 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 01:30:11,562 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 01:30:11,562 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 01:30:11,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 01:30:11,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 01:30:11,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 01:30:11,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 01:30:11,563 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 01:30:11,565 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 01:30:11,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 01:30:11,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 01:30:11,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 01:30:11,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 01:30:11,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 01:30:11,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 01:30:11,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 01:30:11,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 01:30:11,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 01:30:11,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 01:30:11,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 01:30:11,567 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-13 01:30:11,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 01:30:11,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 01:30:11,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 01:30:11,568 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 01:30:11,568 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 01:30:11,569 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 [2024-11-13 01:30:11,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 01:30:11,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 01:30:11,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 01:30:11,774 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 01:30:11,775 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 01:30:11,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/mult-dist.wvr.c [2024-11-13 01:30:12,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 01:30:13,120 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 01:30:13,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-dist.wvr.c [2024-11-13 01:30:13,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f985e011f/a17e0aa63e7e44829406d17c6307b23e/FLAG71fb3f9e4 [2024-11-13 01:30:13,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f985e011f/a17e0aa63e7e44829406d17c6307b23e [2024-11-13 01:30:13,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 01:30:13,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 01:30:13,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 01:30:13,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 01:30:13,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 01:30:13,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:30:13" (1/1) ... [2024-11-13 01:30:13,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e10e57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:13, skipping insertion in model container [2024-11-13 01:30:13,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:30:13" (1/1) ... [2024-11-13 01:30:13,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 01:30:13,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-dist.wvr.c[2155,2168] [2024-11-13 01:30:13,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 01:30:13,366 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 01:30:13,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-dist.wvr.c[2155,2168] [2024-11-13 01:30:13,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 01:30:13,404 INFO L204 MainTranslator]: Completed translation [2024-11-13 01:30:13,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:13 WrapperNode [2024-11-13 01:30:13,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 01:30:13,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 01:30:13,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 01:30:13,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 01:30:13,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:13" (1/1) ... [2024-11-13 01:30:13,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:13" (1/1) ... [2024-11-13 01:30:13,432 INFO L138 Inliner]: procedures = 21, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2024-11-13 01:30:13,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 01:30:13,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 01:30:13,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 01:30:13,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 01:30:13,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:13" (1/1) ... [2024-11-13 01:30:13,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:13" (1/1) ... [2024-11-13 01:30:13,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:13" (1/1) ... [2024-11-13 01:30:13,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:13" (1/1) ... [2024-11-13 01:30:13,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:13" (1/1) ... [2024-11-13 01:30:13,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:13" (1/1) ... [2024-11-13 01:30:13,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:13" (1/1) ... [2024-11-13 01:30:13,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:13" (1/1) ... [2024-11-13 01:30:13,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 01:30:13,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 01:30:13,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 01:30:13,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 01:30:13,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:13" (1/1) ... [2024-11-13 01:30:13,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 01:30:13,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 01:30:13,491 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-11-13 01:30:13,506 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-11-13 01:30:13,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 01:30:13,577 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-13 01:30:13,577 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-13 01:30:13,577 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-13 01:30:13,577 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-13 01:30:13,577 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-13 01:30:13,577 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-13 01:30:13,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 01:30:13,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 01:30:13,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 01:30:13,579 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 01:30:13,659 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 01:30:13,661 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 01:30:13,798 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 01:30:13,798 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 01:30:13,912 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 01:30:13,912 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 01:30:13,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:30:13 BoogieIcfgContainer [2024-11-13 01:30:13,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 01:30:13,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 01:30:13,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 01:30:13,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 01:30:13,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:30:13" (1/3) ... [2024-11-13 01:30:13,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3310f12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:30:13, skipping insertion in model container [2024-11-13 01:30:13,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:13" (2/3) ... [2024-11-13 01:30:13,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3310f12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:30:13, skipping insertion in model container [2024-11-13 01:30:13,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:30:13" (3/3) ... [2024-11-13 01:30:13,921 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2024-11-13 01:30:13,933 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 01:30:13,933 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-13 01:30:13,933 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 01:30:13,976 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-13 01:30:14,011 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 01:30:14,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 01:30:14,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 01:30:14,013 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-11-13 01:30:14,014 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-11-13 01:30:14,035 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 01:30:14,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 01:30:14,048 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;@2e3c9034, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 01:30:14,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-13 01:30:14,396 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-11-13 01:30:14,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 01:30:14,402 INFO L85 PathProgramCache]: Analyzing trace with hash 465831969, now seen corresponding path program 1 times [2024-11-13 01:30:14,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 01:30:14,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857969747] [2024-11-13 01:30:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 01:30:14,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 01:30:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 01:30:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 01:30:15,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 01:30:15,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857969747] [2024-11-13 01:30:15,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857969747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 01:30:15,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954012423] [2024-11-13 01:30:15,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 01:30:15,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 01:30:15,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 01:30:15,209 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-11-13 01:30:15,210 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-11-13 01:30:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 01:30:15,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 01:30:15,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 01:30:15,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 01:30:15,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 01:30:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 01:30:16,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954012423] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 01:30:16,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 01:30:16,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-11-13 01:30:16,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606353355] [2024-11-13 01:30:16,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 01:30:16,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 01:30:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 01:30:16,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 01:30:16,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2024-11-13 01:30:16,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:30:16,166 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 01:30:16,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 01:30:16,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:30:19,012 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-11-13 01:30:19,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 01:30:19,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 01:30:19,344 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-11-13 01:30:19,345 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-11-13 01:30:19,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 01:30:19,345 INFO L85 PathProgramCache]: Analyzing trace with hash 571738369, now seen corresponding path program 1 times [2024-11-13 01:30:19,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 01:30:19,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686252945] [2024-11-13 01:30:19,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 01:30:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 01:30:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 01:30:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 01:30:20,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 01:30:20,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686252945] [2024-11-13 01:30:20,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686252945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 01:30:20,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447067476] [2024-11-13 01:30:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 01:30:20,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 01:30:20,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 01:30:20,128 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-11-13 01:30:20,129 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-11-13 01:30:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 01:30:20,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 01:30:20,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 01:30:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 01:30:22,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 01:30:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 01:30:26,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447067476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 01:30:26,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 01:30:26,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 37 [2024-11-13 01:30:26,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126341124] [2024-11-13 01:30:26,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 01:30:26,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-13 01:30:26,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 01:30:26,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-13 01:30:26,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1099, Unknown=1, NotChecked=0, Total=1332 [2024-11-13 01:30:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:30:26,480 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 01:30:26,481 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-11-13 01:30:26,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-13 01:30:26,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:30:40,711 WARN L286 SmtUtils]: Spent 12.43s on a formula simplification. DAG size of input: 70 DAG size of output: 70 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 01:31:16,981 WARN L286 SmtUtils]: Spent 32.16s on a formula simplification. DAG size of input: 113 DAG size of output: 79 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 01:31:19,389 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse20 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse16 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296)) (.cse21 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse28 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse27 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse1 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse2 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse10 (mod c_~a~0 4294967296)) (.cse19 (mod c_~b~0 4294967296)) (.cse9 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse15 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse7 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse29 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296))) (let ((.cse4 (+ 4294967297 .cse29)) (.cse0 (+ 4294967294 .cse7)) (.cse3 (+ .cse9 .cse15)) (.cse11 (< .cse15 .cse19)) (.cse17 (< .cse2 .cse10)) (.cse12 (< .cse19 (+ .cse1 1))) (.cse18 (< .cse10 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1))) (.cse13 (< .cse29 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse6 (+ .cse29 1)) (.cse22 (+ .cse28 .cse27)) (.cse14 (+ .cse21 .cse9)) (.cse26 (+ .cse28 .cse16)) (.cse24 (+ 4294967297 .cse7)) (.cse25 (+ .cse20 4294967294)) (.cse8 (+ 2 .cse9 .cse15)) (.cse5 (+ .cse21 .cse27)) (.cse23 (+ .cse7 1))) (and (or (< .cse0 (+ .cse1 .cse2)) (< .cse3 .cse4)) (or (< .cse5 .cse6) (< .cse7 .cse8)) (<= 1 .cse5) (or (< .cse0 .cse3) (< .cse5 .cse4)) (or (< .cse9 .cse10) .cse11 (< .cse10 (+ .cse2 1)) .cse12 .cse13) (or (< .cse14 .cse4) (< .cse0 (+ .cse2 .cse15))) (< .cse16 4294967295) (or .cse17 .cse18 (< .cse1 .cse19) .cse13) (or (< .cse20 (+ .cse21 2 .cse9)) (< .cse22 .cse23)) (or (< .cse5 .cse24) (< .cse25 .cse3)) (or (< .cse3 .cse6) (< .cse7 (+ .cse1 2 .cse2))) (or .cse11 .cse17 .cse12 .cse18 .cse13) (or (< .cse26 4294967298) (< 4294967296 .cse5)) (or (< .cse7 (+ 2 .cse2 .cse15)) (< .cse14 .cse6)) (or (< .cse22 .cse24) (< .cse25 .cse14)) (or (< .cse20 (+ .cse21 2 .cse27)) (< .cse26 .cse23)) (or (< .cse26 .cse24) (< .cse25 .cse5)) (or (< .cse20 .cse8) (< .cse5 .cse23))))) is different from false [2024-11-13 01:31:27,238 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-11-13 01:32:43,687 WARN L286 SmtUtils]: Spent 53.98s on a formula simplification. DAG size of input: 111 DAG size of output: 110 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 01:33:16,523 WARN L286 SmtUtils]: Spent 24.82s on a formula simplification. DAG size of input: 126 DAG size of output: 126 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 01:33:25,886 WARN L286 SmtUtils]: Spent 6.58s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 01:33:30,643 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-11-13 01:33:45,100 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-11-13 01:33:47,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 01:33:49,405 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-11-13 01:33:56,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 01:33:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-13 01:33:56,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 01:33:57,012 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-11-13 01:33:57,013 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-11-13 01:33:57,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 01:33:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash 919442113, now seen corresponding path program 2 times [2024-11-13 01:33:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 01:33:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357876560] [2024-11-13 01:33:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 01:33:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 01:33:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 01:33:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 01:33:58,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 01:33:58,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357876560] [2024-11-13 01:33:58,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357876560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 01:33:58,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774400493] [2024-11-13 01:33:58,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 01:33:58,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 01:33:58,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 01:33:58,581 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-11-13 01:33:58,582 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-11-13 01:33:58,696 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 01:33:58,696 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 01:33:58,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-13 01:33:58,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 01:34:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 01:34:00,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 01:34:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 01:34:35,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774400493] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 01:34:35,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 01:34:35,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 61 [2024-11-13 01:34:35,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119518015] [2024-11-13 01:34:35,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 01:34:35,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-13 01:34:35,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 01:34:35,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-13 01:34:35,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=2976, Unknown=8, NotChecked=0, Total=3660 [2024-11-13 01:34:35,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:34:35,553 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 01:34:35,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 61 states have internal predecessors, (79), 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-11-13 01:34:35,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-13 01:34:35,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-11-13 01:34:35,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:34:38,795 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse6 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse23 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse24 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse29 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse30 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse11 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse12 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296)) (.cse15 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse19 (mod c_~a~0 4294967296)) (.cse17 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse14 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse28 (mod c_~b~0 4294967296)) (.cse18 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse31 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296))) (let ((.cse16 (+ .cse18 .cse31)) (.cse20 (< .cse31 .cse28)) (.cse21 (< .cse28 (+ .cse14 1))) (.cse22 (< .cse17 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse26 (< .cse15 .cse19)) (.cse27 (< .cse19 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1))) (.cse7 (+ .cse11 .cse12)) (.cse4 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse3 (+ .cse29 .cse30)) (.cse10 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse9 (+ .cse23 .cse24)) (.cse0 (+ (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296))) (.cse1 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse2 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse8 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse25 (+ .cse5 .cse6)) (.cse13 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296))) (and (or (< .cse0 (+ .cse1 4294967297)) (< (+ 4294967294 .cse2) .cse3)) (or (< .cse4 (+ .cse5 2 .cse6)) (< .cse7 (+ .cse8 1))) (or (< .cse9 (+ .cse4 1)) (< .cse10 (+ 2 .cse11 .cse12))) (or (< (+ 4294967294 .cse13) (+ .cse14 .cse15)) (< .cse16 (+ 4294967297 .cse17))) (or (< (+ .cse10 4294967294) .cse7) (< .cse9 (+ .cse4 4294967297))) (or (< .cse18 .cse19) .cse20 (< .cse19 (+ .cse15 1)) .cse21 .cse22) (or (< .cse1 (+ .cse23 2 .cse24)) (< .cse3 (+ .cse10 1))) (or (< .cse25 (+ 4294967297 .cse13)) (< (+ .cse8 4294967294) .cse16)) (or (< .cse16 (+ .cse17 1)) (< .cse13 (+ .cse14 2 .cse15))) (or .cse20 .cse26 .cse21 .cse27 .cse22) (or .cse26 .cse27 (< .cse14 .cse28)) (or (< .cse7 (+ .cse8 4294967297)) (< (+ .cse4 4294967294) .cse25)) (or (< .cse3 (+ .cse10 4294967297)) (< (+ .cse1 4294967294) .cse9)) (or (< .cse0 (+ .cse1 1)) (< .cse2 (+ .cse29 2 .cse30))) (or (< .cse8 (+ 2 .cse18 .cse31)) (< .cse25 (+ .cse13 1)))))) is different from false [2024-11-13 01:43:03,221 WARN L286 SmtUtils]: Spent 7.70m on a formula simplification. DAG size of input: 244 DAG size of output: 174 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 01:43:09,574 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse25 (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296)) (.cse49 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse31 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse63 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse53 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse54 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse13 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse14 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse36 (mod c_~a~0 4294967296)) (.cse52 (mod c_~b~0 4294967296)) (.cse35 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse41 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse45 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse30 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse24 (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse11 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse21 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse64 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse47 (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296)) (.cse65 (mod (+ 7 c_thread2Thread1of1ForFork0_~i~1) 4294967296)) (.cse29 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse23 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse62 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse46 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296))) (let ((.cse1 (+ 2 .cse62 .cse46)) (.cse6 (+ 4294967294 .cse23)) (.cse5 (+ .cse29 4294967297)) (.cse17 (+ .cse47 .cse65)) (.cse16 (+ 4294967297 .cse64)) (.cse12 (+ 4294967294 .cse21)) (.cse10 (+ .cse0 1)) (.cse33 (+ .cse11 4294967294)) (.cse34 (+ .cse0 4294967297)) (.cse27 (+ .cse24 .cse65)) (.cse18 (+ .cse45 2 .cse30)) (.cse32 (+ .cse11 1)) (.cse15 (+ .cse35 .cse41)) (.cse37 (< .cse41 .cse52)) (.cse50 (< .cse14 .cse36)) (.cse38 (< .cse52 (+ .cse13 1))) (.cse51 (< .cse36 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1))) (.cse39 (< .cse64 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse20 (+ .cse64 1)) (.cse40 (+ .cse54 .cse35)) (.cse3 (+ .cse53 1)) (.cse48 (+ .cse45 .cse46)) (.cse55 (+ .cse62 .cse63)) (.cse8 (+ .cse54 2 .cse63)) (.cse60 (+ .cse53 4294967297)) (.cse61 (+ .cse0 4294967294)) (.cse7 (+ .cse49 .cse31)) (.cse2 (+ .cse45 .cse30)) (.cse4 (+ .cse24 .cse25)) (.cse26 (+ .cse29 1)) (.cse57 (+ .cse49 2 .cse31)) (.cse9 (+ .cse62 .cse46)) (.cse58 (+ 4294967297 .cse21)) (.cse59 (+ .cse53 4294967294)) (.cse22 (+ 2 .cse35 .cse41)) (.cse19 (+ .cse54 .cse63)) (.cse56 (+ .cse21 1)) (.cse28 (+ .cse49 .cse25)) (.cse42 (+ .cse11 4294967297)) (.cse43 (+ .cse29 4294967294)) (.cse44 (+ .cse30 .cse31))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse4 .cse5) (< .cse6 .cse7)) (or (< .cse0 .cse8) (< .cse9 .cse3)) (or (< .cse2 .cse10) (< .cse11 .cse1)) (or (< .cse12 (+ .cse13 .cse14)) (< .cse15 .cse16)) (or (< .cse17 6) (< 4 .cse4)) (or (< .cse11 .cse18) (< .cse7 .cse10)) (or (< .cse19 .cse20) (< .cse21 .cse22)) (or (< .cse23 (+ .cse24 2 .cse25)) (< .cse17 .cse26)) (or (< .cse27 .cse5) (< .cse6 .cse28)) (or (< .cse29 (+ 2 .cse30 .cse31)) (< .cse28 .cse32)) (or (< .cse33 .cse9) (< .cse2 .cse34)) (or (< .cse12 .cse15) (< .cse19 .cse16)) (or (< .cse35 .cse36) .cse37 (< .cse36 (+ .cse14 1)) .cse38 .cse39) (or (< .cse6 .cse4) (< .cse17 .cse5)) (or (< .cse17 4294967302) (< 4294967300 .cse4)) (or (< .cse33 .cse2) (< .cse7 .cse34)) (or (< .cse40 .cse16) (< .cse12 (+ .cse14 .cse41))) (or (< .cse4 .cse42) (< .cse43 .cse7)) (or (< .cse44 .cse10) (< .cse11 (+ .cse45 2 .cse46))) (< .cse47 4294967295) (or (< .cse33 .cse48) (< .cse44 .cse34)) (or (< .cse23 (+ .cse49 2 .cse25)) (< .cse27 .cse26)) (or (< .cse29 .cse18) (< .cse7 .cse32)) (or .cse50 .cse51 (< .cse13 .cse52) .cse39) (or (< .cse53 (+ .cse54 2 .cse35)) (< .cse55 .cse56)) (or (< .cse4 .cse32) (< .cse29 .cse57)) (or (< .cse19 .cse58) (< .cse59 .cse15)) (or (< .cse15 .cse20) (< .cse21 (+ .cse13 2 .cse14))) (or .cse37 .cse50 .cse38 .cse51 .cse39) (or (< .cse2 .cse60) (< .cse61 .cse9)) (or (< .cse21 (+ 2 .cse14 .cse41)) (< .cse40 .cse20)) (or (< .cse55 .cse58) (< .cse59 .cse40)) (or (< .cse48 .cse3) (< .cse0 (+ 2 .cse62 .cse63))) (or (< .cse48 .cse60) (< .cse61 .cse55)) (or (< .cse53 .cse8) (< .cse9 .cse56)) (or (< .cse9 .cse60) (< .cse61 .cse19)) (or (< .cse7 .cse42) (< .cse43 .cse2)) (or (< .cse4 .cse26) (< .cse23 .cse57)) (or (< .cse9 .cse58) (< .cse59 .cse19)) (or (< .cse53 .cse22) (< .cse19 .cse56)) (or (< .cse28 .cse42) (< .cse43 .cse44))))) is different from false [2024-11-13 01:43:11,648 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse6 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse23 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse24 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse29 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse30 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse11 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse12 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296)) (.cse17 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse14 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse15 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse19 (mod c_~a~0 4294967296)) (.cse27 (mod c_~b~0 4294967296)) (.cse18 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse31 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296))) (let ((.cse16 (+ .cse18 .cse31)) (.cse20 (< .cse31 .cse27)) (.cse25 (< .cse15 .cse19)) (.cse21 (< .cse27 (+ .cse14 1))) (.cse26 (< .cse19 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1))) (.cse22 (< .cse17 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse7 (+ .cse11 .cse12)) (.cse4 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse3 (+ .cse29 .cse30)) (.cse10 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse9 (+ .cse23 .cse24)) (.cse0 (+ (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296))) (.cse1 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse2 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse8 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse28 (+ .cse5 .cse6)) (.cse13 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296))) (and (or (< .cse0 (+ .cse1 4294967297)) (< (+ 4294967294 .cse2) .cse3)) (or (< .cse4 (+ .cse5 2 .cse6)) (< .cse7 (+ .cse8 1))) (or (< .cse9 (+ .cse4 1)) (< .cse10 (+ 2 .cse11 .cse12))) (or (< (+ 4294967294 .cse13) (+ .cse14 .cse15)) (< .cse16 (+ 4294967297 .cse17))) (or (< (+ .cse10 4294967294) .cse7) (< .cse9 (+ .cse4 4294967297))) (or (< .cse18 .cse19) .cse20 (< .cse19 (+ .cse15 1)) .cse21 .cse22) (or (< .cse1 (+ .cse23 2 .cse24)) (< .cse3 (+ .cse10 1))) (or .cse25 .cse26 (< .cse14 .cse27) .cse22) (or (< .cse28 (+ 4294967297 .cse13)) (< (+ .cse8 4294967294) .cse16)) (or (< .cse16 (+ .cse17 1)) (< .cse13 (+ .cse14 2 .cse15))) (or .cse20 .cse25 .cse21 .cse26 .cse22) (or (< .cse7 (+ .cse8 4294967297)) (< (+ .cse4 4294967294) .cse28)) (or (< .cse3 (+ .cse10 4294967297)) (< (+ .cse1 4294967294) .cse9)) (or (< .cse0 (+ .cse1 1)) (< .cse2 (+ .cse29 2 .cse30))) (or (< .cse8 (+ 2 .cse18 .cse31)) (< .cse28 (+ .cse13 1)))))) is different from false [2024-11-13 01:43:20,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse6 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse23 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse24 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse26 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse27 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse11 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse12 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296)) (.cse17 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse14 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse29 (mod c_~b~0 4294967296)) (.cse18 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse28 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296))) (let ((.cse16 (+ .cse18 .cse28)) (.cse20 (< .cse28 .cse29)) (.cse15 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse21 (< .cse29 (+ .cse14 1))) (.cse19 (mod c_~a~0 4294967296)) (.cse22 (< .cse17 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse7 (+ .cse11 .cse12)) (.cse4 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse3 (+ .cse26 .cse27)) (.cse10 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse9 (+ .cse23 .cse24)) (.cse0 (+ (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296))) (.cse1 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse2 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse8 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse25 (+ .cse5 .cse6)) (.cse13 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296))) (and (or (< .cse0 (+ .cse1 4294967297)) (< (+ 4294967294 .cse2) .cse3)) (or (< .cse4 (+ .cse5 2 .cse6)) (< .cse7 (+ .cse8 1))) (or (< .cse9 (+ .cse4 1)) (< .cse10 (+ 2 .cse11 .cse12))) (or (< (+ 4294967294 .cse13) (+ .cse14 .cse15)) (< .cse16 (+ 4294967297 .cse17))) (or (< (+ .cse10 4294967294) .cse7) (< .cse9 (+ .cse4 4294967297))) (or (< .cse18 .cse19) .cse20 (< .cse19 (+ .cse15 1)) .cse21 .cse22) (or (< .cse1 (+ .cse23 2 .cse24)) (< .cse3 (+ .cse10 1))) (or (< .cse25 (+ 4294967297 .cse13)) (< (+ .cse8 4294967294) .cse16)) (or (< .cse16 (+ .cse17 1)) (< .cse13 (+ .cse14 2 .cse15))) (or .cse20 (< .cse15 .cse19) .cse21 (< .cse19 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) .cse22) (or (< .cse7 (+ .cse8 4294967297)) (< (+ .cse4 4294967294) .cse25)) (or (< .cse3 (+ .cse10 4294967297)) (< (+ .cse1 4294967294) .cse9)) (or (< .cse0 (+ .cse1 1)) (< .cse2 (+ .cse26 2 .cse27))) (or (< .cse8 (+ 2 .cse18 .cse28)) (< .cse25 (+ .cse13 1)))))) is different from false [2024-11-13 01:43:22,401 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse25 (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296)) (.cse49 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse31 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse60 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse50 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse51 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse13 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse62 (mod c_~b~0 4294967296)) (.cse35 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse41 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse45 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse30 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse24 (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse11 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse21 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse61 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse47 (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296)) (.cse63 (mod (+ 7 c_thread2Thread1of1ForFork0_~i~1) 4294967296)) (.cse29 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse23 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse59 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse46 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296))) (let ((.cse1 (+ 2 .cse59 .cse46)) (.cse6 (+ 4294967294 .cse23)) (.cse5 (+ .cse29 4294967297)) (.cse17 (+ .cse47 .cse63)) (.cse16 (+ 4294967297 .cse61)) (.cse12 (+ 4294967294 .cse21)) (.cse10 (+ .cse0 1)) (.cse33 (+ .cse11 4294967294)) (.cse34 (+ .cse0 4294967297)) (.cse27 (+ .cse24 .cse63)) (.cse18 (+ .cse45 2 .cse30)) (.cse32 (+ .cse11 1)) (.cse15 (+ .cse35 .cse41)) (.cse37 (< .cse41 .cse62)) (.cse38 (< .cse62 (+ .cse13 1))) (.cse36 (mod c_~a~0 4294967296)) (.cse39 (< .cse61 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse14 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse20 (+ .cse61 1)) (.cse40 (+ .cse51 .cse35)) (.cse3 (+ .cse50 1)) (.cse48 (+ .cse45 .cse46)) (.cse52 (+ .cse59 .cse60)) (.cse8 (+ .cse51 2 .cse60)) (.cse57 (+ .cse50 4294967297)) (.cse58 (+ .cse0 4294967294)) (.cse7 (+ .cse49 .cse31)) (.cse2 (+ .cse45 .cse30)) (.cse4 (+ .cse24 .cse25)) (.cse26 (+ .cse29 1)) (.cse54 (+ .cse49 2 .cse31)) (.cse9 (+ .cse59 .cse46)) (.cse55 (+ 4294967297 .cse21)) (.cse56 (+ .cse50 4294967294)) (.cse22 (+ 2 .cse35 .cse41)) (.cse19 (+ .cse51 .cse60)) (.cse53 (+ .cse21 1)) (.cse28 (+ .cse49 .cse25)) (.cse42 (+ .cse11 4294967297)) (.cse43 (+ .cse29 4294967294)) (.cse44 (+ .cse30 .cse31))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse4 .cse5) (< .cse6 .cse7)) (or (< .cse0 .cse8) (< .cse9 .cse3)) (or (< .cse2 .cse10) (< .cse11 .cse1)) (or (< .cse12 (+ .cse13 .cse14)) (< .cse15 .cse16)) (or (< .cse17 6) (< 4 .cse4)) (or (< .cse11 .cse18) (< .cse7 .cse10)) (or (< .cse19 .cse20) (< .cse21 .cse22)) (or (< .cse23 (+ .cse24 2 .cse25)) (< .cse17 .cse26)) (or (< .cse27 .cse5) (< .cse6 .cse28)) (or (< .cse29 (+ 2 .cse30 .cse31)) (< .cse28 .cse32)) (or (< .cse33 .cse9) (< .cse2 .cse34)) (or (< .cse12 .cse15) (< .cse19 .cse16)) (or (< .cse35 .cse36) .cse37 (< .cse36 (+ .cse14 1)) .cse38 .cse39) (or (< .cse6 .cse4) (< .cse17 .cse5)) (or (< .cse17 4294967302) (< 4294967300 .cse4)) (or (< .cse33 .cse2) (< .cse7 .cse34)) (or (< .cse40 .cse16) (< .cse12 (+ .cse14 .cse41))) (or (< .cse4 .cse42) (< .cse43 .cse7)) (or (< .cse44 .cse10) (< .cse11 (+ .cse45 2 .cse46))) (< .cse47 4294967295) (or (< .cse33 .cse48) (< .cse44 .cse34)) (or (< .cse23 (+ .cse49 2 .cse25)) (< .cse27 .cse26)) (or (< .cse29 .cse18) (< .cse7 .cse32)) (or (< .cse50 (+ .cse51 2 .cse35)) (< .cse52 .cse53)) (or (< .cse4 .cse32) (< .cse29 .cse54)) (or (< .cse19 .cse55) (< .cse56 .cse15)) (or (< .cse15 .cse20) (< .cse21 (+ .cse13 2 .cse14))) (or .cse37 (< .cse14 .cse36) .cse38 (< .cse36 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) .cse39) (or (< .cse2 .cse57) (< .cse58 .cse9)) (or (< .cse21 (+ 2 .cse14 .cse41)) (< .cse40 .cse20)) (or (< .cse52 .cse55) (< .cse56 .cse40)) (or (< .cse48 .cse3) (< .cse0 (+ 2 .cse59 .cse60))) (or (< .cse48 .cse57) (< .cse58 .cse52)) (or (< .cse50 .cse8) (< .cse9 .cse53)) (or (< .cse9 .cse57) (< .cse58 .cse19)) (or (< .cse7 .cse42) (< .cse43 .cse2)) (or (< .cse4 .cse26) (< .cse23 .cse54)) (or (< .cse9 .cse55) (< .cse56 .cse19)) (or (< .cse50 .cse22) (< .cse19 .cse53)) (or (< .cse28 .cse42) (< .cse43 .cse44))))) is different from false Killed by 15