./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking FORWARD -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking FORWARD -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 20:10:07,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 20:10:07,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 20:10:07,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 20:10:07,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 20:10:07,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 20:10:07,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 20:10:07,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 20:10:07,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 20:10:07,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 20:10:07,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 20:10:07,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 20:10:07,635 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 20:10:07,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 20:10:07,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 20:10:07,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 20:10:07,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 20:10:07,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 20:10:07,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 20:10:07,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 20:10:07,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 20:10:07,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 20:10:07,640 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 20:10:07,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 20:10:07,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 20:10:07,641 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 20:10:07,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 20:10:07,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 20:10:07,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 20:10:07,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 20:10:07,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 20:10:07,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 20:10:07,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 20:10:07,643 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 20:10:07,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 20:10:07,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 20:10:07,644 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 20:10:07,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 20:10:07,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 20:10:07,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 20:10:07,645 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 20:10:07,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> FORWARD [2024-10-17 20:10:07,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 20:10:07,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 20:10:07,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 20:10:07,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 20:10:07,942 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 20:10:07,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-10-17 20:10:09,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 20:10:09,595 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 20:10:09,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-10-17 20:10:09,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9fe75c0a8/78e91e49999a4b779c9398f6154255c5/FLAG111eb507f [2024-10-17 20:10:09,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9fe75c0a8/78e91e49999a4b779c9398f6154255c5 [2024-10-17 20:10:09,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 20:10:09,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 20:10:09,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 20:10:09,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 20:10:09,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 20:10:09,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 08:10:09" (1/1) ... [2024-10-17 20:10:09,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c14246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:10:09, skipping insertion in model container [2024-10-17 20:10:09,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 08:10:09" (1/1) ... [2024-10-17 20:10:09,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 20:10:09,843 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c[3425,3438] [2024-10-17 20:10:09,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 20:10:09,855 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 20:10:09,875 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c[3425,3438] [2024-10-17 20:10:09,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 20:10:09,890 INFO L204 MainTranslator]: Completed translation [2024-10-17 20:10:09,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:10:09 WrapperNode [2024-10-17 20:10:09,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 20:10:09,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 20:10:09,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 20:10:09,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 20:10:09,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:10:09" (1/1) ... [2024-10-17 20:10:09,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:10:09" (1/1) ... [2024-10-17 20:10:09,921 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-10-17 20:10:09,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 20:10:09,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 20:10:09,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 20:10:09,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 20:10:09,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:10:09" (1/1) ... [2024-10-17 20:10:09,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:10:09" (1/1) ... [2024-10-17 20:10:09,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:10:09" (1/1) ... [2024-10-17 20:10:09,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:10:09" (1/1) ... [2024-10-17 20:10:09,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:10:09" (1/1) ... [2024-10-17 20:10:09,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:10:09" (1/1) ... [2024-10-17 20:10:09,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:10:09" (1/1) ... [2024-10-17 20:10:09,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:10:09" (1/1) ... [2024-10-17 20:10:09,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 20:10:09,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 20:10:09,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 20:10:09,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 20:10:09,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:10:09" (1/1) ... [2024-10-17 20:10:09,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 20:10:09,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:10:09,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-17 20:10:09,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-17 20:10:10,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 20:10:10,030 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-17 20:10:10,030 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-17 20:10:10,030 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-17 20:10:10,030 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-17 20:10:10,030 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-17 20:10:10,031 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-17 20:10:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-17 20:10:10,031 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-17 20:10:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 20:10:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-17 20:10:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-17 20:10:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 20:10:10,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 20:10:10,033 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 20:10:10,116 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 20:10:10,118 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 20:10:10,319 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 20:10:10,319 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 20:10:10,488 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 20:10:10,488 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-17 20:10:10,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 08:10:10 BoogieIcfgContainer [2024-10-17 20:10:10,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 20:10:10,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 20:10:10,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 20:10:10,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 20:10:10,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 08:10:09" (1/3) ... [2024-10-17 20:10:10,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41be54ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 08:10:10, skipping insertion in model container [2024-10-17 20:10:10,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:10:09" (2/3) ... [2024-10-17 20:10:10,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41be54ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 08:10:10, skipping insertion in model container [2024-10-17 20:10:10,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 08:10:10" (3/3) ... [2024-10-17 20:10:10,499 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-10-17 20:10:10,515 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 20:10:10,515 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 20:10:10,515 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 20:10:10,580 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-17 20:10:10,619 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 20:10:10,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 20:10:10,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:10:10,622 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 20:10:10,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-17 20:10:10,709 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 20:10:10,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:10:10,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 20:10:10,741 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;@73d9e0e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=FORWARD, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 20:10:10,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-17 20:10:13,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 20:10:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1319336203, now seen corresponding path program 1 times [2024-10-17 20:10:13,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:13,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:13,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:13,592 INFO L85 PathProgramCache]: Analyzing trace with hash 564378240, now seen corresponding path program 1 times [2024-10-17 20:10:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:13,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:10:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:15,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:16,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:10:16,283 INFO L85 PathProgramCache]: Analyzing trace with hash -650195845, now seen corresponding path program 1 times [2024-10-17 20:10:16,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:16,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:16,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:16,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1928252765, now seen corresponding path program 1 times [2024-10-17 20:10:16,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:16,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-17 20:10:16,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:16,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-17 20:10:16,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:10:16,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1752138499, now seen corresponding path program 1 times [2024-10-17 20:10:16,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:10:16,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194836447] [2024-10-17 20:10:16,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:16,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-17 20:10:17,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:10:17,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194836447] [2024-10-17 20:10:17,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194836447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:10:17,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:10:17,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-17 20:10:17,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691534112] [2024-10-17 20:10:17,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:10:17,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-17 20:10:17,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:10:17,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-17 20:10:17,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-17 20:10:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:10:17,344 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:10:17,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:10:17,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:10:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:10:17,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable0 [2024-10-17 20:10:17,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 20:10:17,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1765656763, now seen corresponding path program 1 times [2024-10-17 20:10:17,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:17,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:17,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:18,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1738458474, now seen corresponding path program 1 times [2024-10-17 20:10:18,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:18,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:10:21,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:21,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:10:23,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:10:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash -506789776, now seen corresponding path program 2 times [2024-10-17 20:10:23,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:10:23,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608533236] [2024-10-17 20:10:23,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:23,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 111 proven. 94 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 20:10:25,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:10:25,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608533236] [2024-10-17 20:10:25,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608533236] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 20:10:25,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522987077] [2024-10-17 20:10:25,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 20:10:25,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 20:10:25,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:10:25,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 20:10:25,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-17 20:10:25,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 20:10:25,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 20:10:25,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 20:10:25,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:10:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-17 20:10:25,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:10:25,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522987077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:10:25,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-17 20:10:25,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2024-10-17 20:10:25,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144359497] [2024-10-17 20:10:25,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:10:25,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 20:10:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:10:25,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 20:10:25,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2024-10-17 20:10:25,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:10:25,742 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:10:25,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:10:25,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:10:25,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:10:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:10:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:10:26,109 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-17 20:10:26,291 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,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2024-10-17 20:10:26,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 20:10:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1765656769, now seen corresponding path program 1 times [2024-10-17 20:10:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:26,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:26,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1738458466, now seen corresponding path program 1 times [2024-10-17 20:10:26,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:26,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:10:28,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:28,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:10:29,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:10:29,879 INFO L85 PathProgramCache]: Analyzing trace with hash 564381910, now seen corresponding path program 3 times [2024-10-17 20:10:29,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:10:29,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038737455] [2024-10-17 20:10:29,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-17 20:10:30,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:10:30,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038737455] [2024-10-17 20:10:30,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038737455] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 20:10:30,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835269640] [2024-10-17 20:10:30,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 20:10:30,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 20:10:30,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:10:30,327 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 20:10:30,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-17 20:10:30,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-17 20:10:30,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 20:10:30,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-17 20:10:30,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:10:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-17 20:10:30,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 20:10:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-17 20:10:30,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835269640] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 20:10:30,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 20:10:30,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-17 20:10:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507708335] [2024-10-17 20:10:30,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 20:10:30,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 20:10:30,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:10:30,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 20:10:30,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-17 20:10:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:10:30,658 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:10:30,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:10:30,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:10:30,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:10:30,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:10:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:10:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:10:31,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 20:10:31,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-17 20:10:31,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14 [2024-10-17 20:10:31,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 20:10:31,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164565, now seen corresponding path program 1 times [2024-10-17 20:10:31,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:31,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:31,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:32,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1012446630, now seen corresponding path program 1 times [2024-10-17 20:10:32,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:32,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1243371772, now seen corresponding path program 1 times [2024-10-17 20:10:32,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:32,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:32,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:32,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1493601786, now seen corresponding path program 1 times [2024-10-17 20:10:32,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:32,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:32,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:32,850 INFO L85 PathProgramCache]: Analyzing trace with hash 148797665, now seen corresponding path program 1 times [2024-10-17 20:10:32,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:32,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-17 20:10:33,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:33,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-17 20:10:33,725 INFO L85 PathProgramCache]: Analyzing trace with hash -356756194, now seen corresponding path program 1 times [2024-10-17 20:10:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:33,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-17 20:10:34,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:34,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-17 20:10:34,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1946192342, now seen corresponding path program 1 times [2024-10-17 20:10:34,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:34,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-10-17 20:10:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:34,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-10-17 20:10:35,431 INFO L85 PathProgramCache]: Analyzing trace with hash 999052780, now seen corresponding path program 1 times [2024-10-17 20:10:35,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:35,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-17 20:10:35,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:35,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-17 20:10:36,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:10:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1323657417, now seen corresponding path program 4 times [2024-10-17 20:10:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:10:36,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296303758] [2024-10-17 20:10:36,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:36,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 438 proven. 298 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-17 20:10:41,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:10:41,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296303758] [2024-10-17 20:10:41,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296303758] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 20:10:41,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231567866] [2024-10-17 20:10:41,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-17 20:10:41,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 20:10:41,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:10:41,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 20:10:41,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-17 20:10:41,586 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-17 20:10:41,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 20:10:41,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 20:10:41,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:10:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-10-17 20:10:41,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:10:41,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231567866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:10:41,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-17 20:10:41,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [24] total 28 [2024-10-17 20:10:41,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452387708] [2024-10-17 20:10:41,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:10:41,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 20:10:41,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:10:41,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 20:10:41,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-10-17 20:10:41,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:10:41,678 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:10:41,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:10:41,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:10:41,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:10:41,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 20:10:41,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:10:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:10:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:10:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 20:10:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:10:42,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-17 20:10:42,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable15,SelfDestructingSolverStorable26,SelfDestructingSolverStorable16,SelfDestructingSolverStorable27,SelfDestructingSolverStorable17 [2024-10-17 20:10:42,284 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 20:10:42,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164593, now seen corresponding path program 1 times [2024-10-17 20:10:42,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:42,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:42,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash -749118964, now seen corresponding path program 1 times [2024-10-17 20:10:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:42,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:42,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash -396186420, now seen corresponding path program 1 times [2024-10-17 20:10:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:42,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:42,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:43,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1197215623, now seen corresponding path program 1 times [2024-10-17 20:10:43,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:43,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:43,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:43,525 INFO L85 PathProgramCache]: Analyzing trace with hash 368111902, now seen corresponding path program 1 times [2024-10-17 20:10:43,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:43,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:43,899 INFO L85 PathProgramCache]: Analyzing trace with hash -595742189, now seen corresponding path program 1 times [2024-10-17 20:10:43,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:43,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:44,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:44,370 INFO L85 PathProgramCache]: Analyzing trace with hash -955123055, now seen corresponding path program 1 times [2024-10-17 20:10:44,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:44,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:44,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:44,776 INFO L85 PathProgramCache]: Analyzing trace with hash 83246335, now seen corresponding path program 1 times [2024-10-17 20:10:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:44,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:44,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:10:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:10:45,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1650497026, now seen corresponding path program 1 times [2024-10-17 20:10:45,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:45,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:10:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 20:10:57,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:10:57,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:10:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:11:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 20:11:06,765 INFO L85 PathProgramCache]: Analyzing trace with hash 25582907, now seen corresponding path program 1 times [2024-10-17 20:11:06,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:11:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:11:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:11:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-10-17 20:11:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:11:07,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:11:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:11:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-10-17 20:11:07,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1702001671, now seen corresponding path program 1 times [2024-10-17 20:11:07,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:11:07,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:11:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:11:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 35 proven. 537 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-17 20:11:22,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:11:22,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:11:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:11:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 35 proven. 537 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-17 20:11:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2146642941, now seen corresponding path program 1 times [2024-10-17 20:11:33,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:11:33,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:11:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:11:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 28 proven. 532 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 20:11:47,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:11:47,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:11:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:11:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 28 proven. 532 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 20:11:58,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:11:58,769 INFO L85 PathProgramCache]: Analyzing trace with hash 589879332, now seen corresponding path program 5 times [2024-10-17 20:11:58,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:11:58,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006852624] [2024-10-17 20:11:58,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:11:58,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:11:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:11:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 967 proven. 4 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2024-10-17 20:11:59,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:11:59,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006852624] [2024-10-17 20:11:59,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006852624] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 20:11:59,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144142889] [2024-10-17 20:11:59,374 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-17 20:11:59,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 20:11:59,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:11:59,377 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 20:11:59,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-17 20:11:59,595 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-10-17 20:11:59,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 20:11:59,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-17 20:11:59,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:11:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 986 proven. 82 refuted. 0 times theorem prover too weak. 1494 trivial. 0 not checked. [2024-10-17 20:11:59,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 20:11:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 967 proven. 4 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2024-10-17 20:11:59,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144142889] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 20:11:59,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 20:11:59,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2024-10-17 20:11:59,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118182043] [2024-10-17 20:11:59,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 20:11:59,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-17 20:11:59,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:11:59,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-17 20:11:59,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-17 20:11:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:11:59,807 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:11:59,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:11:59,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:11:59,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:11:59,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 20:11:59,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:11:59,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:12:00,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:12:00,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:12:00,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 20:12:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:12:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-17 20:12:00,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-17 20:12:00,851 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,SelfDestructingSolverStorable30,SelfDestructingSolverStorable41,SelfDestructingSolverStorable31,SelfDestructingSolverStorable42,SelfDestructingSolverStorable29,SelfDestructingSolverStorable32,SelfDestructingSolverStorable43,SelfDestructingSolverStorable33,SelfDestructingSolverStorable44,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable28,SelfDestructingSolverStorable39 [2024-10-17 20:12:00,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 20:12:01,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164641, now seen corresponding path program 1 times [2024-10-17 20:12:01,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:12:01,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:12:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:01,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:12:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:01,180 INFO L85 PathProgramCache]: Analyzing trace with hash -749118916, now seen corresponding path program 1 times [2024-10-17 20:12:01,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:12:01,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:12:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:01,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:12:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:01,381 INFO L85 PathProgramCache]: Analyzing trace with hash -396186372, now seen corresponding path program 1 times [2024-10-17 20:12:01,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:12:01,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:12:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:01,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:12:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:01,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1197215575, now seen corresponding path program 1 times [2024-10-17 20:12:01,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:12:01,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:12:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:01,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:12:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash 368111950, now seen corresponding path program 1 times [2024-10-17 20:12:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:12:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:12:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:02,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:12:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:02,248 INFO L85 PathProgramCache]: Analyzing trace with hash -595742141, now seen corresponding path program 1 times [2024-10-17 20:12:02,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:12:02,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:12:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:02,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:12:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:02,626 INFO L85 PathProgramCache]: Analyzing trace with hash -955123007, now seen corresponding path program 1 times [2024-10-17 20:12:02,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:12:02,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:12:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:02,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:12:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:02,927 INFO L85 PathProgramCache]: Analyzing trace with hash 83246383, now seen corresponding path program 1 times [2024-10-17 20:12:02,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:12:02,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:12:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:03,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:12:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:12:03,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1650496978, now seen corresponding path program 1 times [2024-10-17 20:12:03,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:12:03,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:12:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:12:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 20:12:11,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:12:11,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:12:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:12:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 20:12:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2054584070, now seen corresponding path program 1 times [2024-10-17 20:12:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:12:20,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:12:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:12:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 46 proven. 502 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-17 20:12:35,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:12:35,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:12:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:12:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 46 proven. 502 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-17 20:12:47,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:12:47,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1596812803, now seen corresponding path program 6 times [2024-10-17 20:12:47,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:12:47,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364643623] [2024-10-17 20:12:47,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:12:47,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:12:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:13:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 319 proven. 1653 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-17 20:13:00,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:13:00,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364643623] [2024-10-17 20:13:00,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364643623] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 20:13:00,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229390449] [2024-10-17 20:13:00,405 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-17 20:13:00,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 20:13:00,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:13:00,407 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 20:13:00,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-17 20:13:00,757 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2024-10-17 20:13:00,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 20:13:00,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-10-17 20:13:00,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:13:15,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 227 proven. 1735 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-17 20:13:15,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 20:13:23,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 234 proven. 1757 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-17 20:13:23,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229390449] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 20:13:23,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 20:13:23,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 70, 95] total 241 [2024-10-17 20:13:23,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865820715] [2024-10-17 20:13:23,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 20:13:23,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 242 states [2024-10-17 20:13:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:13:23,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 242 interpolants. [2024-10-17 20:13:23,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12422, Invalid=45900, Unknown=0, NotChecked=0, Total=58322 [2024-10-17 20:13:23,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:13:23,181 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:13:23,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 242 states, 242 states have (on average 2.731404958677686) internal successors, (661), 241 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:13:23,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:13:23,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:13:23,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 20:13:23,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:13:23,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-17 20:13:23,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:14:30,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:14:30,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:14:30,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 20:14:30,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:14:30,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-17 20:14:30,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 446 states. [2024-10-17 20:14:30,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-17 20:14:30,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55,SelfDestructingSolverStorable45,SelfDestructingSolverStorable56,SelfDestructingSolverStorable46,SelfDestructingSolverStorable57,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2024-10-17 20:14:30,729 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 20:14:30,882 INFO L85 PathProgramCache]: Analyzing trace with hash 916806543, now seen corresponding path program 1 times [2024-10-17 20:14:30,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:14:30,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:14:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:14:30,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:14:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:14:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash 740751597, now seen corresponding path program 1 times [2024-10-17 20:14:31,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:14:31,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:14:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:14:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 306 proven. 3 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2024-10-17 20:14:31,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:14:31,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:14:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:14:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 306 proven. 3 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2024-10-17 20:14:32,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:14:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash 29873356, now seen corresponding path program 7 times [2024-10-17 20:14:32,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:14:32,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539223519] [2024-10-17 20:14:32,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:14:32,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:14:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:14:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 973 proven. 1 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-10-17 20:14:32,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:14:32,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539223519] [2024-10-17 20:14:32,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539223519] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 20:14:32,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136656451] [2024-10-17 20:14:32,849 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-17 20:14:32,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 20:14:32,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:14:32,850 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 20:14:32,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-17 20:14:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:14:32,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-17 20:14:32,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:14:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 973 proven. 1 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-10-17 20:14:33,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 20:14:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 907 proven. 394 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-10-17 20:14:33,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136656451] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 20:14:33,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 20:14:33,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 23] total 30 [2024-10-17 20:14:33,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436449230] [2024-10-17 20:14:33,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 20:14:33,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-17 20:14:33,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:14:33,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-17 20:14:33,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2024-10-17 20:14:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:14:33,708 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:14:33,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.833333333333333) internal successors, (145), 30 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:14:33,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:14:33,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:14:33,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 20:14:33,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:14:33,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-17 20:14:33,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 446 states. [2024-10-17 20:14:33,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:14:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:14:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:14:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 20:14:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:14:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-17 20:14:35,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2024-10-17 20:14:35,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-17 20:14:35,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-17 20:14:35,859 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,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2024-10-17 20:14:35,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 20:14:36,009 INFO L85 PathProgramCache]: Analyzing trace with hash 916806571, now seen corresponding path program 1 times [2024-10-17 20:14:36,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:14:36,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:14:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:14:36,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:14:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:14:36,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2049167269, now seen corresponding path program 1 times [2024-10-17 20:14:36,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:14:36,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:14:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:14:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 138 proven. 814 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-17 20:14:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:14:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:14:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:14:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 138 proven. 814 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-17 20:14:52,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:14:52,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1221599718, now seen corresponding path program 8 times [2024-10-17 20:14:52,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:14:52,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554331764] [2024-10-17 20:14:52,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:14:52,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:14:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:15:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 308 proven. 611 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-17 20:15:00,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:15:00,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554331764] [2024-10-17 20:15:00,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554331764] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 20:15:00,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286256531] [2024-10-17 20:15:00,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 20:15:00,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 20:15:00,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:15:00,211 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 20:15:00,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-17 20:15:00,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 20:15:00,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 20:15:00,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-17 20:15:00,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:15:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 230 proven. 684 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-17 20:15:09,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 20:18:20,262 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse142 (= c_~n2~0 36)) (.cse7 (< 38 c_~n2~0)) (.cse14 (= c_~n2~0 38)) (.cse17 (mod (+ (* 4294967259 c_~p1~0) c_~p2~0) 4294967296)) (.cse13 (= c_~n2~0 37)) (.cse9 (* 4294967258 c_~p1~0)) (.cse43 (mod (+ (* c_~p1~0 4294967257) c_~p2~0) 4294967296)) (.cse66 (< 39 c_~n2~0)) (.cse72 (< 40 c_~n2~0)) (.cse68 (* c_~p1~0 4294967256)) (.cse73 (= 40 c_~n2~0)) (.cse106 (< c_~n2~0 43)) (.cse74 (mod (+ (* 4294967253 c_~p1~0) c_~p2~0) 4294967296)) (.cse99 (< 43 c_~n2~0)) (.cse101 (* c_~p1~0 4294967252)) (.cse105 (= c_~n2~0 43)) (.cse139 (= 42 c_~n2~0)) (.cse116 (mod (+ (* c_~p1~0 4294967255) c_~p2~0) 4294967296)) (.cse113 (= 41 c_~n2~0)) (.cse108 (* 4294967254 c_~p1~0)) (.cse107 (< 42 c_~n2~0)) (.cse140 (= c_~n2~0 39)) (.cse141 (< c_~n2~0 39)) (.cse1 (* 4294967260 c_~p1~0)) (.cse6 (< 36 c_~n2~0))) (and (or (not (= c_~n1~0 27)) (let ((.cse2 (* (mod (* 2147483635 c_~p1~0) 2147483648) 2))) (and (or (and (forall ((v_z_104 Int)) (let ((.cse0 (+ v_z_104 .cse2))) (or (< 4294967295 .cse0) (= .cse0 (mod (+ .cse1 (* 2863311532 v_z_104) c_~p2~0) 4294967296)) (< v_z_104 0)))) (forall ((v_z_104 Int)) (let ((.cse3 (+ v_z_104 .cse2))) (or (< 4294967295 v_z_104) (< .cse3 4294967296) (= .cse3 (+ 4294967296 (mod (+ .cse1 (* 2863311532 v_z_104) c_~p2~0) 4294967296)))))) (forall ((v_z_104 Int)) (let ((.cse4 (+ v_z_104 .cse2)) (.cse5 (mod (+ .cse1 (* 2863311532 v_z_104) c_~p2~0) 4294967296))) (or (< 4294967295 v_z_104) (= .cse4 .cse5) (< v_z_104 0) (= .cse4 (+ 4294967296 .cse5)))))) .cse6) (or (let ((.cse23 (+ 4294967296 .cse2))) (and (or .cse7 (and (or (and (forall ((v_z_103 Int)) (let ((.cse8 (+ v_z_103 .cse2))) (or (< .cse8 4294967296) (< 4294967295 v_z_103) (= (+ 4294967296 (mod (+ (* 2067947218 v_z_103) .cse9 c_~p2~0) 4294967296)) .cse8)))) (forall ((v_z_103 Int)) (let ((.cse10 (+ v_z_103 .cse2))) (or (< 4294967295 .cse10) (= (mod (+ (* 2067947218 v_z_103) .cse9 c_~p2~0) 4294967296) .cse10) (< v_z_103 0)))) (forall ((v_z_103 Int)) (let ((.cse11 (mod (+ (* 2067947218 v_z_103) .cse9 c_~p2~0) 4294967296)) (.cse12 (+ v_z_103 .cse2))) (or (= .cse11 .cse12) (< 4294967295 v_z_103) (= (+ 4294967296 .cse11) .cse12) (< v_z_103 0))))) .cse13) (or .cse14 (and (forall ((v_z_102 Int)) (or (forall ((v_y_102 Int)) (let ((.cse15 (* v_y_102 4294967296))) (let ((.cse18 (+ .cse15 (* v_z_102 318145727))) (.cse16 (* 318145726 v_z_102))) (or (= (+ .cse15 .cse16 4294967296 .cse17) .cse2) (< 4294967295 .cse18) (< .cse18 0) (= (+ .cse15 .cse16 .cse17) .cse2))))) (< (+ v_z_102 .cse2) 4294967296) (< 4294967295 v_z_102))) (forall ((v_z_102 Int)) (or (< v_z_102 0) (forall ((v_y_102 Int)) (let ((.cse20 (* 318145726 v_z_102)) (.cse19 (* v_y_102 4294967296))) (let ((.cse21 (+ .cse19 (* v_z_102 318145727))) (.cse22 (+ .cse19 .cse20 .cse17))) (or (= (+ .cse19 .cse20 4294967296 .cse17) .cse2) (< 4294967295 .cse21) (< .cse21 0) (= .cse22 .cse23) (= .cse22 .cse2))))) (< 4294967295 v_z_102))) (forall ((v_z_101 Int)) (or (< 4294967295 (+ v_z_101 .cse2)) (forall ((v_y_101 Int)) (let ((.cse25 (* v_z_101 318145727)) (.cse24 (* v_y_101 4294967296))) (or (< (+ .cse24 .cse25) 0) (< 4294967295 (+ .cse24 .cse25 .cse17)) (= (+ (* 318145726 v_z_101) .cse24 .cse17) .cse2)))) (< v_z_101 0))) (forall ((v_z_102 Int)) (or (< 4294967295 (+ v_z_102 .cse2)) (< v_z_102 0) (forall ((v_y_102 Int)) (let ((.cse28 (* v_y_102 4294967296))) (let ((.cse26 (+ .cse28 (* v_z_102 318145727))) (.cse27 (+ .cse28 (* 318145726 v_z_102) .cse17))) (or (< 4294967295 .cse26) (< .cse26 0) (= .cse27 .cse23) (= .cse27 .cse2))))))) (forall ((v_z_102 Int)) (or (forall ((v_y_102 Int)) (let ((.cse30 (* v_z_102 318145727)) (.cse29 (* v_y_102 4294967296))) (or (< (+ .cse29 .cse30 .cse17) 4294967296) (< 4294967295 (+ .cse29 .cse30)) (= (+ .cse29 (* 318145726 v_z_102) .cse17) .cse2)))) (< (+ v_z_102 .cse2) 4294967296) (< 4294967295 v_z_102))) (forall ((v_z_102 Int)) (or (forall ((v_y_102 Int)) (let ((.cse31 (* v_y_102 4294967296))) (let ((.cse32 (* v_z_102 318145727)) (.cse33 (+ .cse31 (* 318145726 v_z_102) .cse17))) (or (< (+ .cse31 .cse32 .cse17) 4294967296) (< 4294967295 (+ .cse31 .cse32)) (= .cse33 .cse23) (= .cse33 .cse2))))) (< v_z_102 0) (< 4294967295 v_z_102))) (forall ((v_z_101 Int)) (or (forall ((v_y_101 Int)) (let ((.cse35 (* v_z_101 318145727)) (.cse34 (* v_y_101 4294967296))) (or (< (+ .cse34 .cse35) 0) (< 4294967295 (+ .cse34 .cse35 .cse17)) (= (+ (* 318145726 v_z_101) .cse34 4294967296 .cse17) .cse2)))) (< 4294967295 v_z_101) (< (+ v_z_101 .cse2) 4294967296))) (forall ((v_z_101 Int)) (or (< 4294967295 v_z_101) (< v_z_101 0) (forall ((v_y_101 Int)) (let ((.cse37 (* v_z_101 318145727)) (.cse38 (* 318145726 v_z_101)) (.cse36 (* v_y_101 4294967296))) (or (< (+ .cse36 .cse37) 0) (< 4294967295 (+ .cse36 .cse37 .cse17)) (= (+ .cse38 .cse36 4294967296 .cse17) .cse2) (= (+ .cse38 .cse36 .cse17) .cse2)))))) (forall ((v_z_102 Int)) (or (forall ((v_y_102 Int)) (let ((.cse40 (* v_z_102 318145727)) (.cse39 (* v_y_102 4294967296))) (or (< (+ .cse39 .cse40 .cse17) 4294967296) (< 4294967295 (+ .cse39 .cse40)) (= (+ .cse39 (* 318145726 v_z_102) .cse17) .cse23)))) (< 4294967295 (+ v_z_102 .cse2)) (< v_z_102 0))))))) (or (and (or (and (forall ((v_z_78 Int)) (or (< (+ v_z_78 .cse2) 4294967296) (< 4294967295 v_z_78) (forall ((v_y_78 Int)) (let ((.cse41 (* v_y_78 4294967296)) (.cse42 (* v_z_78 3817748709))) (or (< (+ .cse41 .cse42) 0) (= .cse2 (+ .cse41 (* v_z_78 3817748708) .cse43 4294967296)) (< 4294967295 (+ .cse41 .cse42 .cse43))))))) (forall ((v_z_80 Int)) (or (< 4294967295 (+ v_z_80 .cse2)) (< v_z_80 0) (forall ((v_y_80 Int)) (let ((.cse46 (* v_y_80 4294967296))) (let ((.cse45 (+ .cse46 .cse43 (* v_z_80 3817748708))) (.cse44 (+ (* v_z_80 3817748709) .cse46))) (or (< 4294967295 .cse44) (= .cse23 .cse45) (= .cse45 .cse2) (< .cse44 0))))))) (forall ((v_z_78 Int)) (or (forall ((v_y_78 Int)) (let ((.cse48 (* v_z_78 3817748709)) (.cse47 (* v_y_78 4294967296)) (.cse49 (* v_z_78 3817748708))) (or (< (+ .cse47 .cse48) 0) (= .cse2 (+ .cse47 .cse49 .cse43 4294967296)) (< 4294967295 (+ .cse47 .cse48 .cse43)) (= (+ .cse47 .cse49 .cse43) .cse2)))) (< 4294967295 v_z_78) (< v_z_78 0))) (forall ((v_z_80 Int)) (or (forall ((v_y_80 Int)) (let ((.cse51 (* v_y_80 4294967296)) (.cse52 (* v_z_80 3817748708))) (let ((.cse53 (+ .cse51 .cse43 .cse52)) (.cse50 (+ (* v_z_80 3817748709) .cse51))) (or (< 4294967295 .cse50) (= (+ .cse51 .cse43 4294967296 .cse52) .cse2) (= .cse23 .cse53) (= .cse53 .cse2) (< .cse50 0))))) (< 4294967295 v_z_80) (< v_z_80 0))) (forall ((v_z_81 Int)) (or (< 4294967295 (+ v_z_81 .cse2)) (< v_z_81 0) (forall ((v_y_81 Int)) (let ((.cse54 (* v_z_81 3817748709)) (.cse55 (* v_y_81 4294967296))) (or (< (+ .cse54 .cse43 .cse55) 4294967296) (= .cse23 (+ (* v_z_81 3817748708) .cse43 .cse55)) (< 4294967295 (+ .cse54 .cse55))))))) (forall ((v_z_81 Int)) (or (< 4294967295 v_z_81) (forall ((v_y_81 Int)) (let ((.cse57 (* v_z_81 3817748709)) (.cse56 (* v_y_81 4294967296))) (or (= (+ (* v_z_81 3817748708) .cse43 .cse56) .cse2) (< (+ .cse57 .cse43 .cse56) 4294967296) (< 4294967295 (+ .cse57 .cse56))))) (< (+ v_z_81 .cse2) 4294967296))) (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_y_81 Int)) (let ((.cse60 (* v_y_81 4294967296))) (let ((.cse58 (+ (* v_z_81 3817748708) .cse43 .cse60)) (.cse59 (* v_z_81 3817748709))) (or (= .cse58 .cse2) (< (+ .cse59 .cse43 .cse60) 4294967296) (= .cse23 .cse58) (< 4294967295 (+ .cse59 .cse60)))))))) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< (+ v_z_80 .cse2) 4294967296) (forall ((v_y_80 Int)) (let ((.cse62 (* v_y_80 4294967296))) (let ((.cse63 (* v_z_80 3817748708)) (.cse61 (+ (* v_z_80 3817748709) .cse62))) (or (< 4294967295 .cse61) (= (+ .cse62 .cse43 4294967296 .cse63) .cse2) (= (+ .cse62 .cse43 .cse63) .cse2) (< .cse61 0))))))) (forall ((v_z_78 Int)) (or (< 4294967295 (+ v_z_78 .cse2)) (forall ((v_y_78 Int)) (let ((.cse65 (* v_z_78 3817748709)) (.cse64 (* v_y_78 4294967296))) (or (< (+ .cse64 .cse65) 0) (< 4294967295 (+ .cse64 .cse65 .cse43)) (= (+ .cse64 (* v_z_78 3817748708) .cse43) .cse2)))) (< v_z_78 0)))) .cse66) (or (and (or (and (forall ((v_z_82 Int)) (let ((.cse67 (+ v_z_82 .cse2))) (or (= .cse67 (+ (mod (+ .cse68 c_~p2~0 (* v_z_82 1272582904)) 4294967296) 4294967296)) (< .cse67 4294967296) (< 4294967295 v_z_82)))) (forall ((v_z_82 Int)) (let ((.cse69 (+ v_z_82 .cse2))) (or (< 4294967295 .cse69) (= (mod (+ .cse68 c_~p2~0 (* v_z_82 1272582904)) 4294967296) .cse69) (< v_z_82 0)))) (forall ((v_z_82 Int)) (let ((.cse71 (mod (+ .cse68 c_~p2~0 (* v_z_82 1272582904)) 4294967296)) (.cse70 (+ v_z_82 .cse2))) (or (= .cse70 (+ .cse71 4294967296)) (< 4294967295 v_z_82) (= .cse71 .cse70) (< v_z_82 0))))) .cse72) (or .cse73 (and (or (and (or (and (forall ((v_z_97 Int)) (or (< v_z_97 0) (forall ((v_y_97 Int)) (let ((.cse76 (* v_z_97 2227020081)) (.cse75 (* v_y_97 4294967296))) (or (= (+ .cse74 (* v_z_97 2227020080) .cse75) .cse23) (< 4294967295 (+ .cse76 .cse75)) (< (+ .cse74 .cse76 .cse75) 4294967296)))) (< 4294967295 (+ v_z_97 .cse2)))) (forall ((v_z_94 Int)) (or (< v_z_94 0) (forall ((v_y_94 Int)) (let ((.cse77 (* v_z_94 2227020080)) (.cse79 (* v_z_94 2227020081)) (.cse78 (* v_y_94 4294967296))) (or (= (+ .cse74 .cse77 .cse78) .cse2) (< 4294967295 (+ .cse74 .cse79 .cse78)) (= (+ .cse74 .cse77 4294967296 .cse78) .cse2) (< (+ .cse79 .cse78) 0)))) (< 4294967295 v_z_94))) (forall ((v_z_94 Int)) (or (< (+ v_z_94 .cse2) 4294967296) (forall ((v_y_94 Int)) (let ((.cse80 (* v_z_94 2227020081)) (.cse81 (* v_y_94 4294967296))) (or (< 4294967295 (+ .cse74 .cse80 .cse81)) (= (+ .cse74 (* v_z_94 2227020080) 4294967296 .cse81) .cse2) (< (+ .cse80 .cse81) 0)))) (< 4294967295 v_z_94))) (forall ((v_z_97 Int)) (or (< 4294967295 v_z_97) (< (+ v_z_97 .cse2) 4294967296) (forall ((v_y_97 Int)) (let ((.cse83 (* v_z_97 2227020081)) (.cse82 (* v_y_97 4294967296))) (or (= (+ .cse74 (* v_z_97 2227020080) .cse82) .cse2) (< 4294967295 (+ .cse83 .cse82)) (< (+ .cse74 .cse83 .cse82) 4294967296)))))) (forall ((v_z_95 Int)) (or (< (+ v_z_95 .cse2) 4294967296) (forall ((v_y_95 Int)) (let ((.cse84 (* v_y_95 4294967296))) (let ((.cse85 (* v_z_95 2227020080)) (.cse86 (+ (* v_z_95 2227020081) .cse84))) (or (= (+ .cse74 .cse84 4294967296 .cse85) .cse2) (= (+ .cse74 .cse84 .cse85) .cse2) (< .cse86 0) (< 4294967295 .cse86))))) (< 4294967295 v_z_95))) (forall ((v_z_94 Int)) (or (< v_z_94 0) (forall ((v_y_94 Int)) (let ((.cse88 (* v_z_94 2227020081)) (.cse87 (* v_y_94 4294967296))) (or (= (+ .cse74 (* v_z_94 2227020080) .cse87) .cse2) (< 4294967295 (+ .cse74 .cse88 .cse87)) (< (+ .cse88 .cse87) 0)))) (< 4294967295 (+ v_z_94 .cse2)))) (forall ((v_z_95 Int)) (or (< 4294967295 (+ v_z_95 .cse2)) (< v_z_95 0) (forall ((v_y_95 Int)) (let ((.cse91 (* v_y_95 4294967296))) (let ((.cse89 (+ .cse74 .cse91 (* v_z_95 2227020080))) (.cse90 (+ (* v_z_95 2227020081) .cse91))) (or (= .cse89 .cse2) (= .cse23 .cse89) (< .cse90 0) (< 4294967295 .cse90))))))) (forall ((v_z_97 Int)) (or (< 4294967295 v_z_97) (< v_z_97 0) (forall ((v_y_97 Int)) (let ((.cse94 (* v_y_97 4294967296))) (let ((.cse92 (+ .cse74 (* v_z_97 2227020080) .cse94)) (.cse93 (* v_z_97 2227020081))) (or (= .cse92 .cse2) (= .cse92 .cse23) (< 4294967295 (+ .cse93 .cse94)) (< (+ .cse74 .cse93 .cse94) 4294967296))))))) (forall ((v_z_95 Int)) (or (forall ((v_y_95 Int)) (let ((.cse95 (* v_y_95 4294967296)) (.cse96 (* v_z_95 2227020080))) (let ((.cse97 (+ .cse74 .cse95 .cse96)) (.cse98 (+ (* v_z_95 2227020081) .cse95))) (or (= (+ .cse74 .cse95 4294967296 .cse96) .cse2) (= .cse97 .cse2) (= .cse23 .cse97) (< .cse98 0) (< 4294967295 .cse98))))) (< 4294967295 v_z_95) (< v_z_95 0)))) .cse99) (or (and (forall ((v_z_98 Int)) (let ((.cse100 (+ v_z_98 .cse2))) (or (< v_z_98 0) (= .cse100 (mod (+ (* v_z_98 3976821572) .cse101 c_~p2~0) 4294967296)) (< 4294967295 .cse100)))) (forall ((v_z_98 Int)) (let ((.cse102 (+ v_z_98 .cse2)) (.cse103 (mod (+ (* v_z_98 3976821572) .cse101 c_~p2~0) 4294967296))) (or (< v_z_98 0) (< 4294967295 v_z_98) (= .cse102 .cse103) (= .cse102 (+ 4294967296 .cse103))))) (forall ((v_z_98 Int)) (let ((.cse104 (+ v_z_98 .cse2))) (or (< 4294967295 v_z_98) (= .cse104 (+ 4294967296 (mod (+ (* v_z_98 3976821572) .cse101 c_~p2~0) 4294967296))) (< .cse104 4294967296))))) .cse105)) .cse106) (or .cse107 (and (or (and (forall ((v_z_83 Int)) (let ((.cse109 (+ v_z_83 .cse2))) (or (< 4294967295 v_z_83) (= (+ (mod (+ (* 477218590 v_z_83) .cse108 c_~p2~0) 4294967296) 4294967296) .cse109) (< .cse109 4294967296)))) (forall ((v_z_83 Int)) (let ((.cse110 (+ v_z_83 .cse2))) (or (< 4294967295 .cse110) (< v_z_83 0) (= .cse110 (mod (+ (* 477218590 v_z_83) .cse108 c_~p2~0) 4294967296))))) (forall ((v_z_83 Int)) (let ((.cse112 (+ v_z_83 .cse2)) (.cse111 (mod (+ (* 477218590 v_z_83) .cse108 c_~p2~0) 4294967296))) (or (< 4294967295 v_z_83) (= (+ .cse111 4294967296) .cse112) (< v_z_83 0) (= .cse112 .cse111))))) .cse113) (or (and (forall ((v_z_86 Int)) (or (< (+ v_z_86 .cse2) 4294967296) (forall ((v_y_86 Int)) (let ((.cse114 (* v_y_86 4294967296)) (.cse115 (* 3022384395 v_z_86))) (or (< 4294967295 (+ .cse114 .cse115)) (= (+ .cse116 .cse114 (* v_z_86 3022384394)) .cse2) (< (+ .cse116 .cse114 .cse115) 4294967296)))) (< 4294967295 v_z_86))) (forall ((v_z_90 Int)) (or (< 4294967295 v_z_90) (< (+ v_z_90 .cse2) 4294967296) (forall ((v_y_90 Int)) (let ((.cse118 (* 3022384395 v_z_90)) (.cse117 (* v_y_90 4294967296))) (or (= (+ (* v_z_90 3022384394) .cse116 .cse117 4294967296) .cse2) (< (+ .cse118 .cse117) 0) (< 4294967295 (+ .cse116 .cse118 .cse117))))))) (forall ((v_z_89 Int)) (or (< (+ v_z_89 .cse2) 4294967296) (< 4294967295 v_z_89) (forall ((v_y_89 Int)) (let ((.cse121 (* v_y_89 4294967296))) (let ((.cse120 (* v_z_89 3022384394)) (.cse119 (+ (* 3022384395 v_z_89) .cse121))) (or (< 4294967295 .cse119) (= (+ .cse116 .cse120 4294967296 .cse121) .cse2) (= (+ .cse116 .cse120 .cse121) .cse2) (< .cse119 0))))))) (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 (+ v_z_90 .cse2)) (forall ((v_y_90 Int)) (let ((.cse123 (* 3022384395 v_z_90)) (.cse122 (* v_y_90 4294967296))) (or (= (+ (* v_z_90 3022384394) .cse116 .cse122) .cse2) (< (+ .cse123 .cse122) 0) (< 4294967295 (+ .cse116 .cse123 .cse122))))))) (forall ((v_z_86 Int)) (or (< v_z_86 0) (< 4294967295 (+ v_z_86 .cse2)) (forall ((v_y_86 Int)) (let ((.cse124 (* v_y_86 4294967296)) (.cse125 (* 3022384395 v_z_86))) (or (< 4294967295 (+ .cse124 .cse125)) (= (+ .cse116 .cse124 (* v_z_86 3022384394)) .cse23) (< (+ .cse116 .cse124 .cse125) 4294967296)))))) (forall ((v_z_89 Int)) (or (forall ((v_y_89 Int)) (let ((.cse128 (* v_y_89 4294967296))) (let ((.cse126 (+ .cse116 (* v_z_89 3022384394) .cse128)) (.cse127 (+ (* 3022384395 v_z_89) .cse128))) (or (= .cse126 .cse23) (< 4294967295 .cse127) (= .cse126 .cse2) (< .cse127 0))))) (< v_z_89 0) (< 4294967295 (+ v_z_89 .cse2)))) (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (forall ((v_y_89 Int)) (let ((.cse131 (* v_z_89 3022384394)) (.cse132 (* v_y_89 4294967296))) (let ((.cse129 (+ .cse116 .cse131 .cse132)) (.cse130 (+ (* 3022384395 v_z_89) .cse132))) (or (= .cse129 .cse23) (< 4294967295 .cse130) (= (+ .cse116 .cse131 4294967296 .cse132) .cse2) (= .cse129 .cse2) (< .cse130 0))))) (< v_z_89 0))) (forall ((v_z_86 Int)) (or (forall ((v_y_86 Int)) (let ((.cse133 (* v_y_86 4294967296))) (let ((.cse135 (+ .cse116 .cse133 (* v_z_86 3022384394))) (.cse134 (* 3022384395 v_z_86))) (or (< 4294967295 (+ .cse133 .cse134)) (= .cse135 .cse23) (= .cse135 .cse2) (< (+ .cse116 .cse133 .cse134) 4294967296))))) (< v_z_86 0) (< 4294967295 v_z_86))) (forall ((v_z_90 Int)) (or (< v_z_90 0) (forall ((v_y_90 Int)) (let ((.cse136 (* v_z_90 3022384394)) (.cse138 (* 3022384395 v_z_90)) (.cse137 (* v_y_90 4294967296))) (or (= (+ .cse136 .cse116 .cse137) .cse2) (= (+ .cse136 .cse116 .cse137 4294967296) .cse2) (< (+ .cse138 .cse137) 0) (< 4294967295 (+ .cse116 .cse138 .cse137))))) (< 4294967295 v_z_90)))) .cse139)))))) .cse140)) .cse141))) .cse142)))) (or (let ((.cse143 (* (mod (* 1073741817 c_~p1~0) 1073741824) 4))) (and (or .cse142 (let ((.cse152 (+ .cse143 4294967296))) (and (or .cse7 (and (or .cse14 (and (forall ((v_z_128 Int)) (or (forall ((v_y_128 Int)) (let ((.cse144 (* v_y_128 4294967296))) (let ((.cse146 (+ (* 2073432489 v_z_128) .cse144)) (.cse145 (* v_z_128 2073432488))) (or (= .cse143 (+ .cse144 .cse145 .cse17)) (< .cse146 0) (< 4294967295 .cse146) (= .cse143 (+ .cse144 .cse145 4294967296 .cse17)))))) (< 4294967295 v_z_128) (< (+ .cse143 v_z_128) 4294967296))) (forall ((v_z_130 Int)) (or (< v_z_130 0) (< 4294967295 v_z_130) (forall ((v_y_130 Int)) (let ((.cse147 (* 2073432489 v_z_130)) (.cse149 (* v_z_130 2073432488)) (.cse148 (* v_y_130 4294967296))) (or (< (+ .cse147 .cse148) 0) (< 4294967295 (+ .cse147 .cse148 .cse17)) (= .cse143 (+ .cse149 .cse148 4294967296 .cse17)) (= .cse143 (+ .cse149 .cse148 .cse17))))))) (forall ((v_z_127 Int)) (or (< 4294967295 (+ .cse143 v_z_127)) (< v_z_127 0) (forall ((v_y_127 Int)) (let ((.cse151 (* 2073432489 v_z_127)) (.cse150 (* v_y_127 4294967296))) (or (< 4294967295 (+ .cse150 .cse151)) (< (+ .cse150 .cse151 .cse17) 4294967296) (= .cse152 (+ .cse150 (* v_z_127 2073432488) .cse17))))))) (forall ((v_z_130 Int)) (or (forall ((v_y_130 Int)) (let ((.cse153 (* 2073432489 v_z_130)) (.cse154 (* v_y_130 4294967296))) (or (< (+ .cse153 .cse154) 0) (< 4294967295 (+ .cse153 .cse154 .cse17)) (= .cse143 (+ (* v_z_130 2073432488) .cse154 4294967296 .cse17))))) (< (+ .cse143 v_z_130) 4294967296) (< 4294967295 v_z_130))) (forall ((v_z_128 Int)) (or (< v_z_128 0) (< 4294967295 v_z_128) (forall ((v_y_128 Int)) (let ((.cse157 (* v_y_128 4294967296)) (.cse158 (* v_z_128 2073432488))) (let ((.cse155 (+ .cse157 .cse158 .cse17)) (.cse156 (+ (* 2073432489 v_z_128) .cse157))) (or (= .cse143 .cse155) (< .cse156 0) (= .cse152 .cse155) (< 4294967295 .cse156) (= .cse143 (+ .cse157 .cse158 4294967296 .cse17)))))))) (forall ((v_z_130 Int)) (or (forall ((v_y_130 Int)) (let ((.cse159 (* 2073432489 v_z_130)) (.cse160 (* v_y_130 4294967296))) (or (< (+ .cse159 .cse160) 0) (< 4294967295 (+ .cse159 .cse160 .cse17)) (= .cse143 (+ (* v_z_130 2073432488) .cse160 .cse17))))) (< v_z_130 0) (< 4294967295 (+ .cse143 v_z_130)))) (forall ((v_z_127 Int)) (or (forall ((v_y_127 Int)) (let ((.cse161 (* v_y_127 4294967296))) (let ((.cse162 (* 2073432489 v_z_127)) (.cse163 (+ .cse161 (* v_z_127 2073432488) .cse17))) (or (< 4294967295 (+ .cse161 .cse162)) (< (+ .cse161 .cse162 .cse17) 4294967296) (= .cse143 .cse163) (= .cse152 .cse163))))) (< v_z_127 0) (< 4294967295 v_z_127))) (forall ((v_z_128 Int)) (or (< v_z_128 0) (forall ((v_y_128 Int)) (let ((.cse166 (* v_y_128 4294967296))) (let ((.cse164 (+ .cse166 (* v_z_128 2073432488) .cse17)) (.cse165 (+ (* 2073432489 v_z_128) .cse166))) (or (= .cse143 .cse164) (< .cse165 0) (= .cse152 .cse164) (< 4294967295 .cse165))))) (< 4294967295 (+ .cse143 v_z_128)))) (forall ((v_z_127 Int)) (or (< (+ .cse143 v_z_127) 4294967296) (< 4294967295 v_z_127) (forall ((v_y_127 Int)) (let ((.cse168 (* 2073432489 v_z_127)) (.cse167 (* v_y_127 4294967296))) (or (< 4294967295 (+ .cse167 .cse168)) (< (+ .cse167 .cse168 .cse17) 4294967296) (= .cse143 (+ .cse167 (* v_z_127 2073432488) .cse17))))))))) (or .cse13 (and (forall ((v_z_123 Int)) (let ((.cse169 (+ .cse143 v_z_123))) (or (= .cse169 (mod (+ (* 3406353374 v_z_123) .cse9 c_~p2~0) 4294967296)) (< 4294967295 .cse169) (< v_z_123 0)))) (forall ((v_z_123 Int)) (let ((.cse171 (mod (+ (* 3406353374 v_z_123) .cse9 c_~p2~0) 4294967296)) (.cse170 (+ .cse143 v_z_123))) (or (= .cse170 .cse171) (= (+ 4294967296 .cse171) .cse170) (< 4294967295 v_z_123) (< v_z_123 0)))) (forall ((v_z_123 Int)) (let ((.cse172 (+ .cse143 v_z_123))) (or (= (+ 4294967296 (mod (+ (* 3406353374 v_z_123) .cse9 c_~p2~0) 4294967296)) .cse172) (< .cse172 4294967296) (< 4294967295 v_z_123)))))))) (or (and (or (and (forall ((v_z_121 Int)) (or (forall ((v_y_121 Int)) (let ((.cse175 (* v_y_121 4294967296))) (let ((.cse173 (+ .cse175 (* v_z_121 444306962) .cse43)) (.cse174 (+ .cse175 (* 444306963 v_z_121)))) (or (= .cse173 .cse152) (< .cse174 0) (= .cse173 .cse143) (< 4294967295 .cse174))))) (< 4294967295 (+ .cse143 v_z_121)) (< v_z_121 0))) (forall ((v_z_121 Int)) (or (< 4294967295 v_z_121) (< v_z_121 0) (forall ((v_y_121 Int)) (let ((.cse177 (* 444306963 v_z_121)) (.cse176 (* v_y_121 4294967296)) (.cse178 (* v_z_121 444306962))) (or (< (+ .cse176 .cse177) 0) (< 4294967295 (+ .cse176 .cse177 .cse43)) (= (+ .cse176 .cse178 .cse43) .cse143) (= .cse143 (+ .cse176 .cse178 .cse43 4294967296))))))) (forall ((v_z_122 Int)) (or (< 4294967295 (+ .cse143 v_z_122)) (< v_z_122 0) (forall ((v_y_122 Int)) (let ((.cse179 (* 444306963 v_z_122)) (.cse180 (* v_y_122 4294967296))) (or (< (+ .cse179 .cse180 .cse43) 4294967296) (< 4294967295 (+ .cse179 .cse180)) (= (+ (* v_z_122 444306962) .cse180 .cse43) .cse152)))))) (forall ((v_z_122 Int)) (or (< 4294967295 v_z_122) (< (+ .cse143 v_z_122) 4294967296) (forall ((v_y_122 Int)) (let ((.cse182 (* 444306963 v_z_122)) (.cse181 (* v_y_122 4294967296))) (or (= (+ (* v_z_122 444306962) .cse181 .cse43) .cse143) (< (+ .cse182 .cse181 .cse43) 4294967296) (< 4294967295 (+ .cse182 .cse181))))))) (forall ((v_z_121 Int)) (or (< 4294967295 (+ .cse143 v_z_121)) (forall ((v_y_121 Int)) (let ((.cse184 (* 444306963 v_z_121)) (.cse183 (* v_y_121 4294967296))) (or (< (+ .cse183 .cse184) 0) (< 4294967295 (+ .cse183 .cse184 .cse43)) (= (+ .cse183 (* v_z_121 444306962) .cse43) .cse143)))) (< v_z_121 0))) (forall ((v_z_121 Int)) (or (< 4294967295 v_z_121) (forall ((v_y_121 Int)) (let ((.cse186 (* v_y_121 4294967296))) (let ((.cse187 (* v_z_121 444306962)) (.cse185 (+ .cse186 (* 444306963 v_z_121)))) (or (< .cse185 0) (= (+ .cse186 .cse187 .cse43) .cse143) (= .cse143 (+ .cse186 .cse187 .cse43 4294967296)) (< 4294967295 .cse185))))) (< (+ .cse143 v_z_121) 4294967296))) (forall ((v_z_121 Int)) (or (< 4294967295 v_z_121) (< v_z_121 0) (forall ((v_y_121 Int)) (let ((.cse190 (* v_y_121 4294967296)) (.cse191 (* v_z_121 444306962))) (let ((.cse188 (+ .cse190 .cse191 .cse43)) (.cse189 (+ .cse190 (* 444306963 v_z_121)))) (or (= .cse188 .cse152) (< .cse189 0) (= .cse188 .cse143) (= .cse143 (+ .cse190 .cse191 .cse43 4294967296)) (< 4294967295 .cse189))))))) (forall ((v_z_121 Int)) (or (< 4294967295 v_z_121) (< (+ .cse143 v_z_121) 4294967296) (forall ((v_y_121 Int)) (let ((.cse193 (* 444306963 v_z_121)) (.cse192 (* v_y_121 4294967296))) (or (< (+ .cse192 .cse193) 0) (< 4294967295 (+ .cse192 .cse193 .cse43)) (= .cse143 (+ .cse192 (* v_z_121 444306962) .cse43 4294967296))))))) (forall ((v_z_122 Int)) (or (< 4294967295 v_z_122) (forall ((v_y_122 Int)) (let ((.cse196 (* v_y_122 4294967296))) (let ((.cse195 (* 444306963 v_z_122)) (.cse194 (+ (* v_z_122 444306962) .cse196 .cse43))) (or (= .cse194 .cse143) (< (+ .cse195 .cse196 .cse43) 4294967296) (< 4294967295 (+ .cse195 .cse196)) (= .cse194 .cse152))))) (< v_z_122 0)))) .cse66) (or (and (or .cse72 (and (forall ((v_z_118 Int)) (let ((.cse197 (+ .cse143 v_z_118)) (.cse198 (mod (+ .cse68 c_~p2~0 (* 1777227848 v_z_118)) 4294967296))) (or (= .cse197 .cse198) (= .cse197 (+ .cse198 4294967296)) (< v_z_118 0) (< 4294967295 v_z_118)))) (forall ((v_z_118 Int)) (let ((.cse199 (+ .cse143 v_z_118))) (or (= .cse199 (mod (+ .cse68 c_~p2~0 (* 1777227848 v_z_118)) 4294967296)) (< 4294967295 .cse199) (< v_z_118 0)))) (forall ((v_z_118 Int)) (let ((.cse200 (+ .cse143 v_z_118))) (or (= .cse200 (+ (mod (+ .cse68 c_~p2~0 (* 1777227848 v_z_118)) 4294967296) 4294967296)) (< .cse200 4294967296) (< 4294967295 v_z_118)))))) (or .cse73 (and (or .cse106 (and (or (and (forall ((v_z_110 Int)) (or (< 4294967295 (+ .cse143 v_z_110)) (forall ((v_y_110 Int)) (let ((.cse203 (* v_y_110 4294967296))) (let ((.cse202 (+ .cse203 (* 1481023207 v_z_110))) (.cse201 (+ .cse74 .cse203 (* v_z_110 1481023206)))) (or (= .cse201 .cse152) (< .cse202 0) (< 4294967295 .cse202) (= .cse143 .cse201))))) (< v_z_110 0))) (forall ((v_z_107 Int)) (or (< v_z_107 0) (forall ((v_y_107 Int)) (let ((.cse205 (* 1481023207 v_z_107)) (.cse204 (* v_y_107 4294967296))) (or (< (+ .cse204 .cse205) 0) (< 4294967295 (+ .cse204 .cse74 .cse205)) (= .cse143 (+ .cse204 .cse74 (* v_z_107 1481023206)))))) (< 4294967295 (+ .cse143 v_z_107)))) (forall ((v_z_110 Int)) (or (< 4294967295 v_z_110) (forall ((v_y_110 Int)) (let ((.cse207 (* v_y_110 4294967296))) (let ((.cse206 (+ .cse207 (* 1481023207 v_z_110))) (.cse208 (* v_z_110 1481023206))) (or (< .cse206 0) (< 4294967295 .cse206) (= (+ .cse74 .cse207 .cse208 4294967296) .cse143) (= .cse143 (+ .cse74 .cse207 .cse208)))))) (< (+ .cse143 v_z_110) 4294967296))) (forall ((v_z_110 Int)) (or (forall ((v_y_110 Int)) (let ((.cse212 (* v_z_110 1481023206)) (.cse211 (* v_y_110 4294967296))) (let ((.cse210 (+ .cse211 (* 1481023207 v_z_110))) (.cse209 (+ .cse74 .cse211 .cse212))) (or (= .cse209 .cse152) (< .cse210 0) (< 4294967295 .cse210) (= (+ .cse74 .cse211 .cse212 4294967296) .cse143) (= .cse143 .cse209))))) (< 4294967295 v_z_110) (< v_z_110 0))) (forall ((v_z_107 Int)) (or (< 4294967295 v_z_107) (forall ((v_y_107 Int)) (let ((.cse214 (* 1481023207 v_z_107)) (.cse213 (* v_y_107 4294967296)) (.cse215 (* v_z_107 1481023206))) (or (< (+ .cse213 .cse214) 0) (= .cse143 (+ .cse213 .cse74 .cse215 4294967296)) (< 4294967295 (+ .cse213 .cse74 .cse214)) (= .cse143 (+ .cse213 .cse74 .cse215))))) (< v_z_107 0))) (forall ((v_z_111 Int)) (or (< (+ .cse143 v_z_111) 4294967296) (< 4294967295 v_z_111) (forall ((v_y_111 Int)) (let ((.cse217 (* 1481023207 v_z_111)) (.cse216 (* v_y_111 4294967296))) (or (= .cse143 (+ .cse74 .cse216 (* v_z_111 1481023206))) (< 4294967295 (+ .cse217 .cse216)) (< (+ .cse74 .cse217 .cse216) 4294967296)))))) (forall ((v_z_111 Int)) (or (forall ((v_y_111 Int)) (let ((.cse218 (* 1481023207 v_z_111)) (.cse219 (* v_y_111 4294967296))) (or (< 4294967295 (+ .cse218 .cse219)) (< (+ .cse74 .cse218 .cse219) 4294967296) (= .cse152 (+ .cse74 .cse219 (* v_z_111 1481023206)))))) (< v_z_111 0) (< 4294967295 (+ .cse143 v_z_111)))) (forall ((v_z_107 Int)) (or (< 4294967295 v_z_107) (< (+ .cse143 v_z_107) 4294967296) (forall ((v_y_107 Int)) (let ((.cse220 (* v_y_107 4294967296)) (.cse221 (* 1481023207 v_z_107))) (or (< (+ .cse220 .cse221) 0) (= .cse143 (+ .cse220 .cse74 (* v_z_107 1481023206) 4294967296)) (< 4294967295 (+ .cse220 .cse74 .cse221))))))) (forall ((v_z_111 Int)) (or (forall ((v_y_111 Int)) (let ((.cse224 (* v_y_111 4294967296))) (let ((.cse223 (* 1481023207 v_z_111)) (.cse222 (+ .cse74 .cse224 (* v_z_111 1481023206)))) (or (= .cse143 .cse222) (< 4294967295 (+ .cse223 .cse224)) (< (+ .cse74 .cse223 .cse224) 4294967296) (= .cse152 .cse222))))) (< v_z_111 0) (< 4294967295 v_z_111)))) .cse99) (or (and (forall ((v_z_112 Int)) (let ((.cse225 (mod (+ (* v_z_112 2813944092) .cse101 c_~p2~0) 4294967296)) (.cse226 (+ .cse143 v_z_112))) (or (= .cse225 .cse226) (= (+ .cse225 4294967296) .cse226) (< 4294967295 v_z_112) (< v_z_112 0)))) (forall ((v_z_112 Int)) (let ((.cse227 (+ .cse143 v_z_112))) (or (< 4294967295 .cse227) (= (mod (+ (* v_z_112 2813944092) .cse101 c_~p2~0) 4294967296) .cse227) (< v_z_112 0)))) (forall ((v_z_112 Int)) (let ((.cse228 (+ .cse143 v_z_112))) (or (< .cse228 4294967296) (= (+ (mod (+ (* v_z_112 2813944092) .cse101 c_~p2~0) 4294967296) 4294967296) .cse228) (< 4294967295 v_z_112))))) .cse105))) (or (and (or .cse139 (and (forall ((v_z_116 Int)) (or (< 4294967295 (+ .cse143 v_z_116)) (< v_z_116 0) (forall ((v_y_116 Int)) (let ((.cse231 (* v_y_116 4294967296))) (let ((.cse229 (+ (* v_z_116 3110148732) .cse231 .cse116)) (.cse230 (+ (* v_z_116 3110148733) .cse231))) (or (= .cse229 .cse152) (< .cse230 0) (= .cse143 .cse229) (< 4294967295 .cse230))))))) (forall ((v_z_116 Int)) (or (forall ((v_y_116 Int)) (let ((.cse232 (* v_z_116 3110148733)) (.cse233 (* v_y_116 4294967296))) (or (< (+ .cse232 .cse233) 0) (= .cse143 (+ (* v_z_116 3110148732) .cse233 .cse116)) (< 4294967295 (+ .cse232 .cse233 .cse116))))) (< 4294967295 (+ .cse143 v_z_116)) (< v_z_116 0))) (forall ((v_z_116 Int)) (or (< 4294967295 v_z_116) (forall ((v_y_116 Int)) (let ((.cse234 (* v_z_116 3110148733)) (.cse235 (* v_y_116 4294967296))) (or (< (+ .cse234 .cse235) 0) (= .cse143 (+ (* v_z_116 3110148732) .cse235 .cse116 4294967296)) (< 4294967295 (+ .cse234 .cse235 .cse116))))) (< (+ .cse143 v_z_116) 4294967296))) (forall ((v_z_115 Int)) (or (< (+ .cse143 v_z_115) 4294967296) (forall ((v_y_115 Int)) (let ((.cse236 (* v_y_115 4294967296)) (.cse237 (* v_z_115 3110148733))) (or (< 4294967295 (+ .cse236 .cse237)) (= (+ .cse236 (* v_z_115 3110148732) .cse116) .cse143) (< (+ .cse236 .cse237 .cse116) 4294967296)))) (< 4294967295 v_z_115))) (forall ((v_z_116 Int)) (or (< 4294967295 v_z_116) (< (+ .cse143 v_z_116) 4294967296) (forall ((v_y_116 Int)) (let ((.cse240 (* v_y_116 4294967296))) (let ((.cse239 (* v_z_116 3110148732)) (.cse238 (+ (* v_z_116 3110148733) .cse240))) (or (< .cse238 0) (= .cse143 (+ .cse239 .cse240 .cse116 4294967296)) (= .cse143 (+ .cse239 .cse240 .cse116)) (< 4294967295 .cse238))))))) (forall ((v_z_116 Int)) (or (< 4294967295 v_z_116) (forall ((v_y_116 Int)) (let ((.cse243 (* v_z_116 3110148732)) (.cse244 (* v_y_116 4294967296))) (let ((.cse241 (+ .cse243 .cse244 .cse116)) (.cse242 (+ (* v_z_116 3110148733) .cse244))) (or (= .cse241 .cse152) (< .cse242 0) (= .cse143 (+ .cse243 .cse244 .cse116 4294967296)) (= .cse143 .cse241) (< 4294967295 .cse242))))) (< v_z_116 0))) (forall ((v_z_115 Int)) (or (< 4294967295 (+ .cse143 v_z_115)) (< v_z_115 0) (forall ((v_y_115 Int)) (let ((.cse245 (* v_y_115 4294967296)) (.cse246 (* v_z_115 3110148733))) (or (< 4294967295 (+ .cse245 .cse246)) (= (+ .cse245 (* v_z_115 3110148732) .cse116) .cse152) (< (+ .cse245 .cse246 .cse116) 4294967296)))))) (forall ((v_z_116 Int)) (or (< 4294967295 v_z_116) (forall ((v_y_116 Int)) (let ((.cse249 (* v_z_116 3110148732)) (.cse247 (* v_z_116 3110148733)) (.cse248 (* v_y_116 4294967296))) (or (< (+ .cse247 .cse248) 0) (= .cse143 (+ .cse249 .cse248 .cse116 4294967296)) (= .cse143 (+ .cse249 .cse248 .cse116)) (< 4294967295 (+ .cse247 .cse248 .cse116))))) (< v_z_116 0))) (forall ((v_z_115 Int)) (or (forall ((v_y_115 Int)) (let ((.cse250 (* v_y_115 4294967296))) (let ((.cse252 (+ .cse250 (* v_z_115 3110148732) .cse116)) (.cse251 (* v_z_115 3110148733))) (or (< 4294967295 (+ .cse250 .cse251)) (= .cse252 .cse143) (= .cse252 .cse152) (< (+ .cse250 .cse251 .cse116) 4294967296))))) (< 4294967295 v_z_115) (< v_z_115 0))))) (or .cse113 (and (forall ((v_z_117 Int)) (let ((.cse253 (+ .cse143 v_z_117)) (.cse254 (mod (+ (* v_z_117 148102322) .cse108 c_~p2~0) 4294967296))) (or (< 4294967295 v_z_117) (= .cse253 .cse254) (< v_z_117 0) (= .cse253 (+ .cse254 4294967296))))) (forall ((v_z_117 Int)) (let ((.cse255 (+ .cse143 v_z_117))) (or (< 4294967295 v_z_117) (= .cse255 (+ (mod (+ (* v_z_117 148102322) .cse108 c_~p2~0) 4294967296) 4294967296)) (< .cse255 4294967296)))) (forall ((v_z_117 Int)) (let ((.cse256 (+ .cse143 v_z_117))) (or (= .cse256 (mod (+ (* v_z_117 148102322) .cse108 c_~p2~0) 4294967296)) (< v_z_117 0) (< 4294967295 .cse256))))))) .cse107)))) .cse140)) .cse141)))) (or (and (forall ((v_z_131 Int)) (let ((.cse257 (+ .cse143 v_z_131)) (.cse258 (mod (+ .cse1 c_~p2~0 (* v_z_131 740511604)) 4294967296))) (or (< 4294967295 v_z_131) (< v_z_131 0) (= .cse257 .cse258) (= .cse257 (+ .cse258 4294967296))))) (forall ((v_z_131 Int)) (let ((.cse259 (+ .cse143 v_z_131))) (or (< 4294967295 .cse259) (< v_z_131 0) (= .cse259 (mod (+ .cse1 c_~p2~0 (* v_z_131 740511604)) 4294967296))))) (forall ((v_z_131 Int)) (let ((.cse260 (+ .cse143 v_z_131))) (or (< 4294967295 v_z_131) (< .cse260 4294967296) (= .cse260 (+ (mod (+ .cse1 c_~p2~0 (* v_z_131 740511604)) 4294967296) 4294967296)))))) .cse6))) (not (= 29 c_~n1~0))))) (= (mod c_thread1Thread1of1ForFork1_~cond~0 256) 0) (< c_~n2~0 36)) is different from false [2024-10-17 20:20:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 0 proven. 973 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-10-17 20:20:19,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286256531] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 20:20:19,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 20:20:19,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 42, 66] total 164 [2024-10-17 20:20:19,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225621028] [2024-10-17 20:20:19,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 20:20:19,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 165 states [2024-10-17 20:20:19,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:20:19,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2024-10-17 20:20:19,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4802, Invalid=21931, Unknown=3, NotChecked=324, Total=27060 [2024-10-17 20:20:19,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:20:19,775 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:20:19,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 165 states, 165 states have (on average 2.7696969696969695) internal successors, (457), 164 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:20:19,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:20:19,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:20:19,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 20:20:19,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:20:19,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-17 20:20:19,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 450 states. [2024-10-17 20:20:19,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-17 20:20:19,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:23:01,732 WARN L286 SmtUtils]: Spent 27.48s on a formula simplification. DAG size of input: 269 DAG size of output: 139 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 20:23:04,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15