./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -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/test-hard1.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 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -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-17 13:09:57,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 13:09:57,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 13:09:57,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 13:09:57,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 13:09:57,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 13:09:57,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 13:09:57,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 13:09:57,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 13:09:57,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 13:09:57,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 13:09:57,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 13:09:57,152 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 13:09:57,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 13:09:57,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 13:09:57,155 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 13:09:57,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 13:09:57,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 13:09:57,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 13:09:57,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 13:09:57,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 13:09:57,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 13:09:57,161 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 13:09:57,161 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 13:09:57,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 13:09:57,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 13:09:57,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 13:09:57,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 13:09:57,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 13:09:57,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 13:09:57,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 13:09:57,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 13:09:57,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 13:09:57,164 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 13:09:57,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 13:09:57,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 13:09:57,165 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 13:09:57,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 13:09:57,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 13:09:57,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 13:09:57,166 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 13:09:57,166 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 -> 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 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 -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET [2024-10-17 13:09:57,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 13:09:57,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 13:09:57,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 13:09:57,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 13:09:57,439 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 13:09:57,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-10-17 13:09:58,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 13:09:59,044 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 13:09:59,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-10-17 13:09:59,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a88e16775/15a9ed7f83734b2188ddeff23dc10aa0/FLAGe19242265 [2024-10-17 13:09:59,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a88e16775/15a9ed7f83734b2188ddeff23dc10aa0 [2024-10-17 13:09:59,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 13:09:59,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 13:09:59,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 13:09:59,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 13:09:59,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 13:09:59,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 01:09:59" (1/1) ... [2024-10-17 13:09:59,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b2be11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:09:59, skipping insertion in model container [2024-10-17 13:09:59,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 01:09:59" (1/1) ... [2024-10-17 13:09:59,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 13:09:59,316 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/test-hard1.wvr.c[3425,3438] [2024-10-17 13:09:59,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 13:09:59,335 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 13:09:59,361 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/test-hard1.wvr.c[3425,3438] [2024-10-17 13:09:59,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 13:09:59,381 INFO L204 MainTranslator]: Completed translation [2024-10-17 13:09:59,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:09:59 WrapperNode [2024-10-17 13:09:59,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 13:09:59,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 13:09:59,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 13:09:59,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 13:09:59,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:09:59" (1/1) ... [2024-10-17 13:09:59,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:09:59" (1/1) ... [2024-10-17 13:09:59,418 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-10-17 13:09:59,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 13:09:59,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 13:09:59,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 13:09:59,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 13:09:59,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:09:59" (1/1) ... [2024-10-17 13:09:59,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:09:59" (1/1) ... [2024-10-17 13:09:59,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:09:59" (1/1) ... [2024-10-17 13:09:59,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:09:59" (1/1) ... [2024-10-17 13:09:59,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:09:59" (1/1) ... [2024-10-17 13:09:59,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:09:59" (1/1) ... [2024-10-17 13:09:59,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:09:59" (1/1) ... [2024-10-17 13:09:59,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:09:59" (1/1) ... [2024-10-17 13:09:59,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 13:09:59,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 13:09:59,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 13:09:59,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 13:09:59,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:09:59" (1/1) ... [2024-10-17 13:09:59,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 13:09:59,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:09:59,517 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-17 13:09:59,519 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-17 13:09:59,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 13:09:59,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-17 13:09:59,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-17 13:09:59,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-17 13:09:59,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-17 13:09:59,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-17 13:09:59,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-17 13:09:59,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-17 13:09:59,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-17 13:09:59,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 13:09:59,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-17 13:09:59,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-17 13:09:59,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 13:09:59,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 13:09:59,571 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 13:09:59,651 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 13:09:59,653 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 13:09:59,867 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 13:09:59,867 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 13:10:00,030 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 13:10:00,031 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-17 13:10:00,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 01:10:00 BoogieIcfgContainer [2024-10-17 13:10:00,031 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 13:10:00,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 13:10:00,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 13:10:00,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 13:10:00,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 01:09:59" (1/3) ... [2024-10-17 13:10:00,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e57ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 01:10:00, skipping insertion in model container [2024-10-17 13:10:00,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:09:59" (2/3) ... [2024-10-17 13:10:00,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e57ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 01:10:00, skipping insertion in model container [2024-10-17 13:10:00,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 01:10:00" (3/3) ... [2024-10-17 13:10:00,042 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-10-17 13:10:00,060 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 13:10:00,060 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 13:10:00,060 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 13:10:00,125 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-17 13:10:00,172 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 13:10:00,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 13:10:00,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:10:00,174 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-17 13:10:00,175 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-17 13:10:00,266 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 13:10:00,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:10:00,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 13:10:00,305 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;@427196bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 13:10:00,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-17 13:10:02,698 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 2 more)] === [2024-10-17 13:10:02,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1319336203, now seen corresponding path program 1 times [2024-10-17 13:10:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:02,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:03,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:03,298 INFO L85 PathProgramCache]: Analyzing trace with hash 564378240, now seen corresponding path program 1 times [2024-10-17 13:10:03,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:03,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:10:05,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:05,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:10:06,083 INFO L85 PathProgramCache]: Analyzing trace with hash -650195845, now seen corresponding path program 1 times [2024-10-17 13:10:06,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:06,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:06,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:06,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1928252765, now seen corresponding path program 1 times [2024-10-17 13:10:06,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-17 13:10:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-17 13:10:07,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1526022233, now seen corresponding path program 1 times [2024-10-17 13:10:07,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:07,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:10:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:08,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:10:09,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:10:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1752138499, now seen corresponding path program 1 times [2024-10-17 13:10:09,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:10:09,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096625142] [2024-10-17 13:10:09,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:09,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-17 13:10:10,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:10:10,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096625142] [2024-10-17 13:10:10,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096625142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:10:10,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:10:10,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-17 13:10:10,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130953753] [2024-10-17 13:10:10,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:10:10,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-17 13:10:10,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:10:10,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-17 13:10:10,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-17 13:10:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:10:10,223 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:10:10,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-17 13:10:10,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:10:10,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:10:10,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable0 [2024-10-17 13:10:10,662 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 2 more)] === [2024-10-17 13:10:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1765656764, now seen corresponding path program 1 times [2024-10-17 13:10:10,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:10,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:10,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:11,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1738458473, now seen corresponding path program 1 times [2024-10-17 13:10:11,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:11,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:10:13,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:13,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:10:15,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2103179361, now seen corresponding path program 1 times [2024-10-17 13:10:15,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:15,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-17 13:10:16,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:16,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-17 13:10:16,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:10:16,781 INFO L85 PathProgramCache]: Analyzing trace with hash -506789776, now seen corresponding path program 2 times [2024-10-17 13:10:16,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:10:16,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000810795] [2024-10-17 13:10:16,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:16,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 111 proven. 94 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 13:10:18,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:10:18,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000810795] [2024-10-17 13:10:18,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000810795] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 13:10:18,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519222665] [2024-10-17 13:10:18,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 13:10:18,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 13:10:18,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:10:18,801 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-17 13:10:18,802 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-17 13:10:18,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 13:10:18,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 13:10:18,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 13:10:18,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:10:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-17 13:10:19,040 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:10:19,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519222665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:10:19,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-17 13:10:19,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2024-10-17 13:10:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51577737] [2024-10-17 13:10:19,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:10:19,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 13:10:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:10:19,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 13:10:19,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2024-10-17 13:10:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:10:19,049 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:10:19,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:10:19,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:10:19,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:10:19,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:10:19,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:10:19,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-17 13:10:19,625 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,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14 [2024-10-17 13:10:19,626 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 2 more)] === [2024-10-17 13:10:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1765656771, now seen corresponding path program 1 times [2024-10-17 13:10:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:19,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1738458464, now seen corresponding path program 1 times [2024-10-17 13:10:20,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:20,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:10:21,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:21,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:10:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2103179370, now seen corresponding path program 1 times [2024-10-17 13:10:23,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:23,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-17 13:10:23,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:23,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-17 13:10:23,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:10:23,790 INFO L85 PathProgramCache]: Analyzing trace with hash 564381910, now seen corresponding path program 3 times [2024-10-17 13:10:23,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:10:23,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678248227] [2024-10-17 13:10:23,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:23,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-17 13:10:24,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:10:24,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678248227] [2024-10-17 13:10:24,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678248227] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 13:10:24,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171410634] [2024-10-17 13:10:24,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 13:10:24,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 13:10:24,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:10:24,201 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-17 13:10:24,203 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-17 13:10:24,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-17 13:10:24,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 13:10:24,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-17 13:10:24,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:10:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-17 13:10:24,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 13:10:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-17 13:10:24,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171410634] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 13:10:24,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 13:10:24,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-17 13:10:24,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896665392] [2024-10-17 13:10:24,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 13:10:24,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 13:10:24,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:10:24,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 13:10:24,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-17 13:10:24,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:10:24,545 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:10:24,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 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-17 13:10:24,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:10:24,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:10:24,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:10:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:10:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:10:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 13:10:25,517 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-17 13:10:25,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-10-17 13:10:25,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 13:10:25,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164568, now seen corresponding path program 1 times [2024-10-17 13:10:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:25,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:25,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:26,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1012446633, now seen corresponding path program 1 times [2024-10-17 13:10:26,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:26,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:26,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1243371769, now seen corresponding path program 1 times [2024-10-17 13:10:26,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:26,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:26,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1493601783, now seen corresponding path program 1 times [2024-10-17 13:10:26,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:26,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:26,983 INFO L85 PathProgramCache]: Analyzing trace with hash 148797668, now seen corresponding path program 1 times [2024-10-17 13:10:26,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:26,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-17 13:10:27,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:27,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-17 13:10:27,864 INFO L85 PathProgramCache]: Analyzing trace with hash -356756191, now seen corresponding path program 1 times [2024-10-17 13:10:27,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:27,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-17 13:10:28,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:28,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-17 13:10:28,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1946192339, now seen corresponding path program 1 times [2024-10-17 13:10:28,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:28,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-10-17 13:10:28,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:28,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-10-17 13:10:29,325 INFO L85 PathProgramCache]: Analyzing trace with hash 999052783, now seen corresponding path program 1 times [2024-10-17 13:10:29,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:29,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-17 13:10:29,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:29,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-17 13:10:29,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:10:29,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1323657417, now seen corresponding path program 4 times [2024-10-17 13:10:29,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:10:29,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947925865] [2024-10-17 13:10:29,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:29,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 438 proven. 298 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-17 13:10:34,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:10:34,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947925865] [2024-10-17 13:10:34,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947925865] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 13:10:34,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619434661] [2024-10-17 13:10:34,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-17 13:10:34,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 13:10:34,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:10:34,795 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-17 13:10:34,796 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-17 13:10:34,930 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-17 13:10:34,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 13:10:34,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 13:10:34,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:10:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-10-17 13:10:35,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:10:35,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619434661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:10:35,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-17 13:10:35,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [24] total 28 [2024-10-17 13:10:35,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138012210] [2024-10-17 13:10:35,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:10:35,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 13:10:35,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:10:35,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 13:10:35,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-10-17 13:10:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:10:35,050 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:10:35,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-17 13:10:35,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:10:35,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:10:35,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 13:10:35,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:10:35,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:10:35,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:10:35,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 13:10:35,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:10:35,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-17 13:10:35,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable32,SelfDestructingSolverStorable22,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-10-17 13:10:35,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 13:10:35,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164596, now seen corresponding path program 1 times [2024-10-17 13:10:35,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:35,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:35,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:36,007 INFO L85 PathProgramCache]: Analyzing trace with hash -749118961, now seen corresponding path program 1 times [2024-10-17 13:10:36,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:36,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:36,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash -396186417, now seen corresponding path program 1 times [2024-10-17 13:10:36,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:36,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:36,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1197215620, now seen corresponding path program 1 times [2024-10-17 13:10:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:36,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:36,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:37,000 INFO L85 PathProgramCache]: Analyzing trace with hash 368111905, now seen corresponding path program 1 times [2024-10-17 13:10:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:37,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:37,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:37,435 INFO L85 PathProgramCache]: Analyzing trace with hash -595742186, now seen corresponding path program 1 times [2024-10-17 13:10:37,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:37,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:37,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:37,917 INFO L85 PathProgramCache]: Analyzing trace with hash -955123052, now seen corresponding path program 1 times [2024-10-17 13:10:37,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:37,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:38,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:38,345 INFO L85 PathProgramCache]: Analyzing trace with hash 83246338, now seen corresponding path program 1 times [2024-10-17 13:10:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:38,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:38,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:10:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:10:38,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1650497023, now seen corresponding path program 1 times [2024-10-17 13:10:38,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:38,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 13:10:50,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:10:50,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:10:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:10:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 13:11:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash 25582910, now seen corresponding path program 1 times [2024-10-17 13:11:00,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:00,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:11:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-10-17 13:11:00,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:00,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:11:01,262 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-10-17 13:11:01,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1702001674, now seen corresponding path program 1 times [2024-10-17 13:11:01,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:01,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:11:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 35 proven. 537 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-17 13:11:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:15,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:11:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 35 proven. 537 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-17 13:11:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2146642938, now seen corresponding path program 1 times [2024-10-17 13:11:26,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:26,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:11:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 28 proven. 532 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 13:11:40,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:40,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:11:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 28 proven. 532 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 13:11:51,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:11:51,037 INFO L85 PathProgramCache]: Analyzing trace with hash 589879332, now seen corresponding path program 5 times [2024-10-17 13:11:51,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:11:51,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221650900] [2024-10-17 13:11:51,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:51,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:11:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 967 proven. 4 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2024-10-17 13:11:51,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:11:51,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221650900] [2024-10-17 13:11:51,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221650900] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 13:11:51,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921337700] [2024-10-17 13:11:51,595 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-17 13:11:51,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 13:11:51,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:11:51,596 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 13:11:51,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-17 13:11:51,815 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-10-17 13:11:51,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 13:11:51,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-17 13:11:51,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:11:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 986 proven. 82 refuted. 0 times theorem prover too weak. 1494 trivial. 0 not checked. [2024-10-17 13:11:51,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 13:11:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 967 proven. 4 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2024-10-17 13:11:52,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921337700] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 13:11:52,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 13:11:52,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2024-10-17 13:11:52,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371374555] [2024-10-17 13:11:52,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 13:11:52,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-17 13:11:52,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:11:52,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-17 13:11:52,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-17 13:11:52,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:11:52,045 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:11:52,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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-17 13:11:52,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:11:52,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:11:52,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 13:11:52,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:11:52,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:11:52,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:11:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:11:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 13:11:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:11:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-17 13:11:52,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-17 13:11:53,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable34,SelfDestructingSolverStorable45,SelfDestructingSolverStorable35,SelfDestructingSolverStorable46,SelfDestructingSolverStorable36,SelfDestructingSolverStorable47,SelfDestructingSolverStorable37,SelfDestructingSolverStorable48,SelfDestructingSolverStorable38,SelfDestructingSolverStorable49,SelfDestructingSolverStorable39 [2024-10-17 13:11:53,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 13:11:53,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164644, now seen corresponding path program 1 times [2024-10-17 13:11:53,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:53,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:53,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:11:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:53,303 INFO L85 PathProgramCache]: Analyzing trace with hash -749118913, now seen corresponding path program 1 times [2024-10-17 13:11:53,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:53,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:53,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:11:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:53,512 INFO L85 PathProgramCache]: Analyzing trace with hash -396186369, now seen corresponding path program 1 times [2024-10-17 13:11:53,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:53,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:53,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:11:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:53,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1197215572, now seen corresponding path program 1 times [2024-10-17 13:11:53,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:53,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:53,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:11:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash 368111953, now seen corresponding path program 1 times [2024-10-17 13:11:54,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:54,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:54,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:11:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:54,324 INFO L85 PathProgramCache]: Analyzing trace with hash -595742138, now seen corresponding path program 1 times [2024-10-17 13:11:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:54,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:54,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:11:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:54,712 INFO L85 PathProgramCache]: Analyzing trace with hash -955123004, now seen corresponding path program 1 times [2024-10-17 13:11:54,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:54,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:54,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:11:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:55,038 INFO L85 PathProgramCache]: Analyzing trace with hash 83246386, now seen corresponding path program 1 times [2024-10-17 13:11:55,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:55,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:11:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:11:55,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1650496975, now seen corresponding path program 1 times [2024-10-17 13:11:55,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:11:55,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:11:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:12:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 13:12:04,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:12:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:12:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:12:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 13:12:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2054584073, now seen corresponding path program 1 times [2024-10-17 13:12:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:12:13,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:12:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:12:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 46 proven. 502 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-17 13:12:27,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:12:27,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:12:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:12:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 46 proven. 502 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-17 13:12:40,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:12:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1596812803, now seen corresponding path program 6 times [2024-10-17 13:12:40,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:12:40,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604219215] [2024-10-17 13:12:40,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:12:40,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:12:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:12:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 319 proven. 1653 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-17 13:12:53,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:12:53,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604219215] [2024-10-17 13:12:53,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604219215] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 13:12:53,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101315763] [2024-10-17 13:12:53,456 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-17 13:12:53,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 13:12:53,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:12:53,458 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 13:12:53,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-17 13:12:53,808 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2024-10-17 13:12:53,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 13:12:53,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-10-17 13:12:53,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:13:22,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 227 proven. 1735 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-17 13:13:22,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 13:13:33,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 234 proven. 1757 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-17 13:13:33,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101315763] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 13:13:33,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 13:13:33,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 70, 95] total 241 [2024-10-17 13:13:33,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376421309] [2024-10-17 13:13:33,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 13:13:33,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 242 states [2024-10-17 13:13:33,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:13:33,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 242 interpolants. [2024-10-17 13:13:33,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12421, Invalid=45900, Unknown=1, NotChecked=0, Total=58322 [2024-10-17 13:13:33,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:13:33,301 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:13:33,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 242 states, 242 states have (on average 2.731404958677686) internal successors, (661), 241 states have internal predecessors, (661), 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-17 13:13:33,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:13:33,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:13:33,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 13:13:33,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:13:33,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-17 13:13:33,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:15:06,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:15:06,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:15:06,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 13:15:06,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:15:06,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-17 13:15:06,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 446 states. [2024-10-17 13:15:06,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-17 13:15:06,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable51,SelfDestructingSolverStorable62,SelfDestructingSolverStorable52,SelfDestructingSolverStorable63,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2024-10-17 13:15:06,808 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 13:15:06,969 INFO L85 PathProgramCache]: Analyzing trace with hash 916806546, now seen corresponding path program 1 times [2024-10-17 13:15:06,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:15:06,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:15:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:15:06,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:15:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:15:07,187 INFO L85 PathProgramCache]: Analyzing trace with hash 740751600, now seen corresponding path program 1 times [2024-10-17 13:15:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:15:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:15:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:15:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 306 proven. 3 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2024-10-17 13:15:07,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:15:07,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:15:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:15:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 306 proven. 3 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2024-10-17 13:15:08,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:15:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash 29873356, now seen corresponding path program 7 times [2024-10-17 13:15:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:15:08,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181234263] [2024-10-17 13:15:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:15:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:15:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:15:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 973 proven. 1 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-10-17 13:15:09,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:15:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181234263] [2024-10-17 13:15:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181234263] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 13:15:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55708672] [2024-10-17 13:15:09,093 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-17 13:15:09,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 13:15:09,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:15:09,094 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 13:15:09,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-17 13:15:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:15:09,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-17 13:15:09,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:15:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 973 proven. 1 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-10-17 13:15:09,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 13:15:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 907 proven. 394 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-10-17 13:15:09,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55708672] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 13:15:09,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 13:15:09,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 23] total 30 [2024-10-17 13:15:09,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209580660] [2024-10-17 13:15:09,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 13:15:09,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-17 13:15:09,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:15:09,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-17 13:15:09,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2024-10-17 13:15:09,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:15:09,878 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:15:09,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.833333333333333) internal successors, (145), 30 states have internal predecessors, (145), 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-17 13:15:09,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:15:09,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:15:09,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 13:15:09,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:15:09,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-17 13:15:09,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 446 states. [2024-10-17 13:15:09,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:15:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:15:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:15:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 13:15:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:15:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-17 13:15:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2024-10-17 13:15:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-17 13:15:12,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-17 13:15:12,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67 [2024-10-17 13:15:12,413 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 13:15:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash 916806574, now seen corresponding path program 1 times [2024-10-17 13:15:12,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:15:12,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:15:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:15:12,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:15:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:15:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1814554615, now seen corresponding path program 1 times [2024-10-17 13:15:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:15:12,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:15:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:15:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 123 proven. 772 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-17 13:15:19,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:15:19,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:15:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:15:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 123 proven. 772 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-17 13:15:24,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2049167267, now seen corresponding path program 1 times [2024-10-17 13:15:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:15:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:15:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:15:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 138 proven. 814 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-17 13:15:36,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:15:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:15:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:15:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 138 proven. 814 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-17 13:15:42,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:15:42,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1221599718, now seen corresponding path program 8 times [2024-10-17 13:15:42,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:15:42,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832008434] [2024-10-17 13:15:42,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:15:42,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:15:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:15:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 308 proven. 611 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-17 13:15:49,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:15:49,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832008434] [2024-10-17 13:15:49,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832008434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 13:15:49,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099409439] [2024-10-17 13:15:49,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 13:15:49,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 13:15:49,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:15:49,749 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 13:15:49,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-17 13:15:49,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 13:15:49,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 13:15:49,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-17 13:15:49,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:16:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 230 proven. 684 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-17 13:16:01,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 13:21:26,005 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse0 (* 36 c_~p1~0)) (.cse1 (* (- 36) c_~p1~0)) (.cse5 (< 36 c_~n2~0)) (.cse50 (* c_~p1~0 (- 39))) (.cse49 (* 39 c_~p1~0)) (.cse51 (< 39 c_~n2~0)) (.cse20 (< c_~n2~0 43)) (.cse26 (* 44 c_~p1~0)) (.cse27 (* (- 44) c_~p1~0)) (.cse30 (= c_~n2~0 43)) (.cse25 (* c_~p1~0 43)) (.cse24 (* c_~p1~0 (- 43))) (.cse21 (< 43 c_~n2~0)) (.cse41 (< 42 c_~n2~0)) (.cse36 (= 42 c_~n2~0)) (.cse38 (* 41 c_~p1~0)) (.cse37 (* (- 41) c_~p1~0)) (.cse35 (= 41 c_~n2~0)) (.cse31 (* 42 c_~p1~0)) (.cse32 (* c_~p1~0 (- 42))) (.cse19 (= 40 c_~n2~0)) (.cse42 (* (- 40) c_~p1~0)) (.cse43 (* 40 c_~p1~0)) (.cse46 (< 40 c_~n2~0)) (.cse18 (= c_~n2~0 39)) (.cse52 (< c_~n2~0 39)) (.cse8 (= c_~n2~0 38)) (.cse10 (* (- 37) c_~p1~0)) (.cse9 (* c_~p1~0 37)) (.cse13 (= c_~n2~0 37)) (.cse14 (* c_~p1~0 38)) (.cse15 (* (- 38) c_~p1~0)) (.cse7 (< 38 c_~n2~0)) (.cse6 (= c_~n2~0 36))) (and (or (let ((.cse2 (* (mod (* 1073741817 c_~p1~0) 1073741824) 4))) (and (or (and (forall ((v_z_95 Int)) (or (= (+ (* v_z_95 47985151859) 4294967296 c_~p2~0) (+ .cse0 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse1) 4294967296) 4294967296) .cse2)) (< (+ .cse2 v_z_95) 4294967296) (< 4294967295 v_z_95))) (forall ((v_z_95 Int)) (or (< 4294967295 (+ .cse2 v_z_95)) (= (+ .cse0 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse1) 4294967296) 4294967296) .cse2) (+ (* v_z_95 47985151859) c_~p2~0)) (< v_z_95 0))) (forall ((v_z_95 Int)) (let ((.cse4 (+ .cse0 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse1) 4294967296) 4294967296) .cse2)) (.cse3 (* v_z_95 47985151859))) (or (= (+ .cse3 4294967296 c_~p2~0) .cse4) (= .cse4 (+ .cse3 c_~p2~0)) (< 4294967295 v_z_95) (< v_z_95 0))))) .cse5) (or .cse6 (and (or .cse7 (and (or .cse8 (and (forall ((v_z_88 Int)) (or (< (+ .cse2 v_z_88) 4294967296) (= (+ .cse2 .cse9 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse10 c_~p2~0) 4294967296))) (+ (* v_z_88 49318072744) 4294967296 c_~p2~0)) (< 4294967295 v_z_88))) (forall ((v_z_88 Int)) (let ((.cse11 (+ .cse2 .cse9 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse10 c_~p2~0) 4294967296)))) (.cse12 (* v_z_88 49318072744))) (or (= .cse11 (+ .cse12 4294967296 c_~p2~0)) (< v_z_88 0) (= .cse11 (+ .cse12 c_~p2~0)) (< 4294967295 v_z_88)))) (forall ((v_z_88 Int)) (or (< v_z_88 0) (= (+ .cse2 .cse9 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse10 c_~p2~0) 4294967296))) (+ (* v_z_88 49318072744) c_~p2~0)) (< 4294967295 (+ .cse2 v_z_88)))))) (or .cse13 (and (forall ((v_z_87 Int)) (or (< 4294967295 (+ .cse2 v_z_87)) (= (+ .cse14 .cse2 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse15 c_~p2~0) 4294967296))) (+ (* v_z_87 50650993629) c_~p2~0)) (< v_z_87 0))) (forall ((v_z_87 Int)) (let ((.cse17 (* v_z_87 50650993629)) (.cse16 (+ .cse14 .cse2 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse15 c_~p2~0) 4294967296))))) (or (= .cse16 (+ .cse17 c_~p2~0)) (= (+ .cse17 4294967296 c_~p2~0) .cse16) (< v_z_87 0) (< 4294967295 v_z_87)))) (forall ((v_z_87 Int)) (or (= (+ (* v_z_87 50650993629) 4294967296 c_~p2~0) (+ .cse14 .cse2 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse15 c_~p2~0) 4294967296)))) (< (+ .cse2 v_z_87) 4294967296) (< 4294967295 v_z_87))))))) (or (and (or .cse18 (and (or .cse19 (and (or .cse20 (and (or .cse21 (and (forall ((v_z_91 Int)) (let ((.cse22 (+ .cse2 (* (div (+ .cse24 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse25)) (.cse23 (* v_z_91 57315598054))) (or (= .cse22 (+ .cse23 c_~p2~0)) (< v_z_91 0) (< 4294967295 v_z_91) (= .cse22 (+ 4294967296 .cse23 c_~p2~0))))) (forall ((v_z_91 Int)) (or (= (+ .cse2 (* (div (+ .cse24 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse25) (+ (* v_z_91 57315598054) c_~p2~0)) (< v_z_91 0) (< 4294967295 (+ .cse2 v_z_91)))) (forall ((v_z_91 Int)) (or (< 4294967295 v_z_91) (= (+ .cse2 (* (div (+ .cse24 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse25) (+ 4294967296 (* v_z_91 57315598054) c_~p2~0)) (< (+ .cse2 v_z_91) 4294967296))))) (or (and (forall ((v_z_90 Int)) (or (< (+ .cse2 v_z_90) 4294967296) (< 4294967295 v_z_90) (= (+ .cse2 .cse26 (* (div (+ (* v_z_90 58648518940) .cse27 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_90 58648518939) 4294967296 c_~p2~0)))) (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 (+ .cse2 v_z_90)) (= (+ .cse2 .cse26 (* (div (+ (* v_z_90 58648518940) .cse27 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_90 58648518939) c_~p2~0)))) (forall ((v_z_90 Int)) (let ((.cse28 (+ .cse2 .cse26 (* (div (+ (* v_z_90 58648518940) .cse27 c_~p2~0) 4294967296) 4294967296))) (.cse29 (* v_z_90 58648518939))) (or (< v_z_90 0) (= .cse28 (+ .cse29 c_~p2~0)) (< 4294967295 v_z_90) (= .cse28 (+ .cse29 4294967296 c_~p2~0)))))) .cse30))) (or (and (or (and (forall ((v_z_93 Int)) (or (< (+ .cse2 v_z_93) 4294967296) (< 4294967295 v_z_93) (= (+ .cse2 .cse31 (* (div (+ (* 55982677170 v_z_93) .cse32 c_~p2~0) 4294967296) 4294967296)) (+ 4294967296 (* 55982677169 v_z_93) c_~p2~0)))) (forall ((v_z_93 Int)) (let ((.cse33 (+ .cse2 .cse31 (* (div (+ (* 55982677170 v_z_93) .cse32 c_~p2~0) 4294967296) 4294967296))) (.cse34 (* 55982677169 v_z_93))) (or (< v_z_93 0) (< 4294967295 v_z_93) (= .cse33 (+ 4294967296 .cse34 c_~p2~0)) (= .cse33 (+ .cse34 c_~p2~0))))) (forall ((v_z_93 Int)) (or (< v_z_93 0) (< 4294967295 (+ .cse2 v_z_93)) (= (+ .cse2 .cse31 (* (div (+ (* 55982677170 v_z_93) .cse32 c_~p2~0) 4294967296) 4294967296)) (+ (* 55982677169 v_z_93) c_~p2~0))))) .cse35) (or .cse36 (and (forall ((v_z_92 Int)) (or (= (+ (* (div (+ .cse37 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse38 .cse2) (+ (* 54649756284 v_z_92) c_~p2~0)) (< 4294967295 (+ .cse2 v_z_92)) (< v_z_92 0))) (forall ((v_z_92 Int)) (let ((.cse39 (+ (* (div (+ .cse37 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse38 .cse2)) (.cse40 (* 54649756284 v_z_92))) (or (= .cse39 (+ .cse40 c_~p2~0)) (= .cse39 (+ .cse40 4294967296 c_~p2~0)) (< 4294967295 v_z_92) (< v_z_92 0)))) (forall ((v_z_92 Int)) (or (= (+ (* (div (+ .cse37 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse38 .cse2) (+ (* 54649756284 v_z_92) 4294967296 c_~p2~0)) (< 4294967295 v_z_92) (< (+ .cse2 v_z_92) 4294967296)))))) .cse41))) (or (and (forall ((v_z_94 Int)) (or (= (+ (* v_z_94 53316835399) 4294967296 c_~p2~0) (+ .cse2 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse42) 4294967296)) .cse43)) (< (+ .cse2 v_z_94) 4294967296) (< 4294967295 v_z_94))) (forall ((v_z_94 Int)) (or (< v_z_94 0) (= (+ .cse2 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse42) 4294967296)) .cse43) (+ (* v_z_94 53316835399) c_~p2~0)) (< 4294967295 (+ .cse2 v_z_94)))) (forall ((v_z_94 Int)) (let ((.cse45 (+ .cse2 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse42) 4294967296)) .cse43)) (.cse44 (* v_z_94 53316835399))) (or (< v_z_94 0) (= (+ .cse44 4294967296 c_~p2~0) .cse45) (= .cse45 (+ .cse44 c_~p2~0)) (< 4294967295 v_z_94))))) .cse46))) (or (and (forall ((v_z_89 Int)) (let ((.cse47 (+ .cse2 .cse49 (* (div (+ (* 51983914515 v_z_89) .cse50 c_~p2~0) 4294967296) 4294967296))) (.cse48 (* v_z_89 51983914514))) (or (= .cse47 (+ .cse48 c_~p2~0)) (< 4294967295 v_z_89) (= .cse47 (+ 4294967296 .cse48 c_~p2~0)) (< v_z_89 0)))) (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (= (+ .cse2 .cse49 (* (div (+ (* 51983914515 v_z_89) .cse50 c_~p2~0) 4294967296) 4294967296)) (+ 4294967296 (* v_z_89 51983914514) c_~p2~0)) (< (+ .cse2 v_z_89) 4294967296))) (forall ((v_z_89 Int)) (or (= (+ .cse2 .cse49 (* (div (+ (* 51983914515 v_z_89) .cse50 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_89 51983914514) c_~p2~0)) (< 4294967295 (+ .cse2 v_z_89)) (< v_z_89 0)))) .cse51)) .cse52))))) (not (= 29 c_~n1~0))) (or (not (= c_~n1~0 27)) (let ((.cse55 (* (mod (* 2147483635 c_~p1~0) 2147483648) 2))) (and (or (and (forall ((v_z_78 Int)) (let ((.cse53 (+ .cse0 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse1) 4294967296) 4294967296) .cse55)) (.cse54 (* v_z_78 62992853675))) (or (= .cse53 (+ c_~p2~0 .cse54)) (< 4294967295 v_z_78) (= .cse53 (+ 4294967296 c_~p2~0 .cse54)) (< v_z_78 0)))) (forall ((v_z_78 Int)) (or (< (+ v_z_78 .cse55) 4294967296) (< 4294967295 v_z_78) (= (+ .cse0 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse1) 4294967296) 4294967296) .cse55) (+ 4294967296 c_~p2~0 (* v_z_78 62992853675))))) (forall ((v_z_78 Int)) (or (< 4294967295 (+ v_z_78 .cse55)) (= (+ .cse0 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse1) 4294967296) 4294967296) .cse55) (+ c_~p2~0 (* v_z_78 62992853675))) (< v_z_78 0)))) .cse5) (or (and (or (and (or (and (forall ((v_z_81 Int)) (or (= (+ (* 68242258148 v_z_81) 4294967296 c_~p2~0) (+ (* 4294967296 (div (+ .cse50 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse49 .cse55)) (< 4294967295 v_z_81) (< (+ v_z_81 .cse55) 4294967296))) (forall ((v_z_81 Int)) (let ((.cse56 (* 68242258148 v_z_81)) (.cse57 (+ (* 4294967296 (div (+ .cse50 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse49 .cse55))) (or (= (+ .cse56 4294967296 c_~p2~0) .cse57) (< v_z_81 0) (< 4294967295 v_z_81) (= (+ .cse56 c_~p2~0) .cse57)))) (forall ((v_z_81 Int)) (or (< 4294967295 (+ v_z_81 .cse55)) (< v_z_81 0) (= (+ (* 68242258148 v_z_81) c_~p2~0) (+ (* 4294967296 (div (+ .cse50 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse49 .cse55))))) .cse51) (or (and (or (and (or .cse20 (and (or (and (forall ((v_z_85 Int)) (or (= (+ .cse26 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse27 c_~p2~0) 4294967296)) .cse55) (+ (* v_z_85 76991265603) c_~p2~0)) (< 4294967295 (+ v_z_85 .cse55)) (< v_z_85 0))) (forall ((v_z_85 Int)) (let ((.cse58 (+ .cse26 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse27 c_~p2~0) 4294967296)) .cse55)) (.cse59 (* v_z_85 76991265603))) (or (= .cse58 (+ .cse59 c_~p2~0)) (< 4294967295 v_z_85) (< v_z_85 0) (= .cse58 (+ .cse59 4294967296 c_~p2~0))))) (forall ((v_z_85 Int)) (or (< 4294967295 v_z_85) (= (+ .cse26 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse27 c_~p2~0) 4294967296)) .cse55) (+ (* v_z_85 76991265603) 4294967296 c_~p2~0)) (< (+ v_z_85 .cse55) 4294967296)))) .cse30) (or (and (forall ((v_z_86 Int)) (let ((.cse60 (+ .cse25 (* (div (+ (* v_z_86 75241464113) .cse24 c_~p2~0) 4294967296) 4294967296) .cse55)) (.cse61 (* v_z_86 75241464112))) (or (< v_z_86 0) (= .cse60 (+ .cse61 c_~p2~0)) (= .cse60 (+ .cse61 4294967296 c_~p2~0)) (< 4294967295 v_z_86)))) (forall ((v_z_86 Int)) (or (< v_z_86 0) (< 4294967295 (+ v_z_86 .cse55)) (= (+ .cse25 (* (div (+ (* v_z_86 75241464113) .cse24 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_86 75241464112) c_~p2~0)))) (forall ((v_z_86 Int)) (or (< (+ v_z_86 .cse55) 4294967296) (= (+ .cse25 (* (div (+ (* v_z_86 75241464113) .cse24 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_86 75241464112) 4294967296 c_~p2~0)) (< 4294967295 v_z_86)))) .cse21))) (or .cse41 (and (or .cse36 (and (forall ((v_z_83 Int)) (or (< 4294967295 v_z_83) (< (+ v_z_83 .cse55) 4294967296) (= (+ (* v_z_83 71741861130) 4294967296 c_~p2~0) (+ .cse38 (* (div (+ (* v_z_83 71741861131) .cse37 c_~p2~0) 4294967296) 4294967296) .cse55)))) (forall ((v_z_83 Int)) (let ((.cse63 (+ .cse38 (* (div (+ (* v_z_83 71741861131) .cse37 c_~p2~0) 4294967296) 4294967296) .cse55)) (.cse62 (* v_z_83 71741861130))) (or (< 4294967295 v_z_83) (= (+ .cse62 4294967296 c_~p2~0) .cse63) (< v_z_83 0) (= .cse63 (+ .cse62 c_~p2~0))))) (forall ((v_z_83 Int)) (or (< 4294967295 (+ v_z_83 .cse55)) (< v_z_83 0) (= (+ .cse38 (* (div (+ (* v_z_83 71741861131) .cse37 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_83 71741861130) c_~p2~0)))))) (or .cse35 (and (forall ((v_z_84 Int)) (or (< 4294967295 v_z_84) (< (+ v_z_84 .cse55) 4294967296) (= (+ .cse31 (* (div (+ .cse32 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse55) (+ 4294967296 (* v_z_84 73491662621) c_~p2~0)))) (forall ((v_z_84 Int)) (let ((.cse64 (+ .cse31 (* (div (+ .cse32 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse55)) (.cse65 (* v_z_84 73491662621))) (or (< 4294967295 v_z_84) (< v_z_84 0) (= .cse64 (+ 4294967296 .cse65 c_~p2~0)) (= .cse64 (+ .cse65 c_~p2~0))))) (forall ((v_z_84 Int)) (or (< v_z_84 0) (= (+ .cse31 (* (div (+ .cse32 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_84 73491662621) c_~p2~0)) (< 4294967295 (+ v_z_84 .cse55))))))))) .cse19) (or (and (forall ((v_z_82 Int)) (or (= (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse42) 4294967296) 4294967296) .cse55 .cse43) (+ (* 69992059639 v_z_82) c_~p2~0)) (< 4294967295 (+ v_z_82 .cse55)) (< v_z_82 0))) (forall ((v_z_82 Int)) (or (= (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse42) 4294967296) 4294967296) .cse55 .cse43) (+ (* 69992059639 v_z_82) 4294967296 c_~p2~0)) (< (+ v_z_82 .cse55) 4294967296) (< 4294967295 v_z_82))) (forall ((v_z_82 Int)) (let ((.cse66 (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse42) 4294967296) 4294967296) .cse55 .cse43)) (.cse67 (* 69992059639 v_z_82))) (or (= .cse66 (+ .cse67 c_~p2~0)) (= .cse66 (+ .cse67 4294967296 c_~p2~0)) (< 4294967295 v_z_82) (< v_z_82 0))))) .cse46)) .cse18)) .cse52) (or (and (or .cse8 (and (forall ((v_z_80 Int)) (let ((.cse69 (+ (* (div (+ (* v_z_80 64742655167) .cse10 c_~p2~0) 4294967296) 4294967296) .cse9 .cse55)) (.cse68 (* v_z_80 64742655166))) (or (< 4294967295 v_z_80) (= (+ .cse68 c_~p2~0) .cse69) (< v_z_80 0) (= .cse69 (+ .cse68 4294967296 c_~p2~0))))) (forall ((v_z_80 Int)) (or (< 4294967295 (+ v_z_80 .cse55)) (= (+ (* v_z_80 64742655166) c_~p2~0) (+ (* (div (+ (* v_z_80 64742655167) .cse10 c_~p2~0) 4294967296) 4294967296) .cse9 .cse55)) (< v_z_80 0))) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (= (+ (* (div (+ (* v_z_80 64742655167) .cse10 c_~p2~0) 4294967296) 4294967296) .cse9 .cse55) (+ (* v_z_80 64742655166) 4294967296 c_~p2~0)) (< (+ v_z_80 .cse55) 4294967296))))) (or .cse13 (and (forall ((v_z_79 Int)) (or (< (+ v_z_79 .cse55) 4294967296) (= (+ (* v_z_79 66492456657) 4294967296 c_~p2~0) (+ .cse14 (* (div (+ (* 66492456658 v_z_79) .cse15 c_~p2~0) 4294967296) 4294967296) .cse55)) (< 4294967295 v_z_79))) (forall ((v_z_79 Int)) (or (< v_z_79 0) (= (+ .cse14 (* (div (+ (* 66492456658 v_z_79) .cse15 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_79 66492456657) c_~p2~0)) (< 4294967295 (+ v_z_79 .cse55)))) (forall ((v_z_79 Int)) (let ((.cse71 (+ .cse14 (* (div (+ (* 66492456658 v_z_79) .cse15 c_~p2~0) 4294967296) 4294967296) .cse55)) (.cse70 (* v_z_79 66492456657))) (or (< v_z_79 0) (= (+ .cse70 4294967296 c_~p2~0) .cse71) (= .cse71 (+ .cse70 c_~p2~0)) (< 4294967295 v_z_79))))))) .cse7)) .cse6)))))) (= (mod c_thread1Thread1of1ForFork1_~cond~0 256) 0) (< c_~n2~0 36)) is different from false [2024-10-17 13:21:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 0 proven. 973 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-10-17 13:21:56,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099409439] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 13:21:56,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 13:21:56,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 42, 66] total 164 [2024-10-17 13:21:56,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393050773] [2024-10-17 13:21:56,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 13:21:56,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 165 states [2024-10-17 13:21:56,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:21:56,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2024-10-17 13:21:56,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4802, Invalid=21915, Unknown=19, NotChecked=324, Total=27060 [2024-10-17 13:21:56,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:21:56,112 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:21:56,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 165 states, 165 states have (on average 2.7696969696969695) internal successors, (457), 164 states have internal predecessors, (457), 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-17 13:21:56,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:21:56,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:21:56,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 13:21:56,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:21:56,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-17 13:21:56,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 450 states. [2024-10-17 13:21:56,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-17 13:21:56,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:22:21,561 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (<= 1 c_~n1~0)) (.cse0 (<= c_~n1~0 0)) (.cse74 (= c_~n2~0 c_~n1~0))) (and (or (and (= c_thread1Thread1of1ForFork1_~cond~0 0) .cse0) (and (= c_thread1Thread1of1ForFork1_~cond~0 1) .cse1)) (or (and (= c_thread2Thread1of1ForFork3_~cond~1 1) .cse1) (and .cse0 (= c_thread2Thread1of1ForFork3_~cond~1 0))) (or (let ((.cse2 (* 36 c_~p1~0)) (.cse3 (* (- 36) c_~p1~0)) (.cse7 (< 36 c_~n2~0)) (.cse52 (* c_~p1~0 (- 39))) (.cse51 (* 39 c_~p1~0)) (.cse53 (< 39 c_~n2~0)) (.cse22 (< c_~n2~0 43)) (.cse28 (* 44 c_~p1~0)) (.cse29 (* (- 44) c_~p1~0)) (.cse32 (= c_~n2~0 43)) (.cse27 (* c_~p1~0 43)) (.cse26 (* c_~p1~0 (- 43))) (.cse23 (< 43 c_~n2~0)) (.cse43 (< 42 c_~n2~0)) (.cse38 (= 42 c_~n2~0)) (.cse40 (* 41 c_~p1~0)) (.cse39 (* (- 41) c_~p1~0)) (.cse37 (= 41 c_~n2~0)) (.cse33 (* 42 c_~p1~0)) (.cse34 (* c_~p1~0 (- 42))) (.cse21 (= 40 c_~n2~0)) (.cse44 (* (- 40) c_~p1~0)) (.cse45 (* 40 c_~p1~0)) (.cse48 (< 40 c_~n2~0)) (.cse20 (= c_~n2~0 39)) (.cse54 (< c_~n2~0 39)) (.cse10 (= c_~n2~0 38)) (.cse12 (* (- 37) c_~p1~0)) (.cse11 (* c_~p1~0 37)) (.cse15 (= c_~n2~0 37)) (.cse16 (* c_~p1~0 38)) (.cse17 (* (- 38) c_~p1~0)) (.cse9 (< 38 c_~n2~0)) (.cse8 (= c_~n2~0 36))) (and (or (let ((.cse4 (* (mod (* 1073741817 c_~p1~0) 1073741824) 4))) (and (or (and (forall ((v_z_95 Int)) (or (= (+ (* v_z_95 47985151859) 4294967296 c_~p2~0) (+ .cse2 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse3) 4294967296) 4294967296) .cse4)) (< (+ .cse4 v_z_95) 4294967296) (< 4294967295 v_z_95))) (forall ((v_z_95 Int)) (or (< 4294967295 (+ .cse4 v_z_95)) (= (+ .cse2 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse3) 4294967296) 4294967296) .cse4) (+ (* v_z_95 47985151859) c_~p2~0)) (< v_z_95 0))) (forall ((v_z_95 Int)) (let ((.cse6 (+ .cse2 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse3) 4294967296) 4294967296) .cse4)) (.cse5 (* v_z_95 47985151859))) (or (= (+ .cse5 4294967296 c_~p2~0) .cse6) (= .cse6 (+ .cse5 c_~p2~0)) (< 4294967295 v_z_95) (< v_z_95 0))))) .cse7) (or .cse8 (and (or .cse9 (and (or .cse10 (and (forall ((v_z_88 Int)) (or (< (+ .cse4 v_z_88) 4294967296) (= (+ .cse4 .cse11 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse12 c_~p2~0) 4294967296))) (+ (* v_z_88 49318072744) 4294967296 c_~p2~0)) (< 4294967295 v_z_88))) (forall ((v_z_88 Int)) (let ((.cse13 (+ .cse4 .cse11 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse12 c_~p2~0) 4294967296)))) (.cse14 (* v_z_88 49318072744))) (or (= .cse13 (+ .cse14 4294967296 c_~p2~0)) (< v_z_88 0) (= .cse13 (+ .cse14 c_~p2~0)) (< 4294967295 v_z_88)))) (forall ((v_z_88 Int)) (or (< v_z_88 0) (= (+ .cse4 .cse11 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse12 c_~p2~0) 4294967296))) (+ (* v_z_88 49318072744) c_~p2~0)) (< 4294967295 (+ .cse4 v_z_88)))))) (or .cse15 (and (forall ((v_z_87 Int)) (or (< 4294967295 (+ .cse4 v_z_87)) (= (+ .cse16 .cse4 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse17 c_~p2~0) 4294967296))) (+ (* v_z_87 50650993629) c_~p2~0)) (< v_z_87 0))) (forall ((v_z_87 Int)) (let ((.cse19 (* v_z_87 50650993629)) (.cse18 (+ .cse16 .cse4 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse17 c_~p2~0) 4294967296))))) (or (= .cse18 (+ .cse19 c_~p2~0)) (= (+ .cse19 4294967296 c_~p2~0) .cse18) (< v_z_87 0) (< 4294967295 v_z_87)))) (forall ((v_z_87 Int)) (or (= (+ (* v_z_87 50650993629) 4294967296 c_~p2~0) (+ .cse16 .cse4 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse17 c_~p2~0) 4294967296)))) (< (+ .cse4 v_z_87) 4294967296) (< 4294967295 v_z_87))))))) (or (and (or .cse20 (and (or .cse21 (and (or .cse22 (and (or .cse23 (and (forall ((v_z_91 Int)) (let ((.cse24 (+ .cse4 (* (div (+ .cse26 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse27)) (.cse25 (* v_z_91 57315598054))) (or (= .cse24 (+ .cse25 c_~p2~0)) (< v_z_91 0) (< 4294967295 v_z_91) (= .cse24 (+ 4294967296 .cse25 c_~p2~0))))) (forall ((v_z_91 Int)) (or (= (+ .cse4 (* (div (+ .cse26 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse27) (+ (* v_z_91 57315598054) c_~p2~0)) (< v_z_91 0) (< 4294967295 (+ .cse4 v_z_91)))) (forall ((v_z_91 Int)) (or (< 4294967295 v_z_91) (= (+ .cse4 (* (div (+ .cse26 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse27) (+ 4294967296 (* v_z_91 57315598054) c_~p2~0)) (< (+ .cse4 v_z_91) 4294967296))))) (or (and (forall ((v_z_90 Int)) (or (< (+ .cse4 v_z_90) 4294967296) (< 4294967295 v_z_90) (= (+ .cse4 .cse28 (* (div (+ (* v_z_90 58648518940) .cse29 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_90 58648518939) 4294967296 c_~p2~0)))) (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 (+ .cse4 v_z_90)) (= (+ .cse4 .cse28 (* (div (+ (* v_z_90 58648518940) .cse29 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_90 58648518939) c_~p2~0)))) (forall ((v_z_90 Int)) (let ((.cse30 (+ .cse4 .cse28 (* (div (+ (* v_z_90 58648518940) .cse29 c_~p2~0) 4294967296) 4294967296))) (.cse31 (* v_z_90 58648518939))) (or (< v_z_90 0) (= .cse30 (+ .cse31 c_~p2~0)) (< 4294967295 v_z_90) (= .cse30 (+ .cse31 4294967296 c_~p2~0)))))) .cse32))) (or (and (or (and (forall ((v_z_93 Int)) (or (< (+ .cse4 v_z_93) 4294967296) (< 4294967295 v_z_93) (= (+ .cse4 .cse33 (* (div (+ (* 55982677170 v_z_93) .cse34 c_~p2~0) 4294967296) 4294967296)) (+ 4294967296 (* 55982677169 v_z_93) c_~p2~0)))) (forall ((v_z_93 Int)) (let ((.cse35 (+ .cse4 .cse33 (* (div (+ (* 55982677170 v_z_93) .cse34 c_~p2~0) 4294967296) 4294967296))) (.cse36 (* 55982677169 v_z_93))) (or (< v_z_93 0) (< 4294967295 v_z_93) (= .cse35 (+ 4294967296 .cse36 c_~p2~0)) (= .cse35 (+ .cse36 c_~p2~0))))) (forall ((v_z_93 Int)) (or (< v_z_93 0) (< 4294967295 (+ .cse4 v_z_93)) (= (+ .cse4 .cse33 (* (div (+ (* 55982677170 v_z_93) .cse34 c_~p2~0) 4294967296) 4294967296)) (+ (* 55982677169 v_z_93) c_~p2~0))))) .cse37) (or .cse38 (and (forall ((v_z_92 Int)) (or (= (+ (* (div (+ .cse39 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse40 .cse4) (+ (* 54649756284 v_z_92) c_~p2~0)) (< 4294967295 (+ .cse4 v_z_92)) (< v_z_92 0))) (forall ((v_z_92 Int)) (let ((.cse41 (+ (* (div (+ .cse39 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse40 .cse4)) (.cse42 (* 54649756284 v_z_92))) (or (= .cse41 (+ .cse42 c_~p2~0)) (= .cse41 (+ .cse42 4294967296 c_~p2~0)) (< 4294967295 v_z_92) (< v_z_92 0)))) (forall ((v_z_92 Int)) (or (= (+ (* (div (+ .cse39 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse40 .cse4) (+ (* 54649756284 v_z_92) 4294967296 c_~p2~0)) (< 4294967295 v_z_92) (< (+ .cse4 v_z_92) 4294967296)))))) .cse43))) (or (and (forall ((v_z_94 Int)) (or (= (+ (* v_z_94 53316835399) 4294967296 c_~p2~0) (+ .cse4 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse44) 4294967296)) .cse45)) (< (+ .cse4 v_z_94) 4294967296) (< 4294967295 v_z_94))) (forall ((v_z_94 Int)) (or (< v_z_94 0) (= (+ .cse4 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse44) 4294967296)) .cse45) (+ (* v_z_94 53316835399) c_~p2~0)) (< 4294967295 (+ .cse4 v_z_94)))) (forall ((v_z_94 Int)) (let ((.cse47 (+ .cse4 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse44) 4294967296)) .cse45)) (.cse46 (* v_z_94 53316835399))) (or (< v_z_94 0) (= (+ .cse46 4294967296 c_~p2~0) .cse47) (= .cse47 (+ .cse46 c_~p2~0)) (< 4294967295 v_z_94))))) .cse48))) (or (and (forall ((v_z_89 Int)) (let ((.cse49 (+ .cse4 .cse51 (* (div (+ (* 51983914515 v_z_89) .cse52 c_~p2~0) 4294967296) 4294967296))) (.cse50 (* v_z_89 51983914514))) (or (= .cse49 (+ .cse50 c_~p2~0)) (< 4294967295 v_z_89) (= .cse49 (+ 4294967296 .cse50 c_~p2~0)) (< v_z_89 0)))) (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (= (+ .cse4 .cse51 (* (div (+ (* 51983914515 v_z_89) .cse52 c_~p2~0) 4294967296) 4294967296)) (+ 4294967296 (* v_z_89 51983914514) c_~p2~0)) (< (+ .cse4 v_z_89) 4294967296))) (forall ((v_z_89 Int)) (or (= (+ .cse4 .cse51 (* (div (+ (* 51983914515 v_z_89) .cse52 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_89 51983914514) c_~p2~0)) (< 4294967295 (+ .cse4 v_z_89)) (< v_z_89 0)))) .cse53)) .cse54))))) (not (= 29 c_~n1~0))) (or (not (= c_~n1~0 27)) (let ((.cse57 (* (mod (* 2147483635 c_~p1~0) 2147483648) 2))) (and (or (and (forall ((v_z_78 Int)) (let ((.cse55 (+ .cse2 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse3) 4294967296) 4294967296) .cse57)) (.cse56 (* v_z_78 62992853675))) (or (= .cse55 (+ c_~p2~0 .cse56)) (< 4294967295 v_z_78) (= .cse55 (+ 4294967296 c_~p2~0 .cse56)) (< v_z_78 0)))) (forall ((v_z_78 Int)) (or (< (+ v_z_78 .cse57) 4294967296) (< 4294967295 v_z_78) (= (+ .cse2 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse3) 4294967296) 4294967296) .cse57) (+ 4294967296 c_~p2~0 (* v_z_78 62992853675))))) (forall ((v_z_78 Int)) (or (< 4294967295 (+ v_z_78 .cse57)) (= (+ .cse2 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse3) 4294967296) 4294967296) .cse57) (+ c_~p2~0 (* v_z_78 62992853675))) (< v_z_78 0)))) .cse7) (or (and (or (and (or (and (forall ((v_z_81 Int)) (or (= (+ (* 68242258148 v_z_81) 4294967296 c_~p2~0) (+ (* 4294967296 (div (+ .cse52 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse51 .cse57)) (< 4294967295 v_z_81) (< (+ v_z_81 .cse57) 4294967296))) (forall ((v_z_81 Int)) (let ((.cse58 (* 68242258148 v_z_81)) (.cse59 (+ (* 4294967296 (div (+ .cse52 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse51 .cse57))) (or (= (+ .cse58 4294967296 c_~p2~0) .cse59) (< v_z_81 0) (< 4294967295 v_z_81) (= (+ .cse58 c_~p2~0) .cse59)))) (forall ((v_z_81 Int)) (or (< 4294967295 (+ v_z_81 .cse57)) (< v_z_81 0) (= (+ (* 68242258148 v_z_81) c_~p2~0) (+ (* 4294967296 (div (+ .cse52 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse51 .cse57))))) .cse53) (or (and (or (and (or .cse22 (and (or (and (forall ((v_z_85 Int)) (or (= (+ .cse28 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse29 c_~p2~0) 4294967296)) .cse57) (+ (* v_z_85 76991265603) c_~p2~0)) (< 4294967295 (+ v_z_85 .cse57)) (< v_z_85 0))) (forall ((v_z_85 Int)) (let ((.cse60 (+ .cse28 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse29 c_~p2~0) 4294967296)) .cse57)) (.cse61 (* v_z_85 76991265603))) (or (= .cse60 (+ .cse61 c_~p2~0)) (< 4294967295 v_z_85) (< v_z_85 0) (= .cse60 (+ .cse61 4294967296 c_~p2~0))))) (forall ((v_z_85 Int)) (or (< 4294967295 v_z_85) (= (+ .cse28 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse29 c_~p2~0) 4294967296)) .cse57) (+ (* v_z_85 76991265603) 4294967296 c_~p2~0)) (< (+ v_z_85 .cse57) 4294967296)))) .cse32) (or (and (forall ((v_z_86 Int)) (let ((.cse62 (+ .cse27 (* (div (+ (* v_z_86 75241464113) .cse26 c_~p2~0) 4294967296) 4294967296) .cse57)) (.cse63 (* v_z_86 75241464112))) (or (< v_z_86 0) (= .cse62 (+ .cse63 c_~p2~0)) (= .cse62 (+ .cse63 4294967296 c_~p2~0)) (< 4294967295 v_z_86)))) (forall ((v_z_86 Int)) (or (< v_z_86 0) (< 4294967295 (+ v_z_86 .cse57)) (= (+ .cse27 (* (div (+ (* v_z_86 75241464113) .cse26 c_~p2~0) 4294967296) 4294967296) .cse57) (+ (* v_z_86 75241464112) c_~p2~0)))) (forall ((v_z_86 Int)) (or (< (+ v_z_86 .cse57) 4294967296) (= (+ .cse27 (* (div (+ (* v_z_86 75241464113) .cse26 c_~p2~0) 4294967296) 4294967296) .cse57) (+ (* v_z_86 75241464112) 4294967296 c_~p2~0)) (< 4294967295 v_z_86)))) .cse23))) (or .cse43 (and (or .cse38 (and (forall ((v_z_83 Int)) (or (< 4294967295 v_z_83) (< (+ v_z_83 .cse57) 4294967296) (= (+ (* v_z_83 71741861130) 4294967296 c_~p2~0) (+ .cse40 (* (div (+ (* v_z_83 71741861131) .cse39 c_~p2~0) 4294967296) 4294967296) .cse57)))) (forall ((v_z_83 Int)) (let ((.cse65 (+ .cse40 (* (div (+ (* v_z_83 71741861131) .cse39 c_~p2~0) 4294967296) 4294967296) .cse57)) (.cse64 (* v_z_83 71741861130))) (or (< 4294967295 v_z_83) (= (+ .cse64 4294967296 c_~p2~0) .cse65) (< v_z_83 0) (= .cse65 (+ .cse64 c_~p2~0))))) (forall ((v_z_83 Int)) (or (< 4294967295 (+ v_z_83 .cse57)) (< v_z_83 0) (= (+ .cse40 (* (div (+ (* v_z_83 71741861131) .cse39 c_~p2~0) 4294967296) 4294967296) .cse57) (+ (* v_z_83 71741861130) c_~p2~0)))))) (or .cse37 (and (forall ((v_z_84 Int)) (or (< 4294967295 v_z_84) (< (+ v_z_84 .cse57) 4294967296) (= (+ .cse33 (* (div (+ .cse34 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse57) (+ 4294967296 (* v_z_84 73491662621) c_~p2~0)))) (forall ((v_z_84 Int)) (let ((.cse66 (+ .cse33 (* (div (+ .cse34 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse57)) (.cse67 (* v_z_84 73491662621))) (or (< 4294967295 v_z_84) (< v_z_84 0) (= .cse66 (+ 4294967296 .cse67 c_~p2~0)) (= .cse66 (+ .cse67 c_~p2~0))))) (forall ((v_z_84 Int)) (or (< v_z_84 0) (= (+ .cse33 (* (div (+ .cse34 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse57) (+ (* v_z_84 73491662621) c_~p2~0)) (< 4294967295 (+ v_z_84 .cse57))))))))) .cse21) (or (and (forall ((v_z_82 Int)) (or (= (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse44) 4294967296) 4294967296) .cse57 .cse45) (+ (* 69992059639 v_z_82) c_~p2~0)) (< 4294967295 (+ v_z_82 .cse57)) (< v_z_82 0))) (forall ((v_z_82 Int)) (or (= (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse44) 4294967296) 4294967296) .cse57 .cse45) (+ (* 69992059639 v_z_82) 4294967296 c_~p2~0)) (< (+ v_z_82 .cse57) 4294967296) (< 4294967295 v_z_82))) (forall ((v_z_82 Int)) (let ((.cse68 (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse44) 4294967296) 4294967296) .cse57 .cse45)) (.cse69 (* 69992059639 v_z_82))) (or (= .cse68 (+ .cse69 c_~p2~0)) (= .cse68 (+ .cse69 4294967296 c_~p2~0)) (< 4294967295 v_z_82) (< v_z_82 0))))) .cse48)) .cse20)) .cse54) (or (and (or .cse10 (and (forall ((v_z_80 Int)) (let ((.cse71 (+ (* (div (+ (* v_z_80 64742655167) .cse12 c_~p2~0) 4294967296) 4294967296) .cse11 .cse57)) (.cse70 (* v_z_80 64742655166))) (or (< 4294967295 v_z_80) (= (+ .cse70 c_~p2~0) .cse71) (< v_z_80 0) (= .cse71 (+ .cse70 4294967296 c_~p2~0))))) (forall ((v_z_80 Int)) (or (< 4294967295 (+ v_z_80 .cse57)) (= (+ (* v_z_80 64742655166) c_~p2~0) (+ (* (div (+ (* v_z_80 64742655167) .cse12 c_~p2~0) 4294967296) 4294967296) .cse11 .cse57)) (< v_z_80 0))) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (= (+ (* (div (+ (* v_z_80 64742655167) .cse12 c_~p2~0) 4294967296) 4294967296) .cse11 .cse57) (+ (* v_z_80 64742655166) 4294967296 c_~p2~0)) (< (+ v_z_80 .cse57) 4294967296))))) (or .cse15 (and (forall ((v_z_79 Int)) (or (< (+ v_z_79 .cse57) 4294967296) (= (+ (* v_z_79 66492456657) 4294967296 c_~p2~0) (+ .cse16 (* (div (+ (* 66492456658 v_z_79) .cse17 c_~p2~0) 4294967296) 4294967296) .cse57)) (< 4294967295 v_z_79))) (forall ((v_z_79 Int)) (or (< v_z_79 0) (= (+ .cse16 (* (div (+ (* 66492456658 v_z_79) .cse17 c_~p2~0) 4294967296) 4294967296) .cse57) (+ (* v_z_79 66492456657) c_~p2~0)) (< 4294967295 (+ v_z_79 .cse57)))) (forall ((v_z_79 Int)) (let ((.cse73 (+ .cse16 (* (div (+ (* 66492456658 v_z_79) .cse17 c_~p2~0) 4294967296) 4294967296) .cse57)) (.cse72 (* v_z_79 66492456657))) (or (< v_z_79 0) (= (+ .cse72 4294967296 c_~p2~0) .cse73) (= .cse73 (+ .cse72 c_~p2~0)) (< 4294967295 v_z_79))))))) .cse9)) .cse8)))))) (= (mod c_thread1Thread1of1ForFork1_~cond~0 256) 0) (< c_~n2~0 36)) .cse74 (= (mod c_~p1~0 4294967296) (mod c_~p2~0 4294967296)) (or (< c_~n2~0 2) .cse74))) is different from false [2024-10-17 13:23:07,181 WARN L851 $PredicateComparison]: unable to prove that (and (or (and (= c_thread1Thread1of1ForFork1_~cond~0 0) (<= c_~n1~0 0)) (and (= c_thread1Thread1of1ForFork1_~cond~0 1) (<= 1 c_~n1~0))) (or (and (<= 1 c_thread2Thread1of1ForFork3_~cond~1) (<= (div c_thread2Thread1of1ForFork3_~cond~1 256) 0)) (and (<= (div c_thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 c_thread1Thread1of1ForFork1_~cond~0)) (< c_~n2~0 1)) (or (and (<= c_~n2~0 0) (= c_thread3Thread1of1ForFork0_~cond~2 0)) (and (<= 1 c_~n2~0) (= c_thread3Thread1of1ForFork0_~cond~2 1))) (or (let ((.cse0 (* 36 c_~p1~0)) (.cse1 (* (- 36) c_~p1~0)) (.cse5 (< 36 c_~n2~0)) (.cse50 (* c_~p1~0 (- 39))) (.cse49 (* 39 c_~p1~0)) (.cse51 (< 39 c_~n2~0)) (.cse20 (< c_~n2~0 43)) (.cse26 (* 44 c_~p1~0)) (.cse27 (* (- 44) c_~p1~0)) (.cse30 (= c_~n2~0 43)) (.cse25 (* c_~p1~0 43)) (.cse24 (* c_~p1~0 (- 43))) (.cse21 (< 43 c_~n2~0)) (.cse41 (< 42 c_~n2~0)) (.cse36 (= 42 c_~n2~0)) (.cse38 (* 41 c_~p1~0)) (.cse37 (* (- 41) c_~p1~0)) (.cse35 (= 41 c_~n2~0)) (.cse31 (* 42 c_~p1~0)) (.cse32 (* c_~p1~0 (- 42))) (.cse19 (= 40 c_~n2~0)) (.cse42 (* (- 40) c_~p1~0)) (.cse43 (* 40 c_~p1~0)) (.cse46 (< 40 c_~n2~0)) (.cse18 (= c_~n2~0 39)) (.cse52 (< c_~n2~0 39)) (.cse8 (= c_~n2~0 38)) (.cse10 (* (- 37) c_~p1~0)) (.cse9 (* c_~p1~0 37)) (.cse13 (= c_~n2~0 37)) (.cse14 (* c_~p1~0 38)) (.cse15 (* (- 38) c_~p1~0)) (.cse7 (< 38 c_~n2~0)) (.cse6 (= c_~n2~0 36))) (and (or (let ((.cse2 (* (mod (* 1073741817 c_~p1~0) 1073741824) 4))) (and (or (and (forall ((v_z_95 Int)) (or (= (+ (* v_z_95 47985151859) 4294967296 c_~p2~0) (+ .cse0 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse1) 4294967296) 4294967296) .cse2)) (< (+ .cse2 v_z_95) 4294967296) (< 4294967295 v_z_95))) (forall ((v_z_95 Int)) (or (< 4294967295 (+ .cse2 v_z_95)) (= (+ .cse0 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse1) 4294967296) 4294967296) .cse2) (+ (* v_z_95 47985151859) c_~p2~0)) (< v_z_95 0))) (forall ((v_z_95 Int)) (let ((.cse4 (+ .cse0 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse1) 4294967296) 4294967296) .cse2)) (.cse3 (* v_z_95 47985151859))) (or (= (+ .cse3 4294967296 c_~p2~0) .cse4) (= .cse4 (+ .cse3 c_~p2~0)) (< 4294967295 v_z_95) (< v_z_95 0))))) .cse5) (or .cse6 (and (or .cse7 (and (or .cse8 (and (forall ((v_z_88 Int)) (or (< (+ .cse2 v_z_88) 4294967296) (= (+ .cse2 .cse9 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse10 c_~p2~0) 4294967296))) (+ (* v_z_88 49318072744) 4294967296 c_~p2~0)) (< 4294967295 v_z_88))) (forall ((v_z_88 Int)) (let ((.cse11 (+ .cse2 .cse9 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse10 c_~p2~0) 4294967296)))) (.cse12 (* v_z_88 49318072744))) (or (= .cse11 (+ .cse12 4294967296 c_~p2~0)) (< v_z_88 0) (= .cse11 (+ .cse12 c_~p2~0)) (< 4294967295 v_z_88)))) (forall ((v_z_88 Int)) (or (< v_z_88 0) (= (+ .cse2 .cse9 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse10 c_~p2~0) 4294967296))) (+ (* v_z_88 49318072744) c_~p2~0)) (< 4294967295 (+ .cse2 v_z_88)))))) (or .cse13 (and (forall ((v_z_87 Int)) (or (< 4294967295 (+ .cse2 v_z_87)) (= (+ .cse14 .cse2 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse15 c_~p2~0) 4294967296))) (+ (* v_z_87 50650993629) c_~p2~0)) (< v_z_87 0))) (forall ((v_z_87 Int)) (let ((.cse17 (* v_z_87 50650993629)) (.cse16 (+ .cse14 .cse2 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse15 c_~p2~0) 4294967296))))) (or (= .cse16 (+ .cse17 c_~p2~0)) (= (+ .cse17 4294967296 c_~p2~0) .cse16) (< v_z_87 0) (< 4294967295 v_z_87)))) (forall ((v_z_87 Int)) (or (= (+ (* v_z_87 50650993629) 4294967296 c_~p2~0) (+ .cse14 .cse2 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse15 c_~p2~0) 4294967296)))) (< (+ .cse2 v_z_87) 4294967296) (< 4294967295 v_z_87))))))) (or (and (or .cse18 (and (or .cse19 (and (or .cse20 (and (or .cse21 (and (forall ((v_z_91 Int)) (let ((.cse22 (+ .cse2 (* (div (+ .cse24 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse25)) (.cse23 (* v_z_91 57315598054))) (or (= .cse22 (+ .cse23 c_~p2~0)) (< v_z_91 0) (< 4294967295 v_z_91) (= .cse22 (+ 4294967296 .cse23 c_~p2~0))))) (forall ((v_z_91 Int)) (or (= (+ .cse2 (* (div (+ .cse24 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse25) (+ (* v_z_91 57315598054) c_~p2~0)) (< v_z_91 0) (< 4294967295 (+ .cse2 v_z_91)))) (forall ((v_z_91 Int)) (or (< 4294967295 v_z_91) (= (+ .cse2 (* (div (+ .cse24 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse25) (+ 4294967296 (* v_z_91 57315598054) c_~p2~0)) (< (+ .cse2 v_z_91) 4294967296))))) (or (and (forall ((v_z_90 Int)) (or (< (+ .cse2 v_z_90) 4294967296) (< 4294967295 v_z_90) (= (+ .cse2 .cse26 (* (div (+ (* v_z_90 58648518940) .cse27 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_90 58648518939) 4294967296 c_~p2~0)))) (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 (+ .cse2 v_z_90)) (= (+ .cse2 .cse26 (* (div (+ (* v_z_90 58648518940) .cse27 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_90 58648518939) c_~p2~0)))) (forall ((v_z_90 Int)) (let ((.cse28 (+ .cse2 .cse26 (* (div (+ (* v_z_90 58648518940) .cse27 c_~p2~0) 4294967296) 4294967296))) (.cse29 (* v_z_90 58648518939))) (or (< v_z_90 0) (= .cse28 (+ .cse29 c_~p2~0)) (< 4294967295 v_z_90) (= .cse28 (+ .cse29 4294967296 c_~p2~0)))))) .cse30))) (or (and (or (and (forall ((v_z_93 Int)) (or (< (+ .cse2 v_z_93) 4294967296) (< 4294967295 v_z_93) (= (+ .cse2 .cse31 (* (div (+ (* 55982677170 v_z_93) .cse32 c_~p2~0) 4294967296) 4294967296)) (+ 4294967296 (* 55982677169 v_z_93) c_~p2~0)))) (forall ((v_z_93 Int)) (let ((.cse33 (+ .cse2 .cse31 (* (div (+ (* 55982677170 v_z_93) .cse32 c_~p2~0) 4294967296) 4294967296))) (.cse34 (* 55982677169 v_z_93))) (or (< v_z_93 0) (< 4294967295 v_z_93) (= .cse33 (+ 4294967296 .cse34 c_~p2~0)) (= .cse33 (+ .cse34 c_~p2~0))))) (forall ((v_z_93 Int)) (or (< v_z_93 0) (< 4294967295 (+ .cse2 v_z_93)) (= (+ .cse2 .cse31 (* (div (+ (* 55982677170 v_z_93) .cse32 c_~p2~0) 4294967296) 4294967296)) (+ (* 55982677169 v_z_93) c_~p2~0))))) .cse35) (or .cse36 (and (forall ((v_z_92 Int)) (or (= (+ (* (div (+ .cse37 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse38 .cse2) (+ (* 54649756284 v_z_92) c_~p2~0)) (< 4294967295 (+ .cse2 v_z_92)) (< v_z_92 0))) (forall ((v_z_92 Int)) (let ((.cse39 (+ (* (div (+ .cse37 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse38 .cse2)) (.cse40 (* 54649756284 v_z_92))) (or (= .cse39 (+ .cse40 c_~p2~0)) (= .cse39 (+ .cse40 4294967296 c_~p2~0)) (< 4294967295 v_z_92) (< v_z_92 0)))) (forall ((v_z_92 Int)) (or (= (+ (* (div (+ .cse37 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse38 .cse2) (+ (* 54649756284 v_z_92) 4294967296 c_~p2~0)) (< 4294967295 v_z_92) (< (+ .cse2 v_z_92) 4294967296)))))) .cse41))) (or (and (forall ((v_z_94 Int)) (or (= (+ (* v_z_94 53316835399) 4294967296 c_~p2~0) (+ .cse2 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse42) 4294967296)) .cse43)) (< (+ .cse2 v_z_94) 4294967296) (< 4294967295 v_z_94))) (forall ((v_z_94 Int)) (or (< v_z_94 0) (= (+ .cse2 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse42) 4294967296)) .cse43) (+ (* v_z_94 53316835399) c_~p2~0)) (< 4294967295 (+ .cse2 v_z_94)))) (forall ((v_z_94 Int)) (let ((.cse45 (+ .cse2 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse42) 4294967296)) .cse43)) (.cse44 (* v_z_94 53316835399))) (or (< v_z_94 0) (= (+ .cse44 4294967296 c_~p2~0) .cse45) (= .cse45 (+ .cse44 c_~p2~0)) (< 4294967295 v_z_94))))) .cse46))) (or (and (forall ((v_z_89 Int)) (let ((.cse47 (+ .cse2 .cse49 (* (div (+ (* 51983914515 v_z_89) .cse50 c_~p2~0) 4294967296) 4294967296))) (.cse48 (* v_z_89 51983914514))) (or (= .cse47 (+ .cse48 c_~p2~0)) (< 4294967295 v_z_89) (= .cse47 (+ 4294967296 .cse48 c_~p2~0)) (< v_z_89 0)))) (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (= (+ .cse2 .cse49 (* (div (+ (* 51983914515 v_z_89) .cse50 c_~p2~0) 4294967296) 4294967296)) (+ 4294967296 (* v_z_89 51983914514) c_~p2~0)) (< (+ .cse2 v_z_89) 4294967296))) (forall ((v_z_89 Int)) (or (= (+ .cse2 .cse49 (* (div (+ (* 51983914515 v_z_89) .cse50 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_89 51983914514) c_~p2~0)) (< 4294967295 (+ .cse2 v_z_89)) (< v_z_89 0)))) .cse51)) .cse52))))) (not (= 29 c_~n1~0))) (or (not (= c_~n1~0 27)) (let ((.cse55 (* (mod (* 2147483635 c_~p1~0) 2147483648) 2))) (and (or (and (forall ((v_z_78 Int)) (let ((.cse53 (+ .cse0 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse1) 4294967296) 4294967296) .cse55)) (.cse54 (* v_z_78 62992853675))) (or (= .cse53 (+ c_~p2~0 .cse54)) (< 4294967295 v_z_78) (= .cse53 (+ 4294967296 c_~p2~0 .cse54)) (< v_z_78 0)))) (forall ((v_z_78 Int)) (or (< (+ v_z_78 .cse55) 4294967296) (< 4294967295 v_z_78) (= (+ .cse0 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse1) 4294967296) 4294967296) .cse55) (+ 4294967296 c_~p2~0 (* v_z_78 62992853675))))) (forall ((v_z_78 Int)) (or (< 4294967295 (+ v_z_78 .cse55)) (= (+ .cse0 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse1) 4294967296) 4294967296) .cse55) (+ c_~p2~0 (* v_z_78 62992853675))) (< v_z_78 0)))) .cse5) (or (and (or (and (or (and (forall ((v_z_81 Int)) (or (= (+ (* 68242258148 v_z_81) 4294967296 c_~p2~0) (+ (* 4294967296 (div (+ .cse50 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse49 .cse55)) (< 4294967295 v_z_81) (< (+ v_z_81 .cse55) 4294967296))) (forall ((v_z_81 Int)) (let ((.cse56 (* 68242258148 v_z_81)) (.cse57 (+ (* 4294967296 (div (+ .cse50 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse49 .cse55))) (or (= (+ .cse56 4294967296 c_~p2~0) .cse57) (< v_z_81 0) (< 4294967295 v_z_81) (= (+ .cse56 c_~p2~0) .cse57)))) (forall ((v_z_81 Int)) (or (< 4294967295 (+ v_z_81 .cse55)) (< v_z_81 0) (= (+ (* 68242258148 v_z_81) c_~p2~0) (+ (* 4294967296 (div (+ .cse50 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse49 .cse55))))) .cse51) (or (and (or (and (or .cse20 (and (or (and (forall ((v_z_85 Int)) (or (= (+ .cse26 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse27 c_~p2~0) 4294967296)) .cse55) (+ (* v_z_85 76991265603) c_~p2~0)) (< 4294967295 (+ v_z_85 .cse55)) (< v_z_85 0))) (forall ((v_z_85 Int)) (let ((.cse58 (+ .cse26 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse27 c_~p2~0) 4294967296)) .cse55)) (.cse59 (* v_z_85 76991265603))) (or (= .cse58 (+ .cse59 c_~p2~0)) (< 4294967295 v_z_85) (< v_z_85 0) (= .cse58 (+ .cse59 4294967296 c_~p2~0))))) (forall ((v_z_85 Int)) (or (< 4294967295 v_z_85) (= (+ .cse26 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse27 c_~p2~0) 4294967296)) .cse55) (+ (* v_z_85 76991265603) 4294967296 c_~p2~0)) (< (+ v_z_85 .cse55) 4294967296)))) .cse30) (or (and (forall ((v_z_86 Int)) (let ((.cse60 (+ .cse25 (* (div (+ (* v_z_86 75241464113) .cse24 c_~p2~0) 4294967296) 4294967296) .cse55)) (.cse61 (* v_z_86 75241464112))) (or (< v_z_86 0) (= .cse60 (+ .cse61 c_~p2~0)) (= .cse60 (+ .cse61 4294967296 c_~p2~0)) (< 4294967295 v_z_86)))) (forall ((v_z_86 Int)) (or (< v_z_86 0) (< 4294967295 (+ v_z_86 .cse55)) (= (+ .cse25 (* (div (+ (* v_z_86 75241464113) .cse24 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_86 75241464112) c_~p2~0)))) (forall ((v_z_86 Int)) (or (< (+ v_z_86 .cse55) 4294967296) (= (+ .cse25 (* (div (+ (* v_z_86 75241464113) .cse24 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_86 75241464112) 4294967296 c_~p2~0)) (< 4294967295 v_z_86)))) .cse21))) (or .cse41 (and (or .cse36 (and (forall ((v_z_83 Int)) (or (< 4294967295 v_z_83) (< (+ v_z_83 .cse55) 4294967296) (= (+ (* v_z_83 71741861130) 4294967296 c_~p2~0) (+ .cse38 (* (div (+ (* v_z_83 71741861131) .cse37 c_~p2~0) 4294967296) 4294967296) .cse55)))) (forall ((v_z_83 Int)) (let ((.cse63 (+ .cse38 (* (div (+ (* v_z_83 71741861131) .cse37 c_~p2~0) 4294967296) 4294967296) .cse55)) (.cse62 (* v_z_83 71741861130))) (or (< 4294967295 v_z_83) (= (+ .cse62 4294967296 c_~p2~0) .cse63) (< v_z_83 0) (= .cse63 (+ .cse62 c_~p2~0))))) (forall ((v_z_83 Int)) (or (< 4294967295 (+ v_z_83 .cse55)) (< v_z_83 0) (= (+ .cse38 (* (div (+ (* v_z_83 71741861131) .cse37 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_83 71741861130) c_~p2~0)))))) (or .cse35 (and (forall ((v_z_84 Int)) (or (< 4294967295 v_z_84) (< (+ v_z_84 .cse55) 4294967296) (= (+ .cse31 (* (div (+ .cse32 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse55) (+ 4294967296 (* v_z_84 73491662621) c_~p2~0)))) (forall ((v_z_84 Int)) (let ((.cse64 (+ .cse31 (* (div (+ .cse32 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse55)) (.cse65 (* v_z_84 73491662621))) (or (< 4294967295 v_z_84) (< v_z_84 0) (= .cse64 (+ 4294967296 .cse65 c_~p2~0)) (= .cse64 (+ .cse65 c_~p2~0))))) (forall ((v_z_84 Int)) (or (< v_z_84 0) (= (+ .cse31 (* (div (+ .cse32 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_84 73491662621) c_~p2~0)) (< 4294967295 (+ v_z_84 .cse55))))))))) .cse19) (or (and (forall ((v_z_82 Int)) (or (= (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse42) 4294967296) 4294967296) .cse55 .cse43) (+ (* 69992059639 v_z_82) c_~p2~0)) (< 4294967295 (+ v_z_82 .cse55)) (< v_z_82 0))) (forall ((v_z_82 Int)) (or (= (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse42) 4294967296) 4294967296) .cse55 .cse43) (+ (* 69992059639 v_z_82) 4294967296 c_~p2~0)) (< (+ v_z_82 .cse55) 4294967296) (< 4294967295 v_z_82))) (forall ((v_z_82 Int)) (let ((.cse66 (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse42) 4294967296) 4294967296) .cse55 .cse43)) (.cse67 (* 69992059639 v_z_82))) (or (= .cse66 (+ .cse67 c_~p2~0)) (= .cse66 (+ .cse67 4294967296 c_~p2~0)) (< 4294967295 v_z_82) (< v_z_82 0))))) .cse46)) .cse18)) .cse52) (or (and (or .cse8 (and (forall ((v_z_80 Int)) (let ((.cse69 (+ (* (div (+ (* v_z_80 64742655167) .cse10 c_~p2~0) 4294967296) 4294967296) .cse9 .cse55)) (.cse68 (* v_z_80 64742655166))) (or (< 4294967295 v_z_80) (= (+ .cse68 c_~p2~0) .cse69) (< v_z_80 0) (= .cse69 (+ .cse68 4294967296 c_~p2~0))))) (forall ((v_z_80 Int)) (or (< 4294967295 (+ v_z_80 .cse55)) (= (+ (* v_z_80 64742655166) c_~p2~0) (+ (* (div (+ (* v_z_80 64742655167) .cse10 c_~p2~0) 4294967296) 4294967296) .cse9 .cse55)) (< v_z_80 0))) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (= (+ (* (div (+ (* v_z_80 64742655167) .cse10 c_~p2~0) 4294967296) 4294967296) .cse9 .cse55) (+ (* v_z_80 64742655166) 4294967296 c_~p2~0)) (< (+ v_z_80 .cse55) 4294967296))))) (or .cse13 (and (forall ((v_z_79 Int)) (or (< (+ v_z_79 .cse55) 4294967296) (= (+ (* v_z_79 66492456657) 4294967296 c_~p2~0) (+ .cse14 (* (div (+ (* 66492456658 v_z_79) .cse15 c_~p2~0) 4294967296) 4294967296) .cse55)) (< 4294967295 v_z_79))) (forall ((v_z_79 Int)) (or (< v_z_79 0) (= (+ .cse14 (* (div (+ (* 66492456658 v_z_79) .cse15 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_79 66492456657) c_~p2~0)) (< 4294967295 (+ v_z_79 .cse55)))) (forall ((v_z_79 Int)) (let ((.cse71 (+ .cse14 (* (div (+ (* 66492456658 v_z_79) .cse15 c_~p2~0) 4294967296) 4294967296) .cse55)) (.cse70 (* v_z_79 66492456657))) (or (< v_z_79 0) (= (+ .cse70 4294967296 c_~p2~0) .cse71) (= .cse71 (+ .cse70 c_~p2~0)) (< 4294967295 v_z_79))))))) .cse7)) .cse6)))))) (= (mod c_thread1Thread1of1ForFork1_~cond~0 256) 0) (< c_~n2~0 36)) (= c_~n2~0 c_~n1~0) (= (mod c_~p1~0 4294967296) (mod c_~p2~0 4294967296))) is different from false Killed by 15