./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 IA --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -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 IA --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -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-18 17:48:41,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 17:48:42,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 17:48:42,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 17:48:42,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 17:48:42,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 17:48:42,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 17:48:42,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 17:48:42,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 17:48:42,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 17:48:42,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 17:48:42,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 17:48:42,079 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 17:48:42,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 17:48:42,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 17:48:42,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 17:48:42,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 17:48:42,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 17:48:42,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 17:48:42,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 17:48:42,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 17:48:42,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 17:48:42,081 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 17:48:42,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 17:48:42,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 17:48:42,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 17:48:42,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 17:48:42,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 17:48:42,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 17:48:42,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 17:48:42,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 17:48:42,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 17:48:42,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 17:48:42,084 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 17:48:42,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 17:48:42,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 17:48:42,084 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 17:48:42,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 17:48:42,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 17:48:42,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 17:48:42,085 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 17:48:42,086 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 -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP [2024-10-18 17:48:42,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 17:48:42,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 17:48:42,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 17:48:42,297 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 17:48:42,298 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 17:48:42,298 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-18 17:48:43,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 17:48:43,881 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 17:48:43,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-10-18 17:48:43,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f2648c82f/7361a3b77efc48588d3b9483aa376b4a/FLAGc075c49ae [2024-10-18 17:48:43,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f2648c82f/7361a3b77efc48588d3b9483aa376b4a [2024-10-18 17:48:43,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 17:48:43,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 17:48:43,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 17:48:43,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 17:48:43,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 17:48:43,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 05:48:43" (1/1) ... [2024-10-18 17:48:43,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b89423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:48:43, skipping insertion in model container [2024-10-18 17:48:43,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 05:48:43" (1/1) ... [2024-10-18 17:48:43,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 17:48:44,111 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-18 17:48:44,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 17:48:44,125 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 17:48:44,144 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-18 17:48:44,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 17:48:44,157 INFO L204 MainTranslator]: Completed translation [2024-10-18 17:48:44,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:48:44 WrapperNode [2024-10-18 17:48:44,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 17:48:44,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 17:48:44,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 17:48:44,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 17:48:44,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:48:44" (1/1) ... [2024-10-18 17:48:44,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:48:44" (1/1) ... [2024-10-18 17:48:44,185 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-10-18 17:48:44,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 17:48:44,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 17:48:44,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 17:48:44,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 17:48:44,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:48:44" (1/1) ... [2024-10-18 17:48:44,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:48:44" (1/1) ... [2024-10-18 17:48:44,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:48:44" (1/1) ... [2024-10-18 17:48:44,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:48:44" (1/1) ... [2024-10-18 17:48:44,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:48:44" (1/1) ... [2024-10-18 17:48:44,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:48:44" (1/1) ... [2024-10-18 17:48:44,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:48:44" (1/1) ... [2024-10-18 17:48:44,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:48:44" (1/1) ... [2024-10-18 17:48:44,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 17:48:44,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 17:48:44,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 17:48:44,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 17:48:44,210 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:48:44" (1/1) ... [2024-10-18 17:48:44,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 17:48:44,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:48:44,241 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-18 17:48:44,243 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-18 17:48:44,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 17:48:44,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-18 17:48:44,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-18 17:48:44,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-18 17:48:44,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-18 17:48:44,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-18 17:48:44,276 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-18 17:48:44,276 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-18 17:48:44,276 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-18 17:48:44,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 17:48:44,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 17:48:44,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 17:48:44,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 17:48:44,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 17:48:44,280 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 17:48:44,391 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 17:48:44,392 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 17:48:44,559 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 17:48:44,560 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 17:48:44,688 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 17:48:44,689 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-18 17:48:44,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 05:48:44 BoogieIcfgContainer [2024-10-18 17:48:44,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 17:48:44,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 17:48:44,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 17:48:44,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 17:48:44,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 05:48:43" (1/3) ... [2024-10-18 17:48:44,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5886748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 05:48:44, skipping insertion in model container [2024-10-18 17:48:44,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:48:44" (2/3) ... [2024-10-18 17:48:44,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5886748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 05:48:44, skipping insertion in model container [2024-10-18 17:48:44,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 05:48:44" (3/3) ... [2024-10-18 17:48:44,701 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-10-18 17:48:44,715 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 17:48:44,716 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 17:48:44,716 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 17:48:44,785 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-18 17:48:44,824 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 17:48:44,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 17:48:44,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:48:44,828 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-18 17:48:44,830 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-18 17:48:44,921 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 17:48:44,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 17:48:44,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 17:48:44,944 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;@5270a4be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 17:48:44,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-18 17:48:46,680 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-18 17:48:46,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 17:48:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1752138499, now seen corresponding path program 1 times [2024-10-18 17:48:46,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 17:48:46,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283705153] [2024-10-18 17:48:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:48:47,305 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-18 17:48:47,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 17:48:47,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283705153] [2024-10-18 17:48:47,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283705153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 17:48:47,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 17:48:47,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-18 17:48:47,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133233428] [2024-10-18 17:48:47,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 17:48:47,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-18 17:48:47,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 17:48:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1319336203, now seen corresponding path program 1 times [2024-10-18 17:48:47,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:47,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:48:47,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:48:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:48:47,652 INFO L85 PathProgramCache]: Analyzing trace with hash 564378240, now seen corresponding path program 1 times [2024-10-18 17:48:47,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:47,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:48:48,772 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-18 17:48:48,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:48,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:48:49,350 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-18 17:48:49,454 INFO L85 PathProgramCache]: Analyzing trace with hash -650195845, now seen corresponding path program 1 times [2024-10-18 17:48:49,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:48:49,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:48:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:48:49,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-18 17:48:49,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-10-18 17:48:49,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:48:49,636 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 17:48:49,636 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-18 17:48:49,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:48:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:48:49,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable0 [2024-10-18 17:48:49,959 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-18 17:48:49,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 17:48:49,960 INFO L85 PathProgramCache]: Analyzing trace with hash -506789776, now seen corresponding path program 2 times [2024-10-18 17:48:49,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 17:48:49,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819895453] [2024-10-18 17:48:49,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:49,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:48:51,983 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-18 17:48:51,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 17:48:51,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819895453] [2024-10-18 17:48:51,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819895453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 17:48:51,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129595428] [2024-10-18 17:48:51,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 17:48:51,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 17:48:51,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:48:52,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 17:48:52,047 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-18 17:48:52,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 17:48:52,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 17:48:52,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 17:48:52,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 17:48:52,271 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-18 17:48:52,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 17:48:52,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129595428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 17:48:52,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 17:48:52,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2024-10-18 17:48:52,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867792101] [2024-10-18 17:48:52,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 17:48:52,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 17:48:52,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 17:48:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1046334922, now seen corresponding path program 1 times [2024-10-18 17:48:52,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:52,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:48:52,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:48:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:48:52,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2119310385, now seen corresponding path program 1 times [2024-10-18 17:48:52,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:52,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:48:52,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:48:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:48:52,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1765656772, now seen corresponding path program 1 times [2024-10-18 17:48:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:52,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:48:52,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:48:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:48:52,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1540848974, now seen corresponding path program 1 times [2024-10-18 17:48:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:52,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:48:52,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:48:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:48:52,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1738458464, now seen corresponding path program 1 times [2024-10-18 17:48:52,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:52,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:48:55,984 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-18 17:48:55,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:48:57,274 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-18 17:48:57,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2103179370, now seen corresponding path program 1 times [2024-10-18 17:48:57,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:57,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:48:57,915 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-18 17:48:57,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:57,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:48:58,258 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-18 17:48:58,346 INFO L85 PathProgramCache]: Analyzing trace with hash 774048265, now seen corresponding path program 1 times [2024-10-18 17:48:58,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:58,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:48:58,559 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-18 17:48:58,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:58,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:48:58,778 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-18 17:48:58,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 17:48:58,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2473, Unknown=0, NotChecked=0, Total=2756 [2024-10-18 17:48:58,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:48:58,781 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 17:48:58,781 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-18 17:48:58,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:48:58,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:48:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:48:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:48:59,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-18 17:48:59,243 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,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15 [2024-10-18 17:48:59,245 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-18 17:48:59,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 17:48:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash 564381910, now seen corresponding path program 3 times [2024-10-18 17:48:59,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 17:48:59,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421073368] [2024-10-18 17:48:59,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:59,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:48:59,532 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-18 17:48:59,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 17:48:59,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421073368] [2024-10-18 17:48:59,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421073368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 17:48:59,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688544101] [2024-10-18 17:48:59,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 17:48:59,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 17:48:59,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:48:59,535 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-18 17:48:59,536 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-18 17:48:59,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-18 17:48:59,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 17:48:59,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-18 17:48:59,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 17:48:59,699 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-18 17:48:59,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 17:48:59,816 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-18 17:48:59,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688544101] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 17:48:59,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 17:48:59,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-18 17:48:59,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580033417] [2024-10-18 17:48:59,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 17:48:59,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-18 17:48:59,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 17:48:59,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1046334909, now seen corresponding path program 1 times [2024-10-18 17:48:59,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:48:59,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:48:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:48:59,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:48:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:00,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2119310372, now seen corresponding path program 1 times [2024-10-18 17:49:00,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:00,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:00,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1765656785, now seen corresponding path program 1 times [2024-10-18 17:49:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:00,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:00,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1540848959, now seen corresponding path program 1 times [2024-10-18 17:49:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:00,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:00,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:00,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1738458447, now seen corresponding path program 1 times [2024-10-18 17:49:00,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:00,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:49:02,246 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-18 17:49:02,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:02,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:49:03,329 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-18 17:49:03,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-18 17:49:03,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1667, Unknown=0, NotChecked=0, Total=1892 [2024-10-18 17:49:03,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:49:03,416 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 17:49:03,416 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-18 17:49:03,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:03,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:03,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:49:04,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 17:49:04,163 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-18 17:49:04,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-10-18 17:49:04,355 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-18 17:49:04,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 17:49:04,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1323657417, now seen corresponding path program 4 times [2024-10-18 17:49:04,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 17:49:04,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545100896] [2024-10-18 17:49:04,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:04,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:49:07,881 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-18 17:49:07,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 17:49:07,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545100896] [2024-10-18 17:49:07,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545100896] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 17:49:07,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795758677] [2024-10-18 17:49:07,882 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-18 17:49:07,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 17:49:07,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:49:07,884 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-18 17:49:07,885 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-18 17:49:07,978 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-18 17:49:07,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 17:49:07,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 17:49:07,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 17:49:08,070 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-18 17:49:08,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 17:49:08,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795758677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 17:49:08,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 17:49:08,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [24] total 28 [2024-10-18 17:49:08,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717960496] [2024-10-18 17:49:08,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 17:49:08,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 17:49:08,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 17:49:08,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1046334878, now seen corresponding path program 1 times [2024-10-18 17:49:08,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:08,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:08,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:08,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164591, now seen corresponding path program 1 times [2024-10-18 17:49:08,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:08,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:08,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:08,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1012446656, now seen corresponding path program 1 times [2024-10-18 17:49:08,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:08,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:08,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:08,788 INFO L85 PathProgramCache]: Analyzing trace with hash -566034416, now seen corresponding path program 1 times [2024-10-18 17:49:08,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:08,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:08,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:08,941 INFO L85 PathProgramCache]: Analyzing trace with hash 719854779, now seen corresponding path program 1 times [2024-10-18 17:49:08,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:08,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:08,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:09,107 INFO L85 PathProgramCache]: Analyzing trace with hash 418051279, now seen corresponding path program 1 times [2024-10-18 17:49:09,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:09,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:49:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-18 17:49:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:11,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:49:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-18 17:49:13,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1243371737, now seen corresponding path program 1 times [2024-10-18 17:49:13,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:13,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:13,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash -32616672, now seen corresponding path program 1 times [2024-10-18 17:49:13,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:13,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:13,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:13,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 17:49:13,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=3091, Unknown=0, NotChecked=0, Total=3422 [2024-10-18 17:49:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:49:13,909 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 17:49:13,910 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-18 17:49:13,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:13,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:13,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 17:49:13,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:49:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 17:49:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:14,300 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-18 17:49:14,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-10-18 17:49:14,486 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-18 17:49:14,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 17:49:14,487 INFO L85 PathProgramCache]: Analyzing trace with hash 589879332, now seen corresponding path program 5 times [2024-10-18 17:49:14,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 17:49:14,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790144882] [2024-10-18 17:49:14,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:14,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:49:14,992 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-18 17:49:14,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 17:49:14,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790144882] [2024-10-18 17:49:14,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790144882] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 17:49:14,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887687568] [2024-10-18 17:49:14,993 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-18 17:49:14,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 17:49:14,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:49:14,995 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-18 17:49:14,996 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-18 17:49:15,209 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-10-18 17:49:15,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 17:49:15,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-18 17:49:15,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 17:49:15,358 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-18 17:49:15,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 17:49:15,441 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-18 17:49:15,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887687568] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 17:49:15,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 17:49:15,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2024-10-18 17:49:15,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837850676] [2024-10-18 17:49:15,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 17:49:15,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-18 17:49:15,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 17:49:15,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1046334848, now seen corresponding path program 1 times [2024-10-18 17:49:15,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:15,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:15,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:15,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164621, now seen corresponding path program 1 times [2024-10-18 17:49:15,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:15,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:15,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1012446686, now seen corresponding path program 1 times [2024-10-18 17:49:15,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:15,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:15,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1674813408, now seen corresponding path program 1 times [2024-10-18 17:49:15,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:15,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:15,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:16,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1732726701, now seen corresponding path program 1 times [2024-10-18 17:49:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:16,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:16,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash 686650056, now seen corresponding path program 1 times [2024-10-18 17:49:16,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:16,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:16,606 INFO L85 PathProgramCache]: Analyzing trace with hash -396186389, now seen corresponding path program 1 times [2024-10-18 17:49:16,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:16,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:16,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:16,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1031502942, now seen corresponding path program 1 times [2024-10-18 17:49:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:16,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:16,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:17,083 INFO L85 PathProgramCache]: Analyzing trace with hash 366979073, now seen corresponding path program 1 times [2024-10-18 17:49:17,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:17,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:17,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash -807576350, now seen corresponding path program 1 times [2024-10-18 17:49:17,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:17,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:17,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:17,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1401846975, now seen corresponding path program 1 times [2024-10-18 17:49:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:17,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:17,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:17,714 INFO L85 PathProgramCache]: Analyzing trace with hash 533137937, now seen corresponding path program 1 times [2024-10-18 17:49:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:17,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:17,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:17,958 INFO L85 PathProgramCache]: Analyzing trace with hash 368111941, now seen corresponding path program 1 times [2024-10-18 17:49:17,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:17,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:18,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1365990555, now seen corresponding path program 1 times [2024-10-18 17:49:18,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:18,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:18,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:18,731 INFO L85 PathProgramCache]: Analyzing trace with hash -595742147, now seen corresponding path program 1 times [2024-10-18 17:49:18,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:18,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:18,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:19,033 INFO L85 PathProgramCache]: Analyzing trace with hash 83246374, now seen corresponding path program 1 times [2024-10-18 17:49:19,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:19,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:49:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:49:19,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-18 17:49:19,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-18 17:49:19,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:49:19,335 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 17:49:19,335 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-18 17:49:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 17:49:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:49:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 17:49:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:49:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 17:49:20,013 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-18 17:49:20,197 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,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable33,SelfDestructingSolverStorable44,SelfDestructingSolverStorable34,SelfDestructingSolverStorable45,SelfDestructingSolverStorable35,SelfDestructingSolverStorable46,SelfDestructingSolverStorable36,SelfDestructingSolverStorable47,SelfDestructingSolverStorable37,SelfDestructingSolverStorable48,SelfDestructingSolverStorable38,SelfDestructingSolverStorable49,SelfDestructingSolverStorable39 [2024-10-18 17:49:20,198 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-18 17:49:20,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 17:49:20,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1596812803, now seen corresponding path program 6 times [2024-10-18 17:49:20,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 17:49:20,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144292130] [2024-10-18 17:49:20,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:49:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:49:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:49:33,831 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-18 17:49:33,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 17:49:33,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144292130] [2024-10-18 17:49:33,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144292130] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 17:49:33,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968272770] [2024-10-18 17:49:33,832 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-18 17:49:33,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 17:49:33,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:49:33,833 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-18 17:49:33,834 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-18 17:49:34,183 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2024-10-18 17:49:34,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 17:49:34,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-10-18 17:49:34,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 17:49:55,731 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-18 17:49:55,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 17:50:02,425 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-18 17:50:02,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968272770] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 17:50:02,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 17:50:02,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 70, 95] total 241 [2024-10-18 17:50:02,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351042341] [2024-10-18 17:50:02,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 17:50:02,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 242 states [2024-10-18 17:50:02,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 17:50:02,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1046334794, now seen corresponding path program 1 times [2024-10-18 17:50:02,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:50:02,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:50:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:02,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:50:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:02,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164675, now seen corresponding path program 1 times [2024-10-18 17:50:02,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:50:02,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:50:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:02,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:50:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:02,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1012446742, now seen corresponding path program 1 times [2024-10-18 17:50:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:50:02,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:50:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:02,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:50:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:03,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1674813350, now seen corresponding path program 1 times [2024-10-18 17:50:03,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:50:03,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:50:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:03,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:50:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:03,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1732726643, now seen corresponding path program 1 times [2024-10-18 17:50:03,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:50:03,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:50:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:03,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:50:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash 686650116, now seen corresponding path program 1 times [2024-10-18 17:50:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:50:03,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:50:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:03,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:50:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:03,710 INFO L85 PathProgramCache]: Analyzing trace with hash 366979127, now seen corresponding path program 1 times [2024-10-18 17:50:03,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:50:03,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:50:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:03,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:50:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash -807576294, now seen corresponding path program 1 times [2024-10-18 17:50:03,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:50:03,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:50:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:03,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:50:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:04,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1401846919, now seen corresponding path program 1 times [2024-10-18 17:50:04,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:50:04,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:50:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:04,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:50:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:04,424 INFO L85 PathProgramCache]: Analyzing trace with hash 533137995, now seen corresponding path program 1 times [2024-10-18 17:50:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:50:04,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:50:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:04,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:50:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1365990610, now seen corresponding path program 1 times [2024-10-18 17:50:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:50:04,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:50:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:04,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:50:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:50:04,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 242 interpolants. [2024-10-18 17:50:04,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12422, Invalid=45900, Unknown=0, NotChecked=0, Total=58322 [2024-10-18 17:50:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:50:04,952 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 17:50:04,953 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-18 17:50:04,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:50:04,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:50:04,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 17:50:04,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:50:04,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-18 17:50:04,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:51:06,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:51:06,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:51:06,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 17:51:06,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:51:06,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-18 17:51:06,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 446 states. [2024-10-18 17:51:06,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-18 17:51:06,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,SelfDestructingSolverStorable50,SelfDestructingSolverStorable61,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2024-10-18 17:51:06,428 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-18 17:51:06,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 17:51:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash 29873356, now seen corresponding path program 7 times [2024-10-18 17:51:06,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 17:51:06,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551673278] [2024-10-18 17:51:06,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:51:06,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:51:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:51:06,999 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-18 17:51:06,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 17:51:06,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551673278] [2024-10-18 17:51:06,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551673278] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 17:51:07,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366015799] [2024-10-18 17:51:07,000 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-18 17:51:07,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 17:51:07,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:51:07,001 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-18 17:51:07,002 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-18 17:51:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:51:07,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-18 17:51:07,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 17:51:07,214 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-18 17:51:07,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 17:51:07,818 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-18 17:51:07,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366015799] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 17:51:07,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 17:51:07,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 23] total 30 [2024-10-18 17:51:07,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927257805] [2024-10-18 17:51:07,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 17:51:07,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-18 17:51:07,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 17:51:07,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1643774923, now seen corresponding path program 1 times [2024-10-18 17:51:07,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:51:07,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:51:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:51:07,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:51:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:51:08,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-18 17:51:08,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2024-10-18 17:51:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:51:08,206 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 17:51:08,207 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-18 17:51:08,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:51:08,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:51:08,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 17:51:08,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:51:08,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-18 17:51:08,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 446 states. [2024-10-18 17:51:08,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:51:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:51:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:51:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 17:51:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:51:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-18 17:51:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2024-10-18 17:51:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-18 17:51:10,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-18 17:51:10,362 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,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63 [2024-10-18 17:51:10,362 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-18 17:51:10,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 17:51:10,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1221599718, now seen corresponding path program 8 times [2024-10-18 17:51:10,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 17:51:10,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947031357] [2024-10-18 17:51:10,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:51:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:51:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:51:17,622 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-18 17:51:17,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 17:51:17,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947031357] [2024-10-18 17:51:17,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947031357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 17:51:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478183338] [2024-10-18 17:51:17,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 17:51:17,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 17:51:17,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:51:17,624 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-18 17:51:17,625 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-18 17:51:17,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 17:51:17,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 17:51:17,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-18 17:51:17,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 17:51:43,071 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-18 17:51:43,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 17:55:54,440 WARN L286 SmtUtils]: Spent 6.94s on a formula simplification that was a NOOP. DAG size: 1018 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 17:56:03,375 WARN L851 $PredicateComparison]: unable to prove that (or (= (mod c_thread1Thread1of1ForFork1_~cond~0 256) 0) (let ((.cse3 (* 4294967260 c_~p1~0)) (.cse0 (< 36 c_~n2~0)) (.cse142 (= c_~n2~0 36)) (.cse141 (< c_~n2~0 39)) (.cse79 (< c_~n2~0 43)) (.cse56 (mod (+ (* 4294967253 c_~p1~0) c_~p2~0) 4294967296)) (.cse53 (< 43 c_~n2~0)) (.cse49 (* c_~p1~0 4294967252)) (.cse52 (= c_~n2~0 43)) (.cse112 (< 42 c_~n2~0)) (.cse107 (* 4294967254 c_~p1~0)) (.cse111 (= 41 c_~n2~0)) (.cse81 (mod (+ (* c_~p1~0 4294967255) c_~p2~0) 4294967296)) (.cse80 (= 42 c_~n2~0)) (.cse113 (= 40 c_~n2~0)) (.cse42 (* c_~p1~0 4294967256)) (.cse41 (< 40 c_~n2~0)) (.cse114 (= c_~n2~0 39)) (.cse116 (mod (+ (* c_~p1~0 4294967257) c_~p2~0) 4294967296)) (.cse140 (< 39 c_~n2~0)) (.cse7 (< 38 c_~n2~0)) (.cse8 (= c_~n2~0 38)) (.cse10 (mod (+ (* 4294967259 c_~p1~0) c_~p2~0) 4294967296)) (.cse35 (= c_~n2~0 37)) (.cse38 (* 4294967258 c_~p1~0))) (and (or (let ((.cse4 (* (mod (* 1073741817 c_~p1~0) 1073741824) 4))) (and (or .cse0 (and (forall ((v_z_78 Int)) (let ((.cse1 (+ .cse4 v_z_78)) (.cse2 (mod (+ .cse3 (* v_z_78 740511604) c_~p2~0) 4294967296))) (or (= .cse1 .cse2) (= .cse1 (+ 4294967296 .cse2)) (< 4294967295 v_z_78) (< v_z_78 0)))) (forall ((v_z_78 Int)) (let ((.cse5 (+ .cse4 v_z_78))) (or (= .cse5 (mod (+ .cse3 (* v_z_78 740511604) c_~p2~0) 4294967296)) (< 4294967295 .cse5) (< v_z_78 0)))) (forall ((v_z_78 Int)) (let ((.cse6 (+ .cse4 v_z_78))) (or (< .cse6 4294967296) (= .cse6 (+ 4294967296 (mod (+ .cse3 (* v_z_78 740511604) c_~p2~0) 4294967296))) (< 4294967295 v_z_78)))))) (or (let ((.cse13 (+ .cse4 4294967296))) (and (or .cse7 (and (or .cse8 (and (forall ((v_z_81 Int)) (or (forall ((v_y_81 Int)) (let ((.cse12 (* v_z_81 2073432488)) (.cse9 (* 2073432489 v_z_81)) (.cse11 (* v_y_81 4294967296))) (or (< 4294967295 (+ .cse9 .cse10 .cse11)) (= (+ .cse12 4294967296 .cse10 .cse11) .cse4) (= .cse4 (+ .cse12 .cse10 .cse11)) (< (+ .cse9 .cse11) 0)))) (< v_z_81 0) (< 4294967295 v_z_81))) (forall ((v_z_82 Int)) (or (forall ((v_y_82 Int)) (let ((.cse14 (* v_y_82 4294967296)) (.cse15 (* 2073432489 v_z_82))) (or (= .cse13 (+ .cse14 (* v_z_82 2073432488) .cse10)) (< (+ .cse14 .cse10 .cse15) 4294967296) (< 4294967295 (+ .cse14 .cse15))))) (< 4294967295 (+ .cse4 v_z_82)) (< v_z_82 0))) (forall ((v_z_81 Int)) (or (< 4294967295 (+ .cse4 v_z_81)) (< v_z_81 0) (forall ((v_y_81 Int)) (let ((.cse18 (* v_y_81 4294967296))) (let ((.cse17 (+ (* v_z_81 2073432488) .cse10 .cse18)) (.cse16 (+ (* 2073432489 v_z_81) .cse18))) (or (< 4294967295 .cse16) (= .cse4 .cse17) (= .cse17 .cse13) (< .cse16 0))))))) (forall ((v_z_82 Int)) (or (< 4294967295 v_z_82) (< v_z_82 0) (forall ((v_y_82 Int)) (let ((.cse20 (* v_y_82 4294967296))) (let ((.cse21 (* 2073432489 v_z_82)) (.cse19 (+ .cse20 (* v_z_82 2073432488) .cse10))) (or (= .cse13 .cse19) (< (+ .cse20 .cse10 .cse21) 4294967296) (< 4294967295 (+ .cse20 .cse21)) (= .cse4 .cse19))))))) (forall ((v_z_81 Int)) (or (forall ((v_y_81 Int)) (let ((.cse22 (* 2073432489 v_z_81)) (.cse23 (* v_y_81 4294967296))) (or (< 4294967295 (+ .cse22 .cse10 .cse23)) (= .cse4 (+ (* v_z_81 2073432488) .cse10 .cse23)) (< (+ .cse22 .cse23) 0)))) (< 4294967295 (+ .cse4 v_z_81)) (< v_z_81 0))) (forall ((v_z_81 Int)) (or (< (+ .cse4 v_z_81) 4294967296) (< 4294967295 v_z_81) (forall ((v_y_81 Int)) (let ((.cse26 (* v_y_81 4294967296))) (let ((.cse25 (* v_z_81 2073432488)) (.cse24 (+ (* 2073432489 v_z_81) .cse26))) (or (< 4294967295 .cse24) (= (+ .cse25 4294967296 .cse10 .cse26) .cse4) (= .cse4 (+ .cse25 .cse10 .cse26)) (< .cse24 0))))))) (forall ((v_z_82 Int)) (or (< (+ .cse4 v_z_82) 4294967296) (< 4294967295 v_z_82) (forall ((v_y_82 Int)) (let ((.cse28 (* 2073432489 v_z_82)) (.cse27 (* v_y_82 4294967296))) (or (< (+ .cse27 .cse10 .cse28) 4294967296) (< 4294967295 (+ .cse27 .cse28)) (= .cse4 (+ .cse27 (* v_z_82 2073432488) .cse10))))))) (forall ((v_z_81 Int)) (or (forall ((v_y_81 Int)) (let ((.cse30 (* v_z_81 2073432488)) (.cse31 (* v_y_81 4294967296))) (let ((.cse32 (+ .cse30 .cse10 .cse31)) (.cse29 (+ (* 2073432489 v_z_81) .cse31))) (or (< 4294967295 .cse29) (= (+ .cse30 4294967296 .cse10 .cse31) .cse4) (= .cse4 .cse32) (= .cse32 .cse13) (< .cse29 0))))) (< v_z_81 0) (< 4294967295 v_z_81))) (forall ((v_z_81 Int)) (or (< (+ .cse4 v_z_81) 4294967296) (forall ((v_y_81 Int)) (let ((.cse33 (* 2073432489 v_z_81)) (.cse34 (* v_y_81 4294967296))) (or (< 4294967295 (+ .cse33 .cse10 .cse34)) (= (+ (* v_z_81 2073432488) 4294967296 .cse10 .cse34) .cse4) (< (+ .cse33 .cse34) 0)))) (< 4294967295 v_z_81))))) (or .cse35 (and (forall ((v_z_83 Int)) (let ((.cse36 (+ .cse4 v_z_83)) (.cse37 (mod (+ (* 3406353374 v_z_83) .cse38 c_~p2~0) 4294967296))) (or (= .cse36 (+ .cse37 4294967296)) (= .cse36 .cse37) (< 4294967295 v_z_83) (< v_z_83 0)))) (forall ((v_z_83 Int)) (let ((.cse39 (+ .cse4 v_z_83))) (or (< .cse39 4294967296) (= .cse39 (+ (mod (+ (* 3406353374 v_z_83) .cse38 c_~p2~0) 4294967296) 4294967296)) (< 4294967295 v_z_83)))) (forall ((v_z_83 Int)) (let ((.cse40 (+ .cse4 v_z_83))) (or (= .cse40 (mod (+ (* 3406353374 v_z_83) .cse38 c_~p2~0) 4294967296)) (< v_z_83 0) (< 4294967295 .cse40)))))))) (or (and (or (and (or .cse41 (and (forall ((v_z_97 Int)) (let ((.cse43 (+ .cse4 v_z_97))) (or (< v_z_97 0) (= (mod (+ (* 1777227848 v_z_97) .cse42 c_~p2~0) 4294967296) .cse43) (< 4294967295 .cse43)))) (forall ((v_z_97 Int)) (let ((.cse44 (+ .cse4 v_z_97))) (or (< 4294967295 v_z_97) (= (+ (mod (+ (* 1777227848 v_z_97) .cse42 c_~p2~0) 4294967296) 4294967296) .cse44) (< .cse44 4294967296)))) (forall ((v_z_97 Int)) (let ((.cse45 (mod (+ (* 1777227848 v_z_97) .cse42 c_~p2~0) 4294967296)) (.cse46 (+ .cse4 v_z_97))) (or (< 4294967295 v_z_97) (< v_z_97 0) (= .cse45 .cse46) (= (+ .cse45 4294967296) .cse46)))))) (or (and (or (and (or (and (forall ((v_z_84 Int)) (let ((.cse47 (+ .cse4 v_z_84)) (.cse48 (mod (+ (* v_z_84 2813944092) .cse49 c_~p2~0) 4294967296))) (or (< 4294967295 v_z_84) (= .cse47 (+ 4294967296 .cse48)) (< v_z_84 0) (= .cse47 .cse48)))) (forall ((v_z_84 Int)) (let ((.cse50 (+ .cse4 v_z_84))) (or (< 4294967295 v_z_84) (= .cse50 (+ 4294967296 (mod (+ (* v_z_84 2813944092) .cse49 c_~p2~0) 4294967296))) (< .cse50 4294967296)))) (forall ((v_z_84 Int)) (let ((.cse51 (+ .cse4 v_z_84))) (or (< v_z_84 0) (= .cse51 (mod (+ (* v_z_84 2813944092) .cse49 c_~p2~0) 4294967296)) (< 4294967295 .cse51))))) .cse52) (or .cse53 (and (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (forall ((v_y_89 Int)) (let ((.cse57 (* v_z_89 1481023206)) (.cse58 (* v_y_89 4294967296))) (let ((.cse54 (+ .cse56 .cse57 .cse58)) (.cse55 (+ (* v_z_89 1481023207) .cse58))) (or (= .cse54 .cse4) (< 4294967295 .cse55) (= .cse4 (+ .cse56 .cse57 4294967296 .cse58)) (= .cse54 .cse13) (< .cse55 0))))) (< v_z_89 0))) (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 (+ .cse4 v_z_90)) (forall ((v_y_90 Int)) (let ((.cse60 (* v_z_90 1481023207)) (.cse59 (* v_y_90 4294967296))) (or (= (+ .cse56 .cse59 (* v_z_90 1481023206)) .cse13) (< (+ .cse56 .cse60 .cse59) 4294967296) (< 4294967295 (+ .cse60 .cse59))))))) (forall ((v_z_91 Int)) (or (forall ((v_y_91 Int)) (let ((.cse62 (* v_z_91 1481023207)) (.cse61 (* v_y_91 4294967296))) (or (= .cse4 (+ .cse56 .cse61 (* v_z_91 1481023206))) (< 4294967295 (+ .cse56 .cse62 .cse61)) (< (+ .cse62 .cse61) 0)))) (< v_z_91 0) (< 4294967295 (+ .cse4 v_z_91)))) (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (forall ((v_y_89 Int)) (let ((.cse64 (* v_y_89 4294967296))) (let ((.cse63 (* v_z_89 1481023206)) (.cse65 (+ (* v_z_89 1481023207) .cse64))) (or (= (+ .cse56 .cse63 .cse64) .cse4) (< 4294967295 .cse65) (= .cse4 (+ .cse56 .cse63 4294967296 .cse64)) (< .cse65 0))))) (< (+ .cse4 v_z_89) 4294967296))) (forall ((v_z_91 Int)) (or (forall ((v_y_91 Int)) (let ((.cse67 (* v_z_91 1481023207)) (.cse66 (* v_y_91 4294967296))) (or (= .cse4 (+ .cse56 .cse66 4294967296 (* v_z_91 1481023206))) (< 4294967295 (+ .cse56 .cse67 .cse66)) (< (+ .cse67 .cse66) 0)))) (< 4294967295 v_z_91) (< (+ .cse4 v_z_91) 4294967296))) (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 v_z_90) (forall ((v_y_90 Int)) (let ((.cse70 (* v_y_90 4294967296))) (let ((.cse68 (+ .cse56 .cse70 (* v_z_90 1481023206))) (.cse69 (* v_z_90 1481023207))) (or (= .cse4 .cse68) (= .cse68 .cse13) (< (+ .cse56 .cse69 .cse70) 4294967296) (< 4294967295 (+ .cse69 .cse70)))))))) (forall ((v_z_91 Int)) (or (forall ((v_y_91 Int)) (let ((.cse72 (* v_z_91 1481023206)) (.cse73 (* v_z_91 1481023207)) (.cse71 (* v_y_91 4294967296))) (or (= .cse4 (+ .cse56 .cse71 4294967296 .cse72)) (= .cse4 (+ .cse56 .cse71 .cse72)) (< 4294967295 (+ .cse56 .cse73 .cse71)) (< (+ .cse73 .cse71) 0)))) (< v_z_91 0) (< 4294967295 v_z_91))) (forall ((v_z_90 Int)) (or (< (+ .cse4 v_z_90) 4294967296) (< 4294967295 v_z_90) (forall ((v_y_90 Int)) (let ((.cse75 (* v_z_90 1481023207)) (.cse74 (* v_y_90 4294967296))) (or (= .cse4 (+ .cse56 .cse74 (* v_z_90 1481023206))) (< (+ .cse56 .cse75 .cse74) 4294967296) (< 4294967295 (+ .cse75 .cse74))))))) (forall ((v_z_89 Int)) (or (forall ((v_y_89 Int)) (let ((.cse78 (* v_y_89 4294967296))) (let ((.cse76 (+ .cse56 (* v_z_89 1481023206) .cse78)) (.cse77 (+ (* v_z_89 1481023207) .cse78))) (or (= .cse76 .cse4) (< 4294967295 .cse77) (= .cse76 .cse13) (< .cse77 0))))) (< 4294967295 (+ .cse4 v_z_89)) (< v_z_89 0)))))) .cse79) (or (and (or .cse80 (and (forall ((v_z_95 Int)) (or (< 4294967295 (+ .cse4 v_z_95)) (forall ((v_y_95 Int)) (let ((.cse83 (* v_z_95 3110148733)) (.cse82 (* v_y_95 4294967296))) (or (= .cse13 (+ .cse81 .cse82 (* v_z_95 3110148732))) (< 4294967295 (+ .cse83 .cse82)) (< (+ .cse81 .cse83 .cse82) 4294967296)))) (< v_z_95 0))) (forall ((v_z_94 Int)) (or (< v_z_94 0) (forall ((v_y_94 Int)) (let ((.cse84 (* v_z_94 3110148733)) (.cse86 (* v_z_94 3110148732)) (.cse85 (* v_y_94 4294967296))) (or (< (+ .cse84 .cse85) 0) (= (+ .cse81 .cse86 .cse85) .cse4) (< 4294967295 (+ .cse81 .cse84 .cse85)) (= .cse4 (+ .cse81 .cse86 4294967296 .cse85))))) (< 4294967295 v_z_94))) (forall ((v_z_94 Int)) (or (< v_z_94 0) (forall ((v_y_94 Int)) (let ((.cse87 (* v_z_94 3110148733)) (.cse88 (* v_y_94 4294967296))) (or (< (+ .cse87 .cse88) 0) (= (+ .cse81 (* v_z_94 3110148732) .cse88) .cse4) (< 4294967295 (+ .cse81 .cse87 .cse88))))) (< 4294967295 (+ .cse4 v_z_94)))) (forall ((v_z_94 Int)) (or (< v_z_94 0) (forall ((v_y_94 Int)) (let ((.cse91 (* v_y_94 4294967296))) (let ((.cse90 (+ .cse81 (* v_z_94 3110148732) .cse91)) (.cse89 (+ (* v_z_94 3110148733) .cse91))) (or (< .cse89 0) (= .cse90 .cse4) (= .cse90 .cse13) (< 4294967295 .cse89))))) (< 4294967295 (+ .cse4 v_z_94)))) (forall ((v_z_95 Int)) (or (< (+ .cse4 v_z_95) 4294967296) (< 4294967295 v_z_95) (forall ((v_y_95 Int)) (let ((.cse92 (* v_z_95 3110148733)) (.cse93 (* v_y_95 4294967296))) (or (< 4294967295 (+ .cse92 .cse93)) (= .cse4 (+ .cse81 .cse93 (* v_z_95 3110148732))) (< (+ .cse81 .cse92 .cse93) 4294967296)))))) (forall ((v_z_95 Int)) (or (forall ((v_y_95 Int)) (let ((.cse96 (* v_y_95 4294967296))) (let ((.cse94 (+ .cse81 .cse96 (* v_z_95 3110148732))) (.cse95 (* v_z_95 3110148733))) (or (= .cse13 .cse94) (< 4294967295 (+ .cse95 .cse96)) (= .cse4 .cse94) (< (+ .cse81 .cse95 .cse96) 4294967296))))) (< 4294967295 v_z_95) (< v_z_95 0))) (forall ((v_z_94 Int)) (or (forall ((v_y_94 Int)) (let ((.cse97 (* v_z_94 3110148733)) (.cse98 (* v_y_94 4294967296))) (or (< (+ .cse97 .cse98) 0) (< 4294967295 (+ .cse81 .cse97 .cse98)) (= .cse4 (+ .cse81 (* v_z_94 3110148732) 4294967296 .cse98))))) (< (+ .cse4 v_z_94) 4294967296) (< 4294967295 v_z_94))) (forall ((v_z_94 Int)) (or (< (+ .cse4 v_z_94) 4294967296) (forall ((v_y_94 Int)) (let ((.cse101 (* v_y_94 4294967296))) (let ((.cse99 (+ (* v_z_94 3110148733) .cse101)) (.cse100 (* v_z_94 3110148732))) (or (< .cse99 0) (= (+ .cse81 .cse100 .cse101) .cse4) (< 4294967295 .cse99) (= .cse4 (+ .cse81 .cse100 4294967296 .cse101)))))) (< 4294967295 v_z_94))) (forall ((v_z_94 Int)) (or (< v_z_94 0) (forall ((v_y_94 Int)) (let ((.cse104 (* v_z_94 3110148732)) (.cse105 (* v_y_94 4294967296))) (let ((.cse103 (+ .cse81 .cse104 .cse105)) (.cse102 (+ (* v_z_94 3110148733) .cse105))) (or (< .cse102 0) (= .cse103 .cse4) (= .cse103 .cse13) (< 4294967295 .cse102) (= .cse4 (+ .cse81 .cse104 4294967296 .cse105)))))) (< 4294967295 v_z_94))))) (or (and (forall ((v_z_96 Int)) (let ((.cse106 (+ .cse4 v_z_96))) (or (< v_z_96 0) (= .cse106 (mod (+ .cse107 (* v_z_96 148102322) c_~p2~0) 4294967296)) (< 4294967295 .cse106)))) (forall ((v_z_96 Int)) (let ((.cse108 (+ .cse4 v_z_96))) (or (= .cse108 (+ (mod (+ .cse107 (* v_z_96 148102322) c_~p2~0) 4294967296) 4294967296)) (< .cse108 4294967296) (< 4294967295 v_z_96)))) (forall ((v_z_96 Int)) (let ((.cse109 (+ .cse4 v_z_96)) (.cse110 (mod (+ .cse107 (* v_z_96 148102322) c_~p2~0) 4294967296))) (or (= .cse109 (+ .cse110 4294967296)) (< v_z_96 0) (= .cse109 .cse110) (< 4294967295 v_z_96))))) .cse111)) .cse112)) .cse113)) .cse114) (or (and (forall ((v_z_100 Int)) (or (< (+ .cse4 v_z_100) 4294967296) (< 4294967295 v_z_100) (forall ((v_y_100 Int)) (let ((.cse115 (* v_y_100 4294967296)) (.cse117 (* 444306963 v_z_100))) (or (= .cse4 (+ (* v_z_100 444306962) .cse115 .cse116)) (< (+ .cse115 .cse116 .cse117) 4294967296) (< 4294967295 (+ .cse115 .cse117))))))) (forall ((v_z_103 Int)) (or (< 4294967295 v_z_103) (< v_z_103 0) (forall ((v_y_103 Int)) (let ((.cse118 (* v_z_103 444306962)) (.cse119 (* v_y_103 4294967296))) (let ((.cse120 (+ .cse118 .cse119 .cse116)) (.cse121 (+ .cse119 (* 444306963 v_z_103)))) (or (= .cse4 (+ .cse118 .cse119 .cse116 4294967296)) (= .cse120 .cse4) (< .cse121 0) (= .cse120 .cse13) (< 4294967295 .cse121))))))) (forall ((v_z_103 Int)) (or (< (+ .cse4 v_z_103) 4294967296) (forall ((v_y_103 Int)) (let ((.cse123 (* v_y_103 4294967296))) (let ((.cse122 (* v_z_103 444306962)) (.cse124 (+ .cse123 (* 444306963 v_z_103)))) (or (= .cse4 (+ .cse122 .cse123 .cse116 4294967296)) (= (+ .cse122 .cse123 .cse116) .cse4) (< .cse124 0) (< 4294967295 .cse124))))) (< 4294967295 v_z_103))) (forall ((v_z_102 Int)) (or (< (+ .cse4 v_z_102) 4294967296) (< 4294967295 v_z_102) (forall ((v_y_102 Int)) (let ((.cse125 (* v_y_102 4294967296)) (.cse126 (* 444306963 v_z_102))) (or (= .cse4 (+ .cse125 (* v_z_102 444306962) .cse116 4294967296)) (< 4294967295 (+ .cse125 .cse116 .cse126)) (< (+ .cse125 .cse126) 0)))))) (forall ((v_z_103 Int)) (or (forall ((v_y_103 Int)) (let ((.cse129 (* v_y_103 4294967296))) (let ((.cse127 (+ (* v_z_103 444306962) .cse129 .cse116)) (.cse128 (+ .cse129 (* 444306963 v_z_103)))) (or (= .cse127 .cse4) (< .cse128 0) (= .cse127 .cse13) (< 4294967295 .cse128))))) (< v_z_103 0) (< 4294967295 (+ .cse4 v_z_103)))) (forall ((v_z_102 Int)) (or (< v_z_102 0) (< 4294967295 v_z_102) (forall ((v_y_102 Int)) (let ((.cse131 (* v_z_102 444306962)) (.cse130 (* v_y_102 4294967296)) (.cse132 (* 444306963 v_z_102))) (or (= .cse4 (+ .cse130 .cse131 .cse116 4294967296)) (< 4294967295 (+ .cse130 .cse116 .cse132)) (= .cse4 (+ .cse130 .cse131 .cse116)) (< (+ .cse130 .cse132) 0)))))) (forall ((v_z_100 Int)) (or (< v_z_100 0) (< 4294967295 (+ .cse4 v_z_100)) (forall ((v_y_100 Int)) (let ((.cse133 (* v_y_100 4294967296)) (.cse134 (* 444306963 v_z_100))) (or (< (+ .cse133 .cse116 .cse134) 4294967296) (= .cse13 (+ (* v_z_100 444306962) .cse133 .cse116)) (< 4294967295 (+ .cse133 .cse134))))))) (forall ((v_z_102 Int)) (or (forall ((v_y_102 Int)) (let ((.cse135 (* v_y_102 4294967296)) (.cse136 (* 444306963 v_z_102))) (or (< 4294967295 (+ .cse135 .cse116 .cse136)) (= .cse4 (+ .cse135 (* v_z_102 444306962) .cse116)) (< (+ .cse135 .cse136) 0)))) (< 4294967295 (+ .cse4 v_z_102)) (< v_z_102 0))) (forall ((v_z_100 Int)) (or (< v_z_100 0) (forall ((v_y_100 Int)) (let ((.cse138 (* v_y_100 4294967296))) (let ((.cse137 (+ (* v_z_100 444306962) .cse138 .cse116)) (.cse139 (* 444306963 v_z_100))) (or (= .cse4 .cse137) (< (+ .cse138 .cse116 .cse139) 4294967296) (= .cse13 .cse137) (< 4294967295 (+ .cse138 .cse139)))))) (< 4294967295 v_z_100)))) .cse140)) .cse141))) .cse142))) (not (= 29 c_~n1~0))) (or (let ((.cse144 (* (mod (* 2147483635 c_~p1~0) 2147483648) 2))) (and (or (and (forall ((v_z_105 Int)) (let ((.cse143 (+ v_z_105 .cse144))) (or (< 4294967295 .cse143) (< v_z_105 0) (= .cse143 (mod (+ .cse3 (* 2863311532 v_z_105) c_~p2~0) 4294967296))))) (forall ((v_z_105 Int)) (let ((.cse145 (+ v_z_105 .cse144)) (.cse146 (mod (+ .cse3 (* 2863311532 v_z_105) c_~p2~0) 4294967296))) (or (< v_z_105 0) (= .cse145 (+ .cse146 4294967296)) (< 4294967295 v_z_105) (= .cse145 .cse146)))) (forall ((v_z_105 Int)) (let ((.cse147 (+ v_z_105 .cse144))) (or (= .cse147 (+ (mod (+ .cse3 (* 2863311532 v_z_105) c_~p2~0) 4294967296) 4294967296)) (< 4294967295 v_z_105) (< .cse147 4294967296))))) .cse0) (or .cse142 (let ((.cse153 (+ 4294967296 .cse144))) (and (or .cse141 (and (or (and (or (and (or .cse79 (and (or (and (forall ((v_z_125 Int)) (or (forall ((v_y_125 Int)) (let ((.cse149 (* v_z_125 2227020081)) (.cse150 (* 2227020080 v_z_125)) (.cse148 (* v_y_125 4294967296))) (or (< (+ .cse148 .cse149) 0) (< 4294967295 (+ .cse56 .cse148 .cse149)) (= (+ .cse56 .cse150 .cse148 4294967296) .cse144) (= (+ .cse56 .cse150 .cse148) .cse144)))) (< v_z_125 0) (< 4294967295 v_z_125))) (forall ((v_z_122 Int)) (or (< v_z_122 0) (forall ((v_y_122 Int)) (let ((.cse154 (* v_y_122 4294967296))) (let ((.cse151 (+ .cse56 .cse154 (* 2227020080 v_z_122))) (.cse152 (+ (* v_z_122 2227020081) .cse154))) (or (= .cse151 .cse144) (< .cse152 0) (= .cse153 .cse151) (< 4294967295 .cse152))))) (< 4294967295 (+ v_z_122 .cse144)))) (forall ((v_z_122 Int)) (or (< 4294967295 v_z_122) (< (+ v_z_122 .cse144) 4294967296) (forall ((v_y_122 Int)) (let ((.cse155 (* v_y_122 4294967296))) (let ((.cse156 (* 2227020080 v_z_122)) (.cse157 (+ (* v_z_122 2227020081) .cse155))) (or (= (+ .cse56 .cse155 .cse156) .cse144) (< .cse157 0) (= (+ .cse56 .cse155 .cse156 4294967296) .cse144) (< 4294967295 .cse157))))))) (forall ((v_z_124 Int)) (or (forall ((v_y_124 Int)) (let ((.cse159 (* v_z_124 2227020081)) (.cse158 (* v_y_124 4294967296))) (or (< (+ .cse56 .cse158 .cse159) 4294967296) (< 4294967295 (+ .cse158 .cse159)) (= (+ .cse56 .cse158 (* 2227020080 v_z_124)) .cse153)))) (< v_z_124 0) (< 4294967295 (+ v_z_124 .cse144)))) (forall ((v_z_124 Int)) (or (forall ((v_y_124 Int)) (let ((.cse161 (* v_y_124 4294967296))) (let ((.cse162 (* v_z_124 2227020081)) (.cse160 (+ .cse56 .cse161 (* 2227020080 v_z_124)))) (or (= .cse160 .cse144) (< (+ .cse56 .cse161 .cse162) 4294967296) (< 4294967295 (+ .cse161 .cse162)) (= .cse160 .cse153))))) (< v_z_124 0) (< 4294967295 v_z_124))) (forall ((v_z_125 Int)) (or (forall ((v_y_125 Int)) (let ((.cse164 (* v_z_125 2227020081)) (.cse163 (* v_y_125 4294967296))) (or (< (+ .cse163 .cse164) 0) (< 4294967295 (+ .cse56 .cse163 .cse164)) (= (+ .cse56 (* 2227020080 v_z_125) .cse163 4294967296) .cse144)))) (< (+ v_z_125 .cse144) 4294967296) (< 4294967295 v_z_125))) (forall ((v_z_125 Int)) (or (forall ((v_y_125 Int)) (let ((.cse166 (* v_z_125 2227020081)) (.cse165 (* v_y_125 4294967296))) (or (< (+ .cse165 .cse166) 0) (< 4294967295 (+ .cse56 .cse165 .cse166)) (= (+ .cse56 (* 2227020080 v_z_125) .cse165) .cse144)))) (< v_z_125 0) (< 4294967295 (+ v_z_125 .cse144)))) (forall ((v_z_122 Int)) (or (< 4294967295 v_z_122) (< v_z_122 0) (forall ((v_y_122 Int)) (let ((.cse169 (* v_y_122 4294967296)) (.cse170 (* 2227020080 v_z_122))) (let ((.cse167 (+ .cse56 .cse169 .cse170)) (.cse168 (+ (* v_z_122 2227020081) .cse169))) (or (= .cse167 .cse144) (< .cse168 0) (= (+ .cse56 .cse169 .cse170 4294967296) .cse144) (= .cse153 .cse167) (< 4294967295 .cse168))))))) (forall ((v_z_124 Int)) (or (< 4294967295 v_z_124) (< (+ v_z_124 .cse144) 4294967296) (forall ((v_y_124 Int)) (let ((.cse171 (* v_y_124 4294967296)) (.cse172 (* v_z_124 2227020081))) (or (= (+ .cse56 .cse171 (* 2227020080 v_z_124)) .cse144) (< (+ .cse56 .cse171 .cse172) 4294967296) (< 4294967295 (+ .cse171 .cse172)))))))) .cse53) (or (and (forall ((v_z_126 Int)) (let ((.cse173 (+ v_z_126 .cse144))) (or (= .cse173 (+ (mod (+ .cse49 c_~p2~0 (* v_z_126 3976821572)) 4294967296) 4294967296)) (< 4294967295 v_z_126) (< .cse173 4294967296)))) (forall ((v_z_126 Int)) (let ((.cse174 (+ v_z_126 .cse144)) (.cse175 (mod (+ .cse49 c_~p2~0 (* v_z_126 3976821572)) 4294967296))) (or (= .cse174 (+ .cse175 4294967296)) (< v_z_126 0) (= .cse174 .cse175) (< 4294967295 v_z_126)))) (forall ((v_z_126 Int)) (let ((.cse176 (+ v_z_126 .cse144))) (or (< v_z_126 0) (< 4294967295 .cse176) (= .cse176 (mod (+ .cse49 c_~p2~0 (* v_z_126 3976821572)) 4294967296)))))) .cse52))) (or .cse112 (and (or (and (forall ((v_z_127 Int)) (let ((.cse177 (+ v_z_127 .cse144))) (or (< 4294967295 .cse177) (< v_z_127 0) (= (mod (+ .cse107 (* 477218590 v_z_127) c_~p2~0) 4294967296) .cse177)))) (forall ((v_z_127 Int)) (let ((.cse178 (+ v_z_127 .cse144))) (or (< .cse178 4294967296) (= .cse178 (+ (mod (+ .cse107 (* 477218590 v_z_127) c_~p2~0) 4294967296) 4294967296)) (< 4294967295 v_z_127)))) (forall ((v_z_127 Int)) (let ((.cse180 (mod (+ .cse107 (* 477218590 v_z_127) c_~p2~0) 4294967296)) (.cse179 (+ v_z_127 .cse144))) (or (= .cse179 (+ .cse180 4294967296)) (< v_z_127 0) (< 4294967295 v_z_127) (= .cse180 .cse179))))) .cse111) (or (and (forall ((v_z_133 Int)) (or (forall ((v_y_133 Int)) (let ((.cse182 (* 3022384395 v_z_133)) (.cse181 (* v_y_133 4294967296))) (or (< 4294967295 (+ .cse181 .cse182)) (< (+ .cse181 .cse81 .cse182) 4294967296) (= (+ .cse181 .cse81 (* 3022384394 v_z_133)) .cse144)))) (< (+ v_z_133 .cse144) 4294967296) (< 4294967295 v_z_133))) (forall ((v_z_134 Int)) (or (< 4294967295 (+ v_z_134 .cse144)) (< v_z_134 0) (forall ((v_y_134 Int)) (let ((.cse183 (* 3022384395 v_z_134)) (.cse184 (* v_y_134 4294967296))) (or (< 4294967295 (+ .cse81 .cse183 .cse184)) (< (+ .cse183 .cse184) 0) (= (+ .cse81 .cse184 (* 3022384394 v_z_134)) .cse144)))))) (forall ((v_z_131 Int)) (or (forall ((v_y_131 Int)) (let ((.cse187 (* v_y_131 4294967296))) (let ((.cse185 (+ .cse187 (* 3022384395 v_z_131))) (.cse186 (+ .cse81 .cse187 (* 3022384394 v_z_131)))) (or (< 4294967295 .cse185) (= .cse186 .cse144) (< .cse185 0) (= .cse186 .cse153))))) (< 4294967295 (+ v_z_131 .cse144)) (< v_z_131 0))) (forall ((v_z_134 Int)) (or (< 4294967295 v_z_134) (forall ((v_y_134 Int)) (let ((.cse188 (* 3022384395 v_z_134)) (.cse189 (* v_y_134 4294967296)) (.cse190 (* 3022384394 v_z_134))) (or (< 4294967295 (+ .cse81 .cse188 .cse189)) (< (+ .cse188 .cse189) 0) (= (+ .cse81 .cse189 .cse190) .cse144) (= (+ .cse81 .cse189 .cse190 4294967296) .cse144)))) (< v_z_134 0))) (forall ((v_z_133 Int)) (or (forall ((v_y_133 Int)) (let ((.cse191 (* v_y_133 4294967296)) (.cse192 (* 3022384395 v_z_133))) (or (< 4294967295 (+ .cse191 .cse192)) (= (+ .cse191 .cse81 (* 3022384394 v_z_133)) .cse153) (< (+ .cse191 .cse81 .cse192) 4294967296)))) (< 4294967295 (+ v_z_133 .cse144)) (< v_z_133 0))) (forall ((v_z_133 Int)) (or (< 4294967295 v_z_133) (forall ((v_y_133 Int)) (let ((.cse193 (* v_y_133 4294967296))) (let ((.cse194 (* 3022384395 v_z_133)) (.cse195 (+ .cse193 .cse81 (* 3022384394 v_z_133)))) (or (< 4294967295 (+ .cse193 .cse194)) (= .cse195 .cse153) (< (+ .cse193 .cse81 .cse194) 4294967296) (= .cse195 .cse144))))) (< v_z_133 0))) (forall ((v_z_131 Int)) (or (forall ((v_y_131 Int)) (let ((.cse197 (* 3022384394 v_z_131)) (.cse196 (* v_y_131 4294967296))) (let ((.cse198 (+ .cse196 (* 3022384395 v_z_131))) (.cse199 (+ .cse81 .cse196 .cse197))) (or (= (+ .cse81 .cse196 .cse197 4294967296) .cse144) (< 4294967295 .cse198) (= .cse199 .cse144) (< .cse198 0) (= .cse199 .cse153))))) (< 4294967295 v_z_131) (< v_z_131 0))) (forall ((v_z_134 Int)) (or (< (+ v_z_134 .cse144) 4294967296) (< 4294967295 v_z_134) (forall ((v_y_134 Int)) (let ((.cse200 (* 3022384395 v_z_134)) (.cse201 (* v_y_134 4294967296))) (or (< 4294967295 (+ .cse81 .cse200 .cse201)) (< (+ .cse200 .cse201) 0) (= (+ .cse81 .cse201 (* 3022384394 v_z_134) 4294967296) .cse144)))))) (forall ((v_z_131 Int)) (or (< 4294967295 v_z_131) (< (+ v_z_131 .cse144) 4294967296) (forall ((v_y_131 Int)) (let ((.cse202 (* v_y_131 4294967296))) (let ((.cse203 (* 3022384394 v_z_131)) (.cse204 (+ .cse202 (* 3022384395 v_z_131)))) (or (= (+ .cse81 .cse202 .cse203 4294967296) .cse144) (< 4294967295 .cse204) (= (+ .cse81 .cse202 .cse203) .cse144) (< .cse204 0)))))))) .cse80)))) .cse113) (or (and (forall ((v_z_118 Int)) (let ((.cse205 (+ v_z_118 .cse144)) (.cse206 (mod (+ (* v_z_118 1272582904) .cse42 c_~p2~0) 4294967296))) (or (= .cse205 .cse206) (= .cse205 (+ 4294967296 .cse206)) (< v_z_118 0) (< 4294967295 v_z_118)))) (forall ((v_z_118 Int)) (let ((.cse207 (+ v_z_118 .cse144))) (or (= .cse207 (mod (+ (* v_z_118 1272582904) .cse42 c_~p2~0) 4294967296)) (< 4294967295 .cse207) (< v_z_118 0)))) (forall ((v_z_118 Int)) (let ((.cse208 (+ v_z_118 .cse144))) (or (= .cse208 (+ 4294967296 (mod (+ (* v_z_118 1272582904) .cse42 c_~p2~0) 4294967296))) (< .cse208 4294967296) (< 4294967295 v_z_118))))) .cse41)) .cse114) (or (and (forall ((v_z_113 Int)) (or (< v_z_113 0) (forall ((v_y_113 Int)) (let ((.cse209 (* 3817748709 v_z_113)) (.cse210 (* v_y_113 4294967296))) (or (< (+ .cse209 .cse116 .cse210) 4294967296) (= .cse153 (+ .cse116 .cse210 (* v_z_113 3817748708))) (< 4294967295 (+ .cse209 .cse210))))) (< 4294967295 (+ v_z_113 .cse144)))) (forall ((v_z_115 Int)) (or (forall ((v_y_115 Int)) (let ((.cse213 (* v_y_115 4294967296)) (.cse214 (* v_z_115 3817748708))) (let ((.cse212 (+ .cse213 .cse214 .cse116)) (.cse211 (+ .cse213 (* 3817748709 v_z_115)))) (or (< 4294967295 .cse211) (= .cse212 .cse144) (= .cse153 .cse212) (= (+ .cse213 .cse214 .cse116 4294967296) .cse144) (< .cse211 0))))) (< 4294967295 v_z_115) (< v_z_115 0))) (forall ((v_z_115 Int)) (or (forall ((v_y_115 Int)) (let ((.cse217 (* v_y_115 4294967296))) (let ((.cse216 (+ .cse217 (* v_z_115 3817748708) .cse116)) (.cse215 (+ .cse217 (* 3817748709 v_z_115)))) (or (< 4294967295 .cse215) (= .cse216 .cse144) (= .cse153 .cse216) (< .cse215 0))))) (< 4294967295 (+ v_z_115 .cse144)) (< v_z_115 0))) (forall ((v_z_117 Int)) (or (< 4294967295 v_z_117) (forall ((v_y_117 Int)) (let ((.cse218 (* v_y_117 4294967296)) (.cse219 (* 3817748709 v_z_117))) (or (< (+ .cse218 .cse219) 0) (= (+ (* v_z_117 3817748708) .cse218 .cse116 4294967296) .cse144) (< 4294967295 (+ .cse218 .cse219 .cse116))))) (< (+ v_z_117 .cse144) 4294967296))) (forall ((v_z_113 Int)) (or (< v_z_113 0) (< 4294967295 v_z_113) (forall ((v_y_113 Int)) (let ((.cse221 (* v_y_113 4294967296))) (let ((.cse222 (+ .cse116 .cse221 (* v_z_113 3817748708))) (.cse220 (* 3817748709 v_z_113))) (or (< (+ .cse220 .cse116 .cse221) 4294967296) (= .cse144 .cse222) (= .cse153 .cse222) (< 4294967295 (+ .cse220 .cse221)))))))) (forall ((v_z_115 Int)) (or (forall ((v_y_115 Int)) (let ((.cse224 (* v_y_115 4294967296))) (let ((.cse225 (* v_z_115 3817748708)) (.cse223 (+ .cse224 (* 3817748709 v_z_115)))) (or (< 4294967295 .cse223) (= (+ .cse224 .cse225 .cse116) .cse144) (= (+ .cse224 .cse225 .cse116 4294967296) .cse144) (< .cse223 0))))) (< (+ v_z_115 .cse144) 4294967296) (< 4294967295 v_z_115))) (forall ((v_z_117 Int)) (or (< v_z_117 0) (< 4294967295 (+ v_z_117 .cse144)) (forall ((v_y_117 Int)) (let ((.cse226 (* v_y_117 4294967296)) (.cse227 (* 3817748709 v_z_117))) (or (< (+ .cse226 .cse227) 0) (= (+ (* v_z_117 3817748708) .cse226 .cse116) .cse144) (< 4294967295 (+ .cse226 .cse227 .cse116))))))) (forall ((v_z_117 Int)) (or (< 4294967295 v_z_117) (< v_z_117 0) (forall ((v_y_117 Int)) (let ((.cse230 (* v_z_117 3817748708)) (.cse228 (* v_y_117 4294967296)) (.cse229 (* 3817748709 v_z_117))) (or (< (+ .cse228 .cse229) 0) (= (+ .cse230 .cse228 .cse116 4294967296) .cse144) (= (+ .cse230 .cse228 .cse116) .cse144) (< 4294967295 (+ .cse228 .cse229 .cse116))))))) (forall ((v_z_113 Int)) (or (< 4294967295 v_z_113) (< (+ v_z_113 .cse144) 4294967296) (forall ((v_y_113 Int)) (let ((.cse231 (* 3817748709 v_z_113)) (.cse232 (* v_y_113 4294967296))) (or (< (+ .cse231 .cse116 .cse232) 4294967296) (= .cse144 (+ .cse116 .cse232 (* v_z_113 3817748708))) (< 4294967295 (+ .cse231 .cse232)))))))) .cse140))) (or .cse7 (and (or .cse8 (and (forall ((v_z_109 Int)) (or (< 4294967295 v_z_109) (forall ((v_y_109 Int)) (let ((.cse233 (* v_y_109 4294967296)) (.cse234 (* v_z_109 318145727))) (or (= (+ .cse233 (* 318145726 v_z_109) .cse10) .cse144) (< 4294967295 (+ .cse233 .cse234)) (< (+ .cse233 .cse234 .cse10) 4294967296)))) (< (+ v_z_109 .cse144) 4294967296))) (forall ((v_z_109 Int)) (or (forall ((v_y_109 Int)) (let ((.cse235 (* v_y_109 4294967296)) (.cse236 (* v_z_109 318145727))) (or (< 4294967295 (+ .cse235 .cse236)) (= (+ .cse235 (* 318145726 v_z_109) .cse10) .cse153) (< (+ .cse235 .cse236 .cse10) 4294967296)))) (< v_z_109 0) (< 4294967295 (+ v_z_109 .cse144)))) (forall ((v_z_110 Int)) (or (< (+ v_z_110 .cse144) 4294967296) (< 4294967295 v_z_110) (forall ((v_y_110 Int)) (let ((.cse238 (* v_y_110 4294967296))) (let ((.cse239 (+ (* v_z_110 318145727) .cse238)) (.cse237 (* 318145726 v_z_110))) (or (= (+ .cse237 .cse238 .cse10) .cse144) (< 4294967295 .cse239) (< .cse239 0) (= (+ .cse237 .cse238 4294967296 .cse10) .cse144))))))) (forall ((v_z_110 Int)) (or (< 4294967295 v_z_110) (< v_z_110 0) (forall ((v_y_110 Int)) (let ((.cse242 (* v_z_110 318145727)) (.cse240 (* 318145726 v_z_110)) (.cse241 (* v_y_110 4294967296))) (or (= (+ .cse240 .cse241 .cse10) .cse144) (< 4294967295 (+ .cse242 .cse241 .cse10)) (< (+ .cse242 .cse241) 0) (= (+ .cse240 .cse241 4294967296 .cse10) .cse144)))))) (forall ((v_z_110 Int)) (or (< (+ v_z_110 .cse144) 4294967296) (< 4294967295 v_z_110) (forall ((v_y_110 Int)) (let ((.cse243 (* v_z_110 318145727)) (.cse244 (* v_y_110 4294967296))) (or (< 4294967295 (+ .cse243 .cse244 .cse10)) (< (+ .cse243 .cse244) 0) (= (+ (* 318145726 v_z_110) .cse244 4294967296 .cse10) .cse144)))))) (forall ((v_z_110 Int)) (or (< 4294967295 v_z_110) (< v_z_110 0) (forall ((v_y_110 Int)) (let ((.cse247 (* 318145726 v_z_110)) (.cse248 (* v_y_110 4294967296))) (let ((.cse246 (+ (* v_z_110 318145727) .cse248)) (.cse245 (+ .cse247 .cse248 .cse10))) (or (= .cse245 .cse144) (< 4294967295 .cse246) (< .cse246 0) (= (+ .cse247 .cse248 4294967296 .cse10) .cse144) (= .cse153 .cse245))))))) (forall ((v_z_110 Int)) (or (< 4294967295 (+ v_z_110 .cse144)) (forall ((v_y_110 Int)) (let ((.cse250 (* v_z_110 318145727)) (.cse249 (* v_y_110 4294967296))) (or (= (+ (* 318145726 v_z_110) .cse249 .cse10) .cse144) (< 4294967295 (+ .cse250 .cse249 .cse10)) (< (+ .cse250 .cse249) 0)))) (< v_z_110 0))) (forall ((v_z_109 Int)) (or (< 4294967295 v_z_109) (< v_z_109 0) (forall ((v_y_109 Int)) (let ((.cse252 (* v_y_109 4294967296))) (let ((.cse251 (+ .cse252 (* 318145726 v_z_109) .cse10)) (.cse253 (* v_z_109 318145727))) (or (= .cse251 .cse144) (< 4294967295 (+ .cse252 .cse253)) (= .cse251 .cse153) (< (+ .cse252 .cse253 .cse10) 4294967296))))))) (forall ((v_z_110 Int)) (or (< 4294967295 (+ v_z_110 .cse144)) (< v_z_110 0) (forall ((v_y_110 Int)) (let ((.cse256 (* v_y_110 4294967296))) (let ((.cse255 (+ (* v_z_110 318145727) .cse256)) (.cse254 (+ (* 318145726 v_z_110) .cse256 .cse10))) (or (= .cse254 .cse144) (< 4294967295 .cse255) (< .cse255 0) (= .cse153 .cse254))))))))) (or .cse35 (and (forall ((v_z_106 Int)) (let ((.cse257 (+ v_z_106 .cse144))) (or (< v_z_106 0) (= .cse257 (mod (+ (* 2067947218 v_z_106) .cse38 c_~p2~0) 4294967296)) (< 4294967295 .cse257)))) (forall ((v_z_106 Int)) (let ((.cse259 (mod (+ (* 2067947218 v_z_106) .cse38 c_~p2~0) 4294967296)) (.cse258 (+ v_z_106 .cse144))) (or (< v_z_106 0) (< 4294967295 v_z_106) (= .cse258 .cse259) (= (+ .cse259 4294967296) .cse258)))) (forall ((v_z_106 Int)) (let ((.cse260 (+ v_z_106 .cse144))) (or (< 4294967295 v_z_106) (< .cse260 4294967296) (= (+ (mod (+ (* 2067947218 v_z_106) .cse38 c_~p2~0) 4294967296) 4294967296) .cse260))))))))))))) (not (= c_~n1~0 27))))) (< c_~n2~0 36)) is different from false [2024-10-18 17:58:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 0 proven. 972 refuted. 1 times theorem prover too weak. 0 trivial. 11 not checked. [2024-10-18 17:58:11,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478183338] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 17:58:11,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 17:58:11,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 42, 66] total 164 [2024-10-18 17:58:11,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54154982] [2024-10-18 17:58:11,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 17:58:11,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 165 states [2024-10-18 17:58:11,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 17:58:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1643774896, now seen corresponding path program 1 times [2024-10-18 17:58:11,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:58:11,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:58:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:58:11,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:58:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:58:11,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2024-10-18 17:58:11,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4799, Invalid=21927, Unknown=10, NotChecked=324, Total=27060 [2024-10-18 17:58:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:58:11,521 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 17:58:11,522 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-18 17:58:11,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:58:11,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:58:11,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 17:58:11,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 17:58:11,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-18 17:58:11,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 450 states. [2024-10-18 17:58:11,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-18 17:58:11,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:01:36,586 WARN L286 SmtUtils]: Spent 36.39s on a formula simplification. DAG size of input: 276 DAG size of output: 145 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 18:01:43,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15