./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 44c38e66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-44c38e6-m [2025-04-24 20:02:04,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 20:02:04,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 20:02:04,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 20:02:04,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 20:02:04,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 20:02:04,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 20:02:04,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 20:02:04,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 20:02:04,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 20:02:04,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 20:02:04,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 20:02:04,910 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 20:02:04,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 20:02:04,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 20:02:04,910 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 20:02:04,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 20:02:04,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 20:02:04,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 20:02:04,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 20:02:04,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 20:02:04,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 20:02:04,911 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 20:02:04,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 20:02:04,911 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 20:02:04,911 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 20:02:04,911 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 20:02:04,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 20:02:04,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 20:02:04,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 20:02:04,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:02:04,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 20:02:04,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 20:02:04,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 20:02:04,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 20:02:04,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:02:04,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 20:02:04,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 20:02:04,912 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 20:02:04,912 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 20:02:04,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 20:02:04,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 20:02:04,913 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 20:02:04,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 20:02:04,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 20:02:04,913 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 20:02:04,913 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 20:02:04,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-04-24 20:02:05,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 20:02:05,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 20:02:05,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 20:02:05,155 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 20:02:05,155 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 20:02:05,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-24 20:02:06,504 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1db23d3ed/f60e59e9cfdf4d42b03c8a9b8dd2357f/FLAG3c93732fb [2025-04-24 20:02:06,679 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 20:02:06,679 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-24 20:02:06,685 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1db23d3ed/f60e59e9cfdf4d42b03c8a9b8dd2357f/FLAG3c93732fb [2025-04-24 20:02:07,555 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1db23d3ed/f60e59e9cfdf4d42b03c8a9b8dd2357f [2025-04-24 20:02:07,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 20:02:07,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 20:02:07,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 20:02:07,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 20:02:07,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 20:02:07,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 08:02:07" (1/1) ... [2025-04-24 20:02:07,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1384cc40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07, skipping insertion in model container [2025-04-24 20:02:07,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 08:02:07" (1/1) ... [2025-04-24 20:02:07,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 20:02:07,733 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-24 20:02:07,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 20:02:07,747 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 20:02:07,778 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-24 20:02:07,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 20:02:07,794 INFO L204 MainTranslator]: Completed translation [2025-04-24 20:02:07,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07 WrapperNode [2025-04-24 20:02:07,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 20:02:07,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 20:02:07,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 20:02:07,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 20:02:07,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07" (1/1) ... [2025-04-24 20:02:07,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07" (1/1) ... [2025-04-24 20:02:07,833 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 247 [2025-04-24 20:02:07,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 20:02:07,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 20:02:07,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 20:02:07,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 20:02:07,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07" (1/1) ... [2025-04-24 20:02:07,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07" (1/1) ... [2025-04-24 20:02:07,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07" (1/1) ... [2025-04-24 20:02:07,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07" (1/1) ... [2025-04-24 20:02:07,861 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07" (1/1) ... [2025-04-24 20:02:07,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07" (1/1) ... [2025-04-24 20:02:07,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07" (1/1) ... [2025-04-24 20:02:07,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07" (1/1) ... [2025-04-24 20:02:07,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07" (1/1) ... [2025-04-24 20:02:07,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 20:02:07,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 20:02:07,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 20:02:07,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 20:02:07,887 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07" (1/1) ... [2025-04-24 20:02:07,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:02:07,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:02:07,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-24 20:02:07,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-24 20:02:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 20:02:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-24 20:02:07,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-24 20:02:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-24 20:02:07,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-24 20:02:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-24 20:02:07,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-24 20:02:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 20:02:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-24 20:02:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-24 20:02:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 20:02:07,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 20:02:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-24 20:02:07,946 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 20:02:08,040 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 20:02:08,042 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 20:02:08,433 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 20:02:08,433 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 20:02:08,738 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 20:02:08,739 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 20:02:08,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:02:08 BoogieIcfgContainer [2025-04-24 20:02:08,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 20:02:08,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 20:02:08,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 20:02:08,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 20:02:08,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 08:02:07" (1/3) ... [2025-04-24 20:02:08,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f861ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 08:02:08, skipping insertion in model container [2025-04-24 20:02:08,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:02:07" (2/3) ... [2025-04-24 20:02:08,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f861ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 08:02:08, skipping insertion in model container [2025-04-24 20:02:08,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:02:08" (3/3) ... [2025-04-24 20:02:08,747 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-04-24 20:02:08,760 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 20:02:08,762 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 26 locations, 28 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-24 20:02:08,762 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 20:02:08,814 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-24 20:02:08,851 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:02:08,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 20:02:08,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:02:08,853 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) [2025-04-24 20:02:08,855 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 [2025-04-24 20:02:08,927 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 20:02:08,941 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 20:02:08,946 INFO L340 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;@8010177, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:02:08,947 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-24 20:02:09,588 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:02:09,588 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:02:09,589 INFO L139 ounterexampleChecker]: Examining path program with hash 1194149698, occurence #1 [2025-04-24 20:02:09,589 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:02:09,589 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:02:09,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:02:09,593 INFO L85 PathProgramCache]: Analyzing trace with hash -101807487, now seen corresponding path program 1 times [2025-04-24 20:02:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:02:09,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321431979] [2025-04-24 20:02:09,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:02:09,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:02:09,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-24 20:02:09,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-24 20:02:09,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:02:09,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:02:10,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:02:10,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321431979] [2025-04-24 20:02:10,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321431979] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:02:10,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:02:10,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 20:02:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877342458] [2025-04-24 20:02:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:02:10,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 20:02:10,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:02:10,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 20:02:10,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 20:02:10,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:10,079 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:02:10,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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) [2025-04-24 20:02:10,080 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:10,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:10,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 20:02:10,352 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:02:10,352 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:02:10,352 INFO L139 ounterexampleChecker]: Examining path program with hash 1194149698, occurence #2 [2025-04-24 20:02:10,352 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:02:10,352 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:02:10,353 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:10,353 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 20:02:10,353 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:10,353 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 20:02:10,363 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:10,363 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:02:10,364 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:10,364 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:02:10,364 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:10,364 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-24 20:02:10,364 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:10,364 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-24 20:02:10,364 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:10,364 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-24 20:02:10,364 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:10,365 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:02:10,365 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:02:10,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:02:10,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1139583931, now seen corresponding path program 1 times [2025-04-24 20:02:10,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:02:10,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342964705] [2025-04-24 20:02:10,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:02:10,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:02:10,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-24 20:02:10,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-24 20:02:10,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:02:10,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:02:10,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:02:10,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342964705] [2025-04-24 20:02:10,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342964705] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:02:10,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:02:10,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 20:02:10,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23273684] [2025-04-24 20:02:10,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:02:10,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 20:02:10,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:02:10,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 20:02:10,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-24 20:02:10,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:10,553 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:02:10,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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) [2025-04-24 20:02:10,553 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:10,553 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:10,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:10,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:10,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-24 20:02:10,650 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:02:10,650 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:02:10,650 INFO L139 ounterexampleChecker]: Examining path program with hash 1194149698, occurence #3 [2025-04-24 20:02:10,650 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:02:10,650 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:02:10,650 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:10,650 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 20:02:10,650 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:10,650 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:02:10,651 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:10,651 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:02:10,651 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:10,651 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 20:02:10,651 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:10,651 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-24 20:02:10,651 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:10,651 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-24 20:02:10,651 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:10,651 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-24 20:02:10,651 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:10,651 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:02:10,651 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:02:10,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:02:10,651 INFO L85 PathProgramCache]: Analyzing trace with hash -419710619, now seen corresponding path program 1 times [2025-04-24 20:02:10,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:02:10,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932852534] [2025-04-24 20:02:10,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:02:10,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:02:10,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-24 20:02:10,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-24 20:02:10,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:02:10,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:02:10,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:02:10,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932852534] [2025-04-24 20:02:10,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932852534] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:10,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191570411] [2025-04-24 20:02:10,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:02:10,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:02:10,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:02:10,807 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) [2025-04-24 20:02:10,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-24 20:02:10,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-24 20:02:10,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-24 20:02:10,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:02:10,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:10,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 20:02:10,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:02:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:02:10,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:02:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:02:11,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191570411] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:11,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-24 20:02:11,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-24 20:02:11,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265767519] [2025-04-24 20:02:11,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:02:11,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 20:02:11,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:02:11,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 20:02:11,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-24 20:02:11,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:11,018 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:02:11,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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) [2025-04-24 20:02:11,018 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:11,018 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:11,018 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:11,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:11,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:11,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:11,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-24 20:02:11,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-24 20:02:11,615 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:02:11,615 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:02:11,615 INFO L139 ounterexampleChecker]: Examining path program with hash -933235391, occurence #1 [2025-04-24 20:02:11,615 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:02:11,615 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:02:11,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:02:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1978403039, now seen corresponding path program 1 times [2025-04-24 20:02:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:02:11,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925649322] [2025-04-24 20:02:11,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:02:11,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:02:11,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-24 20:02:11,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-24 20:02:11,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:02:11,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 20:02:11,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:02:11,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925649322] [2025-04-24 20:02:11,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925649322] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:11,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251961326] [2025-04-24 20:02:11,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:02:11,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:02:11,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:02:11,744 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) [2025-04-24 20:02:11,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-24 20:02:11,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-24 20:02:11,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-24 20:02:11,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:02:11,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:11,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 20:02:11,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:02:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 20:02:11,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:02:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 20:02:11,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251961326] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:11,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-24 20:02:11,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-24 20:02:11,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072945507] [2025-04-24 20:02:11,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:02:11,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 20:02:11,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:02:11,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 20:02:11,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-24 20:02:11,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:11,913 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:02:11,913 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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) [2025-04-24 20:02:11,913 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:11,913 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:11,913 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:11,914 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:12,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:12,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:12,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:12,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:12,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-24 20:02:12,616 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:02:12,617 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:02:12,617 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:02:12,617 INFO L139 ounterexampleChecker]: Examining path program with hash -131118396, occurence #1 [2025-04-24 20:02:12,617 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:02:12,617 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:02:12,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:02:12,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1275471846, now seen corresponding path program 1 times [2025-04-24 20:02:12,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:02:12,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535712352] [2025-04-24 20:02:12,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:02:12,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:02:12,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-24 20:02:12,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-24 20:02:12,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:02:12,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:12,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 20:02:12,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:02:12,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535712352] [2025-04-24 20:02:12,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535712352] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:12,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550886255] [2025-04-24 20:02:12,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:02:12,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:02:12,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:02:12,756 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) [2025-04-24 20:02:12,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-24 20:02:12,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-24 20:02:12,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-24 20:02:12,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:02:12,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:12,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 20:02:12,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:02:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 20:02:12,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:02:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 20:02:12,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550886255] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:12,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-24 20:02:12,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-24 20:02:12,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382316134] [2025-04-24 20:02:12,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:02:12,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 20:02:12,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:02:12,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 20:02:12,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-24 20:02:12,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:12,941 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:02:12,941 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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) [2025-04-24 20:02:12,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:12,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:12,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:12,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:12,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:13,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:13,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:13,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:13,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:13,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:13,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-24 20:02:13,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:02:13,779 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:02:13,779 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:02:13,779 INFO L139 ounterexampleChecker]: Examining path program with hash -1533294132, occurence #1 [2025-04-24 20:02:13,779 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:02:13,779 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:02:13,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:02:13,780 INFO L85 PathProgramCache]: Analyzing trace with hash -922807690, now seen corresponding path program 1 times [2025-04-24 20:02:13,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:02:13,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063751059] [2025-04-24 20:02:13,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:02:13,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:02:13,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-24 20:02:13,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-24 20:02:13,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:02:13,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:02:14,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:02:14,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063751059] [2025-04-24 20:02:14,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063751059] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:14,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850936877] [2025-04-24 20:02:14,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:02:14,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:02:14,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:02:14,916 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) [2025-04-24 20:02:14,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-24 20:02:14,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-24 20:02:14,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-24 20:02:14,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:02:14,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:14,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-24 20:02:14,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:02:15,205 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 20:02:15,206 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2025-04-24 20:02:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:02:15,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:02:43,354 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 20:02:43,354 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-04-24 20:02:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:02:43,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850936877] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:02:43,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:02:43,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 24 [2025-04-24 20:02:43,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95636049] [2025-04-24 20:02:43,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:02:43,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-24 20:02:43,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:02:43,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-24 20:02:43,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=480, Unknown=6, NotChecked=0, Total=600 [2025-04-24 20:02:43,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:43,726 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:02:43,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 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) [2025-04-24 20:02:43,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:43,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:43,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:43,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:43,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:43,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:44,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:44,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:44,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:44,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:44,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:44,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-24 20:02:44,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-24 20:02:44,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-24 20:02:44,914 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:02:44,914 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:02:44,914 INFO L139 ounterexampleChecker]: Examining path program with hash -1533294132, occurence #2 [2025-04-24 20:02:44,914 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:02:44,914 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:02:44,914 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:44,914 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 20:02:44,914 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:44,914 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:02:44,914 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:44,914 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:02:44,914 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:44,914 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 20:02:44,914 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:44,914 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-24 20:02:44,914 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:44,914 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-24 20:02:44,914 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:44,914 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-24 20:02:44,914 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:44,914 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:02:44,914 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:02:44,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:02:44,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1458381414, now seen corresponding path program 2 times [2025-04-24 20:02:44,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:02:44,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306733922] [2025-04-24 20:02:44,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 20:02:44,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:02:44,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-24 20:02:44,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 20:02:44,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 20:02:44,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:02:45,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:02:45,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306733922] [2025-04-24 20:02:45,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306733922] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:45,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684505328] [2025-04-24 20:02:45,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 20:02:45,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:02:45,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:02:45,050 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) [2025-04-24 20:02:45,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-24 20:02:45,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-24 20:02:45,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 20:02:45,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 20:02:45,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:45,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 20:02:45,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:02:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:02:45,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:02:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-24 20:02:45,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684505328] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:45,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-24 20:02:45,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 13 [2025-04-24 20:02:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666321218] [2025-04-24 20:02:45,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:02:45,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 20:02:45,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:02:45,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 20:02:45,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-04-24 20:02:45,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:45,247 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:02:45,248 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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) [2025-04-24 20:02:45,248 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:45,248 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:45,248 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:45,248 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:45,248 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:45,248 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-24 20:02:45,248 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:45,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:45,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:45,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:45,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:45,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:45,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-24 20:02:45,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:45,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-24 20:02:46,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:02:46,104 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:02:46,104 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:02:46,104 INFO L139 ounterexampleChecker]: Examining path program with hash 817181991, occurence #1 [2025-04-24 20:02:46,104 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:02:46,104 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:02:46,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:02:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2084796771, now seen corresponding path program 3 times [2025-04-24 20:02:46,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:02:46,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754809772] [2025-04-24 20:02:46,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 20:02:46,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:02:46,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-24 20:02:46,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 20:02:46,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-24 20:02:46,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 20:02:46,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:02:46,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754809772] [2025-04-24 20:02:46,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754809772] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:46,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640012955] [2025-04-24 20:02:46,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 20:02:46,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:02:46,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:02:46,265 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) [2025-04-24 20:02:46,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-24 20:02:46,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-24 20:02:46,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 20:02:46,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-24 20:02:46,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:46,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 20:02:46,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:02:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:02:46,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:02:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-24 20:02:46,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640012955] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:46,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-24 20:02:46,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7] total 14 [2025-04-24 20:02:46,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069063720] [2025-04-24 20:02:46,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:02:46,476 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 20:02:46,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:02:46,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 20:02:46,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-24 20:02:46,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:46,476 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:02:46,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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) [2025-04-24 20:02:46,476 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:46,476 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:46,476 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:46,476 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:46,476 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:46,476 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-24 20:02:46,476 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:46,476 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:47,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:47,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:47,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:47,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:47,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:47,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-24 20:02:47,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:47,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:47,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-24 20:02:47,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-24 20:02:47,330 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:02:47,330 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:02:47,331 INFO L139 ounterexampleChecker]: Examining path program with hash 1575774055, occurence #1 [2025-04-24 20:02:47,331 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:02:47,331 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:02:47,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:02:47,331 INFO L85 PathProgramCache]: Analyzing trace with hash -100311006, now seen corresponding path program 4 times [2025-04-24 20:02:47,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:02:47,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204322455] [2025-04-24 20:02:47,331 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 20:02:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:02:47,339 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-24 20:02:47,354 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 20:02:47,354 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 20:02:47,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-24 20:02:47,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:02:47,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204322455] [2025-04-24 20:02:47,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204322455] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:47,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343661992] [2025-04-24 20:02:47,442 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 20:02:47,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:02:47,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:02:47,444 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) [2025-04-24 20:02:47,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-24 20:02:47,512 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-24 20:02:47,545 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 20:02:47,545 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 20:02:47,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:47,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 20:02:47,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:02:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:02:47,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:02:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-24 20:02:47,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343661992] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:02:47,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:02:47,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2025-04-24 20:02:47,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764366767] [2025-04-24 20:02:47,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:02:47,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-24 20:02:47,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:02:47,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-24 20:02:47,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-24 20:02:47,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:47,656 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:02:47,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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) [2025-04-24 20:02:47,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:47,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:47,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:47,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:47,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:47,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-24 20:02:47,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:47,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:47,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:48,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:48,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:48,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:48,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:48,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:48,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-24 20:02:48,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:48,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:48,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 20:02:48,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-24 20:02:48,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:02:48,836 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:02:48,836 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:02:48,836 INFO L139 ounterexampleChecker]: Examining path program with hash -131118396, occurence #2 [2025-04-24 20:02:48,836 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:02:48,836 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:02:48,836 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:48,836 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 20:02:48,836 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:48,836 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:02:48,836 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:48,836 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:02:48,836 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:48,836 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 20:02:48,836 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:48,836 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-24 20:02:48,836 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:48,836 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-24 20:02:48,836 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:48,837 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:02:48,837 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:02:48,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:02:48,837 INFO L85 PathProgramCache]: Analyzing trace with hash -633217275, now seen corresponding path program 5 times [2025-04-24 20:02:48,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:02:48,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673522123] [2025-04-24 20:02:48,837 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-24 20:02:48,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:02:48,848 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-24 20:02:48,858 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 20:02:48,859 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 20:02:48,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 20:02:48,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:02:48,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673522123] [2025-04-24 20:02:48,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673522123] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:48,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789113019] [2025-04-24 20:02:48,971 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-24 20:02:48,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:02:48,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:02:48,973 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:02:48,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-24 20:02:49,040 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-24 20:02:49,078 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 20:02:49,079 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 20:02:49,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:49,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 20:02:49,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:02:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 20:02:49,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:02:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 20:02:49,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789113019] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:02:49,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:02:49,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-24 20:02:49,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824469324] [2025-04-24 20:02:49,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:02:49,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-24 20:02:49,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:02:49,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-24 20:02:49,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-24 20:02:49,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:49,243 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:02:49,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 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) [2025-04-24 20:02:49,243 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:49,243 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:49,243 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:49,243 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:49,243 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:49,243 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-24 20:02:49,243 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:49,243 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:49,243 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 20:02:49,243 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:49,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:49,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:49,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:49,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:49,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:49,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-24 20:02:49,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:49,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:49,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 20:02:49,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:02:49,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-24 20:02:49,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-24 20:02:49,573 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:02:49,573 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:02:49,574 INFO L139 ounterexampleChecker]: Examining path program with hash -131118396, occurence #3 [2025-04-24 20:02:49,574 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:02:49,574 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:02:49,574 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:49,574 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-24 20:02:49,574 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:49,574 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:02:49,574 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:49,574 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 20:02:49,574 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:49,574 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-24 20:02:49,574 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:49,574 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-24 20:02:49,574 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:49,574 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-04-24 20:02:49,574 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:49,574 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:02:49,574 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:02:49,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:02:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash 821773723, now seen corresponding path program 6 times [2025-04-24 20:02:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:02:49,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864646545] [2025-04-24 20:02:49,575 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-24 20:02:49,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:02:49,585 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-04-24 20:02:49,597 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-24 20:02:49,597 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-24 20:02:49,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 20:02:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:02:49,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864646545] [2025-04-24 20:02:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864646545] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:49,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394693064] [2025-04-24 20:02:49,717 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-24 20:02:49,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:02:49,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:02:49,720 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:02:49,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-24 20:02:49,784 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-04-24 20:02:49,819 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-24 20:02:49,819 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-24 20:02:49,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:49,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 20:02:49,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:02:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 20:02:49,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:02:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 20:02:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394693064] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:02:49,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:02:49,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-04-24 20:02:49,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882585262] [2025-04-24 20:02:49,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:02:49,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-24 20:02:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:02:49,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-24 20:02:49,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-04-24 20:02:49,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:49,942 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:02:49,942 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 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) [2025-04-24 20:02:49,942 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:49,942 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:49,942 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:49,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:49,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:49,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-24 20:02:49,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:49,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:49,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 20:02:49,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:02:49,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:02:50,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:02:50,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:50,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:50,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:50,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:02:50,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-24 20:02:50,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:50,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:02:50,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 20:02:50,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:02:50,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 20:02:50,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-24 20:02:50,954 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-24 20:02:50,955 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:02:50,955 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:02:50,955 INFO L139 ounterexampleChecker]: Examining path program with hash -1533294132, occurence #3 [2025-04-24 20:02:50,955 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:02:50,955 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:02:50,955 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:50,956 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-24 20:02:50,956 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:50,956 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:02:50,956 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:50,956 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 20:02:50,956 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:50,956 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-24 20:02:50,956 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:50,956 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-04-24 20:02:50,956 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:02:50,956 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2025-04-24 20:02:50,956 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:02:50,956 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:02:50,956 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:02:50,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:02:50,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2102547615, now seen corresponding path program 7 times [2025-04-24 20:02:50,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:02:50,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986178799] [2025-04-24 20:02:50,956 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-24 20:02:50,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:02:50,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-24 20:02:51,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-24 20:02:51,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:02:51,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 20:02:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:02:52,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986178799] [2025-04-24 20:02:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986178799] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:02:52,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227011853] [2025-04-24 20:02:52,200 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-24 20:02:52,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:02:52,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:02:52,202 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:02:52,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-24 20:02:52,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-24 20:02:52,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-24 20:02:52,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:02:52,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:02:52,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-24 20:02:52,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:02:52,586 INFO L325 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2025-04-24 20:02:52,586 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2025-04-24 20:02:52,920 INFO L325 Elim1Store]: treesize reduction 12, result has 88.6 percent of original size [2025-04-24 20:02:52,920 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 153 [2025-04-24 20:02:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-24 20:02:53,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:03:56,799 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-24 20:03:56,800 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-24 20:03:56,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-24 20:03:56,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-24 20:03:57,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:03:57,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-24 20:03:57,012 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:910) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:784) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:372) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:321) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:551) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:320) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2025-04-24 20:03:57,017 INFO L158 Benchmark]: Toolchain (without parser) took 109458.36ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 113.2MB in the beginning and 532.5MB in the end (delta: -419.3MB). Peak memory consumption was 355.7MB. Max. memory is 16.1GB. [2025-04-24 20:03:57,017 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 20:03:57,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.66ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 98.9MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-24 20:03:57,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.95ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 96.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 20:03:57,018 INFO L158 Benchmark]: Boogie Preprocessor took 46.08ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 94.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 20:03:57,018 INFO L158 Benchmark]: RCFGBuilder took 857.44ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 79.6MB in the end (delta: 14.9MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2025-04-24 20:03:57,018 INFO L158 Benchmark]: TraceAbstraction took 108273.34ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 79.6MB in the beginning and 532.5MB in the end (delta: -452.9MB). Peak memory consumption was 323.5MB. Max. memory is 16.1GB. [2025-04-24 20:03:57,019 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.66ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 98.9MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.95ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 96.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.08ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 94.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 857.44ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 79.6MB in the end (delta: 14.9MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. * TraceAbstraction took 108273.34ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 79.6MB in the beginning and 532.5MB in the end (delta: -452.9MB). Peak memory consumption was 323.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-44c38e6-m [2025-04-24 20:03:58,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 20:03:58,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2025-04-24 20:03:58,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 20:03:58,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 20:03:58,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 20:03:58,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 20:03:58,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 20:03:58,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 20:03:58,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 20:03:58,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 20:03:58,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 20:03:58,819 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 20:03:58,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 20:03:58,820 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 20:03:58,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:03:58,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:03:58,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * Refinement strategy for commutativity condition synthesis=FOX [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 20:03:58,821 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 20:03:58,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-04-24 20:03:59,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 20:03:59,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 20:03:59,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 20:03:59,075 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 20:03:59,075 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 20:03:59,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-24 20:04:00,414 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/433f13f21/4fe875a5fbf849de89135a34d0bae404/FLAG0b687ac65 [2025-04-24 20:04:00,609 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 20:04:00,609 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-24 20:04:00,616 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/433f13f21/4fe875a5fbf849de89135a34d0bae404/FLAG0b687ac65 [2025-04-24 20:04:01,464 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/433f13f21/4fe875a5fbf849de89135a34d0bae404 [2025-04-24 20:04:01,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 20:04:01,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 20:04:01,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 20:04:01,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 20:04:01,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 20:04:01,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 08:04:01" (1/1) ... [2025-04-24 20:04:01,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef6e194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01, skipping insertion in model container [2025-04-24 20:04:01,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 08:04:01" (1/1) ... [2025-04-24 20:04:01,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 20:04:01,657 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-24 20:04:01,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 20:04:01,675 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 20:04:01,699 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-24 20:04:01,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 20:04:01,716 INFO L204 MainTranslator]: Completed translation [2025-04-24 20:04:01,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01 WrapperNode [2025-04-24 20:04:01,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 20:04:01,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 20:04:01,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 20:04:01,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 20:04:01,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01" (1/1) ... [2025-04-24 20:04:01,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01" (1/1) ... [2025-04-24 20:04:01,762 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 238 [2025-04-24 20:04:01,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 20:04:01,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 20:04:01,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 20:04:01,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 20:04:01,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01" (1/1) ... [2025-04-24 20:04:01,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01" (1/1) ... [2025-04-24 20:04:01,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01" (1/1) ... [2025-04-24 20:04:01,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01" (1/1) ... [2025-04-24 20:04:01,795 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01" (1/1) ... [2025-04-24 20:04:01,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01" (1/1) ... [2025-04-24 20:04:01,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01" (1/1) ... [2025-04-24 20:04:01,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01" (1/1) ... [2025-04-24 20:04:01,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01" (1/1) ... [2025-04-24 20:04:01,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 20:04:01,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 20:04:01,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 20:04:01,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 20:04:01,823 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01" (1/1) ... [2025-04-24 20:04:01,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:04:01,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:04:01,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-24 20:04:01,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-24 20:04:01,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 20:04:01,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-04-24 20:04:01,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-04-24 20:04:01,880 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-24 20:04:01,880 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-24 20:04:01,880 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-24 20:04:01,880 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-24 20:04:01,880 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-24 20:04:01,880 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-24 20:04:01,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-24 20:04:01,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 20:04:01,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 20:04:01,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-04-24 20:04:01,882 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 20:04:01,961 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 20:04:01,963 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 20:04:02,376 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 20:04:02,377 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 20:04:02,668 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 20:04:02,668 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 20:04:02,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:04:02 BoogieIcfgContainer [2025-04-24 20:04:02,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 20:04:02,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 20:04:02,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 20:04:02,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 20:04:02,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 08:04:01" (1/3) ... [2025-04-24 20:04:02,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6278ba60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 08:04:02, skipping insertion in model container [2025-04-24 20:04:02,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:04:01" (2/3) ... [2025-04-24 20:04:02,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6278ba60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 08:04:02, skipping insertion in model container [2025-04-24 20:04:02,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:04:02" (3/3) ... [2025-04-24 20:04:02,678 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-04-24 20:04:02,697 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 20:04:02,698 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 26 locations, 28 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-24 20:04:02,699 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 20:04:02,739 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-24 20:04:02,765 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:04:02,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 20:04:02,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:04:02,767 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) [2025-04-24 20:04:02,774 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 [2025-04-24 20:04:02,847 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 20:04:02,858 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 20:04:02,863 INFO L340 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;@1dcc2df4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:04:02,864 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-24 20:04:06,199 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:04:06,199 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:04:06,200 INFO L139 ounterexampleChecker]: Examining path program with hash -2005642007, occurence #1 [2025-04-24 20:04:06,200 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:04:06,200 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:04:06,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:04:06,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1414399275, now seen corresponding path program 1 times [2025-04-24 20:04:06,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 20:04:06,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1041168620] [2025-04-24 20:04:06,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:04:06,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:06,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:04:06,242 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) [2025-04-24 20:04:06,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-24 20:04:06,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-24 20:04:06,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-24 20:04:06,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:04:06,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:04:06,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-24 20:04:06,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:04:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:04:06,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 20:04:06,480 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 20:04:06,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041168620] [2025-04-24 20:04:06,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041168620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:04:06,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:04:06,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 20:04:06,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653565011] [2025-04-24 20:04:06,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:04:06,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 20:04:06,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 20:04:06,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 20:04:06,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 20:04:06,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:06,502 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:04:06,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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) [2025-04-24 20:04:06,503 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:08,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:08,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-24 20:04:08,226 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:08,226 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:04:08,227 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:04:08,227 INFO L139 ounterexampleChecker]: Examining path program with hash -2005642007, occurence #2 [2025-04-24 20:04:08,227 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:04:08,227 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:04:08,227 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:04:08,227 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 20:04:08,227 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:04:08,227 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 20:04:08,238 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:04:08,238 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:04:08,238 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:04:08,238 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:04:08,238 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:04:08,239 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-24 20:04:08,239 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:04:08,239 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-24 20:04:08,239 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:04:08,239 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-24 20:04:08,239 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:04:08,239 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:04:08,239 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:04:08,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:04:08,240 INFO L85 PathProgramCache]: Analyzing trace with hash 897353279, now seen corresponding path program 1 times [2025-04-24 20:04:08,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 20:04:08,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1362910258] [2025-04-24 20:04:08,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:04:08,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:08,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:04:08,242 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) [2025-04-24 20:04:08,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-24 20:04:08,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-24 20:04:08,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-24 20:04:08,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:04:08,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:04:08,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 20:04:08,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:04:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:04:08,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 20:04:08,411 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 20:04:08,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362910258] [2025-04-24 20:04:08,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362910258] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:04:08,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:04:08,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 20:04:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049657063] [2025-04-24 20:04:08,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:04:08,412 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 20:04:08,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 20:04:08,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 20:04:08,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-24 20:04:08,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:08,413 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:04:08,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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) [2025-04-24 20:04:08,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:08,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:10,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:10,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:10,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-24 20:04:10,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:10,957 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:04:10,957 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:04:10,957 INFO L139 ounterexampleChecker]: Examining path program with hash 344834135, occurence #1 [2025-04-24 20:04:10,957 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:04:10,957 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:04:10,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:04:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1523768636, now seen corresponding path program 1 times [2025-04-24 20:04:10,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 20:04:10,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [599385758] [2025-04-24 20:04:10,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:04:10,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:10,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:04:10,960 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) [2025-04-24 20:04:10,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-24 20:04:11,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-24 20:04:11,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-24 20:04:11,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:04:11,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:04:11,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 20:04:11,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:04:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:04:11,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 20:04:11,145 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 20:04:11,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599385758] [2025-04-24 20:04:11,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599385758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:04:11,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:04:11,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 20:04:11,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853864143] [2025-04-24 20:04:11,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:04:11,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 20:04:11,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 20:04:11,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 20:04:11,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-24 20:04:11,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:11,146 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:04:11,146 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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) [2025-04-24 20:04:11,146 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:11,146 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:11,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:15,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:15,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:15,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:15,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-24 20:04:15,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:15,893 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:04:15,893 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:04:15,894 INFO L139 ounterexampleChecker]: Examining path program with hash -1204864242, occurence #1 [2025-04-24 20:04:15,894 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:04:15,894 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:04:15,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:04:15,894 INFO L85 PathProgramCache]: Analyzing trace with hash -661339141, now seen corresponding path program 1 times [2025-04-24 20:04:15,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 20:04:15,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1841511859] [2025-04-24 20:04:15,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:04:15,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:15,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:04:15,897 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) [2025-04-24 20:04:15,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-24 20:04:15,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-24 20:04:15,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-24 20:04:15,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:04:15,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:04:15,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 20:04:15,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:04:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:04:16,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 20:04:16,023 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 20:04:16,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841511859] [2025-04-24 20:04:16,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841511859] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:04:16,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:04:16,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 20:04:16,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036128440] [2025-04-24 20:04:16,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:04:16,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 20:04:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 20:04:16,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 20:04:16,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-24 20:04:16,024 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:16,024 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:04:16,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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) [2025-04-24 20:04:16,024 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:16,024 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:16,024 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:16,024 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:21,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:21,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:21,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:21,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:21,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-24 20:04:21,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:21,663 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:04:21,663 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:04:21,663 INFO L139 ounterexampleChecker]: Examining path program with hash 964057221, occurence #1 [2025-04-24 20:04:21,663 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:04:21,663 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:04:21,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:04:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash -845220294, now seen corresponding path program 1 times [2025-04-24 20:04:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 20:04:21,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [250922078] [2025-04-24 20:04:21,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:04:21,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:21,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:04:21,666 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) [2025-04-24 20:04:21,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-24 20:04:21,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-24 20:04:21,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-24 20:04:21,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:04:21,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:04:21,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 20:04:21,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:04:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:04:21,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 20:04:21,790 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 20:04:21,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250922078] [2025-04-24 20:04:21,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250922078] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:04:21,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:04:21,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 20:04:21,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067082691] [2025-04-24 20:04:21,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:04:21,790 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 20:04:21,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 20:04:21,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 20:04:21,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-24 20:04:21,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:21,791 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:04:21,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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) [2025-04-24 20:04:21,791 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:21,791 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:21,791 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:21,791 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:21,791 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:30,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:30,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:30,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:30,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:30,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:30,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-24 20:04:30,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:30,948 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:04:30,948 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:04:30,948 INFO L139 ounterexampleChecker]: Examining path program with hash -438118539, occurence #1 [2025-04-24 20:04:30,948 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:04:30,948 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:04:30,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:04:30,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2055212688, now seen corresponding path program 1 times [2025-04-24 20:04:30,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 20:04:30,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1327758462] [2025-04-24 20:04:30,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:04:30,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:30,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:04:30,951 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) [2025-04-24 20:04:30,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-24 20:04:30,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-24 20:04:31,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-24 20:04:31,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:04:31,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:04:31,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-24 20:04:31,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:04:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:04:31,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 20:04:31,090 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 20:04:31,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327758462] [2025-04-24 20:04:31,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327758462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:04:31,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:04:31,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 20:04:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826142746] [2025-04-24 20:04:31,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:04:31,091 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 20:04:31,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 20:04:31,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 20:04:31,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-24 20:04:31,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:31,091 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:04:31,091 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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) [2025-04-24 20:04:31,091 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:31,091 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:31,091 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:31,091 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:31,091 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:31,091 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:31,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:31,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:31,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:31,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:31,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:31,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:04:31,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-24 20:04:31,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:31,404 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:04:31,404 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:04:31,404 INFO L139 ounterexampleChecker]: Examining path program with hash -438118539, occurence #2 [2025-04-24 20:04:31,404 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:04:31,404 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:04:31,404 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:04:31,404 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 20:04:31,404 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:04:31,404 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:04:31,404 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:04:31,404 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:04:31,404 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:04:31,404 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 20:04:31,404 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:04:31,404 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-24 20:04:31,404 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:04:31,404 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-24 20:04:31,404 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:04:31,404 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:04:31,404 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:04:31,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:04:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash 564259304, now seen corresponding path program 1 times [2025-04-24 20:04:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 20:04:31,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305472427] [2025-04-24 20:04:31,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:04:31,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:31,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:04:31,411 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) [2025-04-24 20:04:31,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-24 20:04:31,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-24 20:04:31,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-24 20:04:31,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:04:31,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:04:31,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-24 20:04:31,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:04:31,948 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 20:04:31,949 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-24 20:04:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:04:31,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:04:32,262 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 20:04:32,262 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 103 [2025-04-24 20:04:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:04:33,497 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 20:04:33,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305472427] [2025-04-24 20:04:33,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305472427] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:04:33,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-24 20:04:33,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2025-04-24 20:04:33,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50627146] [2025-04-24 20:04:33,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-24 20:04:33,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-24 20:04:33,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 20:04:33,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-24 20:04:33,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-24 20:04:33,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:33,499 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:04:33,499 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 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) [2025-04-24 20:04:33,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:33,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:33,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:33,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:33,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:33,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:04:33,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:39,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:39,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:39,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:39,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:39,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:39,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:04:39,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 20:04:39,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-24 20:04:39,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:39,990 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:04:39,990 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:04:39,990 INFO L139 ounterexampleChecker]: Examining path program with hash -438118539, occurence #3 [2025-04-24 20:04:39,990 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:04:39,990 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:04:39,990 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:04:39,990 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 20:04:39,990 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:04:39,991 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:04:39,991 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:04:39,991 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:04:39,991 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:04:39,991 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 20:04:39,991 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:04:39,991 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-24 20:04:39,991 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:04:39,991 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-24 20:04:39,991 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:04:39,991 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-24 20:04:39,991 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:04:39,991 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:04:39,991 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:04:39,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:04:39,991 INFO L85 PathProgramCache]: Analyzing trace with hash 312817954, now seen corresponding path program 2 times [2025-04-24 20:04:39,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 20:04:39,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406814049] [2025-04-24 20:04:39,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 20:04:39,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:39,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:04:39,994 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:04:39,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-24 20:04:40,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-24 20:04:40,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 20:04:40,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 20:04:40,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:04:40,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-24 20:04:40,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:04:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:04:40,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:04:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:04:40,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 20:04:40,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406814049] [2025-04-24 20:04:40,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406814049] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:04:40,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-24 20:04:40,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-24 20:04:40,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503011900] [2025-04-24 20:04:40,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-24 20:04:40,327 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-24 20:04:40,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 20:04:40,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-24 20:04:40,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-24 20:04:40,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:40,327 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:04:40,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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) [2025-04-24 20:04:40,327 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:40,327 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:40,327 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:40,327 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:40,327 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:40,327 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:04:40,327 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 20:04:40,327 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:46,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:46,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:46,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:46,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:46,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:46,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:04:46,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 20:04:46,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-24 20:04:46,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-24 20:04:46,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:46,615 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:04:46,615 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:04:46,615 INFO L139 ounterexampleChecker]: Examining path program with hash 1912357603, occurence #1 [2025-04-24 20:04:46,615 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:04:46,615 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:04:46,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:04:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash 939233311, now seen corresponding path program 3 times [2025-04-24 20:04:46,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 20:04:46,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746976210] [2025-04-24 20:04:46,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 20:04:46,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:46,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:04:46,618 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:04:46,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-24 20:04:46,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-24 20:04:46,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 20:04:46,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-24 20:04:46,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:04:46,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-24 20:04:46,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:04:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:04:46,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:04:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:04:46,936 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 20:04:46,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746976210] [2025-04-24 20:04:46,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746976210] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:04:46,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-24 20:04:46,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-24 20:04:46,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280389548] [2025-04-24 20:04:46,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-24 20:04:46,937 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-24 20:04:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 20:04:46,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-24 20:04:46,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-24 20:04:46,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:46,938 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:04:46,938 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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) [2025-04-24 20:04:46,938 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:46,938 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:46,938 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:46,938 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:46,938 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:46,938 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:04:46,938 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 20:04:46,938 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-04-24 20:04:46,938 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:57,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:57,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:57,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:57,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:57,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:57,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:04:57,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 20:04:57,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:04:57,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:04:57,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-24 20:04:57,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:57,452 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:04:57,452 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:04:57,452 INFO L139 ounterexampleChecker]: Examining path program with hash 1304145205, occurence #1 [2025-04-24 20:04:57,452 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:04:57,452 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:04:57,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:04:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1245874466, now seen corresponding path program 4 times [2025-04-24 20:04:57,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 20:04:57,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1487601691] [2025-04-24 20:04:57,453 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 20:04:57,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:04:57,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:04:57,454 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:04:57,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-24 20:04:57,501 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-24 20:04:57,541 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 20:04:57,541 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 20:04:57,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:04:57,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-24 20:04:57,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:04:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:04:57,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:04:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:04:57,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 20:04:57,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487601691] [2025-04-24 20:04:57,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487601691] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:04:57,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-24 20:04:57,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-24 20:04:57,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602823488] [2025-04-24 20:04:57,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-24 20:04:57,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-24 20:04:57,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 20:04:57,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-24 20:04:57,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-24 20:04:57,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:04:57,744 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:04:57,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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) [2025-04-24 20:04:57,744 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:04:57,744 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:57,744 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:57,744 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:57,744 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:04:57,744 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:04:57,744 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 20:04:57,744 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:04:57,744 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:04:57,744 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:05:10,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:05:10,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:10,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:10,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:10,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:10,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:05:10,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 20:05:10,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:05:10,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 20:05:10,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 20:05:10,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-24 20:05:10,425 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:05:10,425 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:05:10,425 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:05:10,426 INFO L139 ounterexampleChecker]: Examining path program with hash 964057221, occurence #2 [2025-04-24 20:05:10,426 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:05:10,426 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:05:10,426 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:05:10,426 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 20:05:10,426 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:05:10,426 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:05:10,426 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:05:10,426 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:05:10,426 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:05:10,426 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 20:05:10,426 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:05:10,426 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-24 20:05:10,426 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:05:10,426 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-24 20:05:10,426 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:05:10,426 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:05:10,426 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:05:10,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:05:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1785946185, now seen corresponding path program 5 times [2025-04-24 20:05:10,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 20:05:10,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610713547] [2025-04-24 20:05:10,427 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-24 20:05:10,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:05:10,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:05:10,428 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:05:10,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-24 20:05:10,479 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-24 20:05:10,549 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 20:05:10,549 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 20:05:10,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:05:10,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-24 20:05:10,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:05:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 20:05:10,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:05:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 20:05:10,736 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 20:05:10,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610713547] [2025-04-24 20:05:10,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610713547] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:05:10,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-24 20:05:10,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-24 20:05:10,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362827569] [2025-04-24 20:05:10,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-24 20:05:10,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-24 20:05:10,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 20:05:10,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-24 20:05:10,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-24 20:05:10,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:05:10,737 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:05:10,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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) [2025-04-24 20:05:10,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:05:10,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:10,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:10,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:10,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:10,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:05:10,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 20:05:10,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:05:10,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-24 20:05:10,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-24 20:05:10,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:05:13,918 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:05:13,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:13,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:13,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:13,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:13,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:05:13,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 20:05:13,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:05:13,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 20:05:13,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 20:05:13,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:05:13,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-24 20:05:14,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:05:14,121 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:05:14,121 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:05:14,121 INFO L139 ounterexampleChecker]: Examining path program with hash 964057221, occurence #3 [2025-04-24 20:05:14,121 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:05:14,121 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:05:14,122 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:05:14,122 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-24 20:05:14,122 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:05:14,122 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:05:14,122 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:05:14,122 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 20:05:14,122 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:05:14,122 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-24 20:05:14,122 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:05:14,122 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-24 20:05:14,122 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:05:14,122 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-04-24 20:05:14,122 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:05:14,122 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:05:14,122 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:05:14,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:05:14,123 INFO L85 PathProgramCache]: Analyzing trace with hash -731946273, now seen corresponding path program 6 times [2025-04-24 20:05:14,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 20:05:14,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386075350] [2025-04-24 20:05:14,123 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-24 20:05:14,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:05:14,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:05:14,125 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:05:14,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-24 20:05:14,177 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-04-24 20:05:14,234 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-24 20:05:14,234 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-24 20:05:14,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:05:14,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-24 20:05:14,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:05:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-24 20:05:14,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:05:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-24 20:05:14,432 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 20:05:14,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386075350] [2025-04-24 20:05:14,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386075350] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:05:14,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-24 20:05:14,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-24 20:05:14,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31744153] [2025-04-24 20:05:14,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-24 20:05:14,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-24 20:05:14,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 20:05:14,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-24 20:05:14,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-24 20:05:14,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:05:14,433 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:05:14,433 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 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) [2025-04-24 20:05:14,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:05:14,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:14,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:14,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:14,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:14,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:05:14,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 20:05:14,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:05:14,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-24 20:05:14,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-24 20:05:14,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:05:14,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:05:27,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:05:27,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:27,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:27,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:27,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:05:27,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:05:27,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 20:05:27,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 20:05:27,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 20:05:27,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 20:05:27,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:05:27,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 20:05:27,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-24 20:05:28,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:05:28,175 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:05:28,175 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:05:28,175 INFO L139 ounterexampleChecker]: Examining path program with hash -438118539, occurence #4 [2025-04-24 20:05:28,175 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:05:28,175 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:05:28,175 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:05:28,176 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-24 20:05:28,176 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:05:28,176 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:05:28,176 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:05:28,176 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 20:05:28,176 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:05:28,176 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-24 20:05:28,176 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:05:28,176 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-04-24 20:05:28,176 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:05:28,176 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2025-04-24 20:05:28,176 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:05:28,176 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:05:28,176 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:05:28,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:05:28,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1271740043, now seen corresponding path program 7 times [2025-04-24 20:05:28,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 20:05:28,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104614648] [2025-04-24 20:05:28,176 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-24 20:05:28,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:05:28,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:05:28,180 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:05:28,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-24 20:05:28,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-24 20:06:49,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-24 20:06:49,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:06:49,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:06:49,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-24 20:06:49,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:06:50,319 INFO L325 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2025-04-24 20:06:50,319 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 76 [2025-04-24 20:06:53,556 INFO L325 Elim1Store]: treesize reduction 8, result has 87.7 percent of original size [2025-04-24 20:06:53,556 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 431 treesize of output 283 [2025-04-24 20:10:55,972 WARN L849 $PredicateComparison]: unable to prove that (and (let ((.cse6 (bvmul c_~csum~0 (_ bv4294967295 32))) (.cse7 (bvmul (_ bv4294967295 32) c_~bsum~0))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse3 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse4 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse3))) (.cse5 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse2 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse0 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse1 (bvadd .cse2 c_~bsum~0))) (and (bvsle .cse0 (_ bv0 32)) (bvsle .cse1 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse2 .cse3)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse0)))) (bvsge .cse4 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse1)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse4 (bvadd (bvneg ((_ sign_extend 32) .cse5)) (_ bv18446744071562067968 64))) (bvsle .cse5 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse11 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse8 ((_ sign_extend 32) .cse11)) (.cse9 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse8 (bvadd (bvneg ((_ sign_extend 32) .cse9)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse10 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse10 (_ bv0 32)) (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse10)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse11 (bvadd (_ bv2147483647 32) (bvneg .cse9))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse17 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse12 ((_ sign_extend 32) .cse17)) (.cse13 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse13)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse16 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse14 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse15 ((_ sign_extend 32) .cse16))) (and (bvsge .cse14 (_ bv0 32)) (bvsge .cse15 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse14 (_ bv0 32)) (bvsle .cse16 (_ bv0 32)) (bvsge .cse12 (bvadd (_ bv18446744071562067968 64) (bvneg .cse15))))))) (bvsle .cse17 (bvadd (_ bv2147483647 32) (bvneg .cse13))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse19 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse21 (bvadd .cse7 c_~csum~0 .cse19))) (let ((.cse22 ((_ sign_extend 32) .cse21)) (.cse23 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse18 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse20 (bvadd .cse18 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse18 .cse19) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse20 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse21 (bvadd (_ bv2147483647 32) (bvneg .cse20))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse22 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse20)))))))) (bvsge .cse22 (bvadd (bvneg ((_ sign_extend 32) .cse23)) (_ bv18446744071562067968 64))) (bvsle .cse21 (bvadd (_ bv2147483647 32) (bvneg .cse23)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse26 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse24 ((_ sign_extend 32) .cse26)) (.cse25 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse24 (bvadd (bvneg ((_ sign_extend 32) .cse25)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse27 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse26 (bvadd (_ bv2147483647 32) (bvneg .cse27))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse24 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse27)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse25 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse31 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse28 ((_ sign_extend 32) .cse31)) (.cse29 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse28 (bvadd (bvneg ((_ sign_extend 32) .cse29)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse30 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse30 (_ bv0 32)) (bvsge .cse28 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse30)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse31 (bvadd (_ bv2147483647 32) (bvneg .cse29))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse33 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse34 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse32 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse32 (_ bv0 32)) (bvsge .cse33 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse32)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsge .cse33 (bvadd (bvneg ((_ sign_extend 32) .cse34)) (_ bv18446744071562067968 64))) (bvsle .cse34 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse39 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse40 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse39))) (.cse41 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse38 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse35 (bvadd .cse38 c_~bsum~0))) (let ((.cse37 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse36 ((_ sign_extend 32) .cse35))) (and (bvsle .cse35 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse36 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse37 (_ bv0 32)) (bvsle .cse35 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse38 .cse39)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse37)))) (bvsge .cse40 (bvadd (_ bv18446744071562067968 64) (bvneg .cse36)))))))) (bvsge .cse40 (bvadd (bvneg ((_ sign_extend 32) .cse41)) (_ bv18446744071562067968 64))) (bvsle .cse41 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse48 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse45 (bvadd .cse7 c_~csum~0 .cse48))) (let ((.cse46 ((_ sign_extend 32) .cse45)) (.cse49 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse47 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse42 (bvadd c_~csum~0 .cse47 .cse48)) (.cse43 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse44 (bvadd .cse47 c_~bsum~0))) (and (bvsle .cse42 (bvadd (bvneg .cse43) (_ bv2147483647 32))) (bvsle .cse44 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse45 (bvadd (_ bv2147483647 32) (bvneg .cse44))) (bvsge ((_ sign_extend 32) .cse42) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse43)))) (bvsge .cse46 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse44)))))))) (bvsge .cse46 (bvadd (bvneg ((_ sign_extend 32) .cse49)) (_ bv18446744071562067968 64))) (bvsle .cse45 (bvadd (_ bv2147483647 32) (bvneg .cse49)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse57 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse58 (bvadd .cse7 c_~csum~0 .cse57))) (let ((.cse50 ((_ sign_extend 32) .cse58)) (.cse51 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse50 (bvadd (bvneg ((_ sign_extend 32) .cse51)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse56 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse54 (bvadd .cse56 c_~bsum~0))) (let ((.cse52 (bvadd c_~csum~0 .cse56 .cse57)) (.cse53 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse55 ((_ sign_extend 32) .cse54))) (and (bvsle .cse52 (bvadd (bvneg .cse53) (_ bv2147483647 32))) (bvsle .cse54 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse55 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse54 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse52) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse53)))) (bvsge .cse50 (bvadd (_ bv18446744071562067968 64) (bvneg .cse55)))))))) (bvsle .cse58 (bvadd (_ bv2147483647 32) (bvneg .cse51)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse62 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse60 ((_ sign_extend 32) .cse62)) (.cse61 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse59 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse59 (_ bv0 32)) (bvsge .cse60 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse59)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsge .cse60 (bvadd (bvneg ((_ sign_extend 32) .cse61)) (_ bv18446744071562067968 64))) (bvsle .cse62 (bvadd (_ bv2147483647 32) (bvneg .cse61))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse64 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse65 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse63 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse63 (_ bv0 32)) (bvsge .cse64 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse63))))))) (bvsge .cse64 (bvadd (bvneg ((_ sign_extend 32) .cse65)) (_ bv18446744071562067968 64))) (bvsle .cse65 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse67 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse72 (bvadd .cse7 c_~csum~0 .cse67))) (let ((.cse70 ((_ sign_extend 32) .cse72)) (.cse71 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse66 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse68 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse69 (bvadd .cse66 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse66 .cse67) (bvadd (bvneg .cse68) (_ bv2147483647 32))) (bvsge .cse68 (_ bv0 32)) (bvsle .cse69 (_ bv0 32)) (bvsge .cse70 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse69)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse70 (bvadd (bvneg ((_ sign_extend 32) .cse71)) (_ bv18446744071562067968 64))) (bvsle .cse72 (bvadd (_ bv2147483647 32) (bvneg .cse71)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse73 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse74 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse73 (bvadd (bvneg ((_ sign_extend 32) .cse74)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse75 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse76 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse75 (_ bv0 32)) (bvsle .cse75 (_ bv0 32)) (bvsle .cse76 (_ bv0 32)) (bvsge .cse73 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse76)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse74 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse81 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse82 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse81))) (.cse83 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse80 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse79 (bvadd .cse80 c_~bsum~0))) (let ((.cse78 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (.cse77 ((_ sign_extend 32) .cse79))) (and (bvsge .cse77 .cse78) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) .cse78) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse79 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse80 .cse81)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse82 (bvadd (_ bv18446744071562067968 64) (bvneg .cse77)))))))) (bvsge .cse82 (bvadd (bvneg ((_ sign_extend 32) .cse83)) (_ bv18446744071562067968 64))) (bvsle .cse83 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse87 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse91 (bvadd .cse7 c_~csum~0 .cse87))) (let ((.cse84 ((_ sign_extend 32) .cse91)) (.cse85 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse84 (bvadd (bvneg ((_ sign_extend 32) .cse85)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse86 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse90 (bvadd .cse86 c_~bsum~0))) (let ((.cse88 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse89 ((_ sign_extend 32) .cse90))) (and (bvsle (bvadd c_~csum~0 .cse86 .cse87) (bvadd (bvneg .cse88) (_ bv2147483647 32))) (bvsge .cse88 (_ bv0 32)) (bvsge .cse89 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse90 (_ bv0 32)) (bvsge .cse84 (bvadd (_ bv18446744071562067968 64) (bvneg .cse89)))))))) (bvsle .cse91 (bvadd (_ bv2147483647 32) (bvneg .cse85)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse93 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse95 ((_ sign_extend 32) .cse93)) (.cse96 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse92 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse94 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse92 (_ bv0 32)) (bvsle .cse93 (bvadd (_ bv2147483647 32) (bvneg .cse94))) (bvsle .cse92 (_ bv0 32)) (bvsge .cse95 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse94))))))) (bvsge .cse95 (bvadd (bvneg ((_ sign_extend 32) .cse96)) (_ bv18446744071562067968 64))) (bvsle .cse93 (bvadd (_ bv2147483647 32) (bvneg .cse96))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse99 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse98 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse97 ((_ sign_extend 32) .cse99))) (and (bvsge .cse97 (bvadd (bvneg ((_ sign_extend 32) .cse98)) (_ bv18446744071562067968 64))) (bvsle .cse99 (bvadd (_ bv2147483647 32) (bvneg .cse98))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse100 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse101 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse102 ((_ sign_extend 32) .cse100))) (and (bvsle .cse100 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse101 (_ bv0 32)) (bvsge .cse102 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse101 (_ bv0 32)) (bvsle .cse100 (_ bv0 32)) (bvsge .cse97 (bvadd (_ bv18446744071562067968 64) (bvneg .cse102))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse105 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse104 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse103 ((_ sign_extend 32) .cse105))) (and (bvsge .cse103 (bvadd (bvneg ((_ sign_extend 32) .cse104)) (_ bv18446744071562067968 64))) (bvsle .cse105 (bvadd (_ bv2147483647 32) (bvneg .cse104))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse106 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse107 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse106 (_ bv0 32)) (bvsle .cse106 (_ bv0 32)) (bvsle .cse107 (_ bv0 32)) (bvsge .cse103 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse107)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse110 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse111 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse108 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse109 ((_ sign_extend 32) .cse108))) (and (bvsle .cse108 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse109 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse108 (_ bv0 32)) (bvsge .cse110 (bvadd (_ bv18446744071562067968 64) (bvneg .cse109))))))) (bvsge .cse110 (bvadd (bvneg ((_ sign_extend 32) .cse111)) (_ bv18446744071562067968 64))) (bvsle .cse111 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse115 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse117 (bvadd .cse7 c_~csum~0 .cse115))) (let ((.cse112 ((_ sign_extend 32) .cse117)) (.cse113 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse112 (bvadd (bvneg ((_ sign_extend 32) .cse113)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse114 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse116 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse118 (bvadd .cse114 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse114 .cse115) (bvadd (bvneg .cse116) (_ bv2147483647 32))) (bvsge .cse116 (_ bv0 32)) (bvsle .cse117 (bvadd (_ bv2147483647 32) (bvneg .cse118))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse112 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse118)))))))) (bvsle .cse117 (bvadd (_ bv2147483647 32) (bvneg .cse113)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse123 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse121 ((_ sign_extend 32) .cse123)) (.cse122 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse119 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse120 ((_ sign_extend 32) .cse119))) (and (bvsle .cse119 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse120 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse119 (_ bv0 32)) (bvsge .cse121 (bvadd (_ bv18446744071562067968 64) (bvneg .cse120))))))) (bvsge .cse121 (bvadd (bvneg ((_ sign_extend 32) .cse122)) (_ bv18446744071562067968 64))) (bvsle .cse123 (bvadd (_ bv2147483647 32) (bvneg .cse122))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse129 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse124 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse129))) (.cse125 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse124 (bvadd (bvneg ((_ sign_extend 32) .cse125)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse128 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse126 (bvadd .cse128 c_~bsum~0))) (let ((.cse127 ((_ sign_extend 32) .cse126))) (and (bvsle .cse126 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse127 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse126 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse128 .cse129)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse124 (bvadd (_ bv18446744071562067968 64) (bvneg .cse127)))))))) (bvsle .cse125 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse136 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse132 (bvadd .cse7 c_~csum~0 .cse136))) (let ((.cse134 ((_ sign_extend 32) .cse132)) (.cse137 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse135 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse130 (bvadd c_~csum~0 .cse135 .cse136)) (.cse131 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse133 (bvadd .cse135 c_~bsum~0))) (and (bvsle .cse130 (bvadd (bvneg .cse131) (_ bv2147483647 32))) (bvsle .cse132 (bvadd (_ bv2147483647 32) (bvneg .cse133))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse130) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse131)))) (bvsge .cse134 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse133)))))))) (bvsge .cse134 (bvadd (bvneg ((_ sign_extend 32) .cse137)) (_ bv18446744071562067968 64))) (bvsle .cse137 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse142 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse145 (bvadd .cse7 c_~csum~0 .cse142))) (let ((.cse143 ((_ sign_extend 32) .cse145)) (.cse144 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse141 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse138 (bvadd .cse141 c_~bsum~0))) (let ((.cse140 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse139 ((_ sign_extend 32) .cse138))) (and (bvsle .cse138 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse139 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse140 (_ bv0 32)) (bvsle .cse138 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse141 .cse142)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse140)))) (bvsge .cse143 (bvadd (_ bv18446744071562067968 64) (bvneg .cse139)))))))) (bvsge .cse143 (bvadd (bvneg ((_ sign_extend 32) .cse144)) (_ bv18446744071562067968 64))) (bvsle .cse145 (bvadd (_ bv2147483647 32) (bvneg .cse144)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse150 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse146 ((_ sign_extend 32) .cse150)) (.cse147 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse146 (bvadd (bvneg ((_ sign_extend 32) .cse147)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse149 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse148 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse148 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse149 (_ bv0 32)) (bvsle .cse150 (bvadd (_ bv2147483647 32) (bvneg .cse148))) (bvsle .cse149 (_ bv0 32)) (bvsge .cse146 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse148))))))) (bvsle .cse147 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse158 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse151 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse158))) (.cse152 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse151 (bvadd (bvneg ((_ sign_extend 32) .cse152)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse157 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse155 (bvadd .cse157 c_~bsum~0))) (let ((.cse153 (bvadd c_~csum~0 .cse157 .cse158)) (.cse154 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse156 ((_ sign_extend 32) .cse155))) (and (bvsle .cse153 (bvadd (bvneg .cse154) (_ bv2147483647 32))) (bvsle .cse155 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse156 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse155 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse153) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse154)))) (bvsge .cse151 (bvadd (_ bv18446744071562067968 64) (bvneg .cse156)))))))) (bvsle .cse152 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse163 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse159 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse163))) (.cse160 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse159 (bvadd (bvneg ((_ sign_extend 32) .cse160)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse162 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse161 (bvadd .cse162 c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse161 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse162 .cse163)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse159 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse161)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse160 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse171 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse166 (bvadd .cse7 c_~csum~0 .cse171))) (let ((.cse165 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse164 ((_ sign_extend 32) .cse166))) (and (bvsge .cse164 (bvadd (bvneg ((_ sign_extend 32) .cse165)) (_ bv18446744071562067968 64))) (bvsle .cse166 (bvadd (_ bv2147483647 32) (bvneg .cse165))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse170 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse167 (bvadd c_~csum~0 .cse170 .cse171)) (.cse168 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse169 (bvadd .cse170 c_~bsum~0))) (and (bvsle .cse167 (bvadd (bvneg .cse168) (_ bv2147483647 32))) (bvsle .cse169 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse167) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse168)))) (bvsge .cse164 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse169)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse174 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse173 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse172 ((_ sign_extend 32) .cse174))) (and (bvsge .cse172 (bvadd (bvneg ((_ sign_extend 32) .cse173)) (_ bv18446744071562067968 64))) (bvsle .cse174 (bvadd (_ bv2147483647 32) (bvneg .cse173))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse175 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse176 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse175 (_ bv0 32)) (bvsle .cse174 (bvadd (_ bv2147483647 32) (bvneg .cse176))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse175 (_ bv0 32)) (bvsge .cse172 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse176)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse179 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse178 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse177 ((_ sign_extend 32) .cse179))) (and (bvsge .cse177 (bvadd (bvneg ((_ sign_extend 32) .cse178)) (_ bv18446744071562067968 64))) (bvsle .cse178 (_ bv0 32)) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse180 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse179 (bvadd (_ bv2147483647 32) (bvneg .cse180))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse177 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse180))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse182 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse183 ((_ sign_extend 32) .cse182)) (.cse184 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse181 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse181 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse182 (bvadd (_ bv2147483647 32) (bvneg .cse181))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse183 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse181))))))) (bvsge .cse183 (bvadd (bvneg ((_ sign_extend 32) .cse184)) (_ bv18446744071562067968 64))) (bvsle .cse184 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse186 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse189 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse186))) (.cse190 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse185 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse187 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse188 (bvadd .cse185 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse185 .cse186) (bvadd (bvneg .cse187) (_ bv2147483647 32))) (bvsge .cse187 (_ bv0 32)) (bvsle .cse188 (_ bv0 32)) (bvsge .cse189 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse188)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse189 (bvadd (bvneg ((_ sign_extend 32) .cse190)) (_ bv18446744071562067968 64))) (bvsle .cse190 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse192 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse193 (bvadd .cse7 c_~csum~0 .cse192))) (let ((.cse195 ((_ sign_extend 32) .cse193)) (.cse196 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse191 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse194 (bvadd .cse191 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse191 .cse192) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse193 (bvadd (_ bv2147483647 32) (bvneg .cse194))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse195 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse194)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse195 (bvadd (bvneg ((_ sign_extend 32) .cse196)) (_ bv18446744071562067968 64))) (bvsle .cse196 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse202 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse199 (bvadd .cse7 c_~csum~0 .cse202))) (let ((.cse197 ((_ sign_extend 32) .cse199)) (.cse198 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse197 (bvadd (bvneg ((_ sign_extend 32) .cse198)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse201 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse200 (bvadd .cse201 c_~bsum~0))) (and (bvsle .cse199 (bvadd (_ bv2147483647 32) (bvneg .cse200))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse201 .cse202)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse197 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse200)))))))) (bvsle .cse198 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse207 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse203 ((_ sign_extend 32) .cse207)) (.cse204 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse203 (bvadd (bvneg ((_ sign_extend 32) .cse204)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse205 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse206 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse205 (_ bv0 32)) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse205 (_ bv0 32)) (bvsle .cse206 (_ bv0 32)) (bvsge .cse203 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse206)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse207 (bvadd (_ bv2147483647 32) (bvneg .cse204))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse210 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse208 ((_ sign_extend 32) .cse210)) (.cse209 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse208 (bvadd (bvneg ((_ sign_extend 32) .cse209)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse211 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse210 (bvadd (_ bv2147483647 32) (bvneg .cse211))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse208 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse211)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse209 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse218 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse212 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse218))) (.cse213 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse212 (bvadd (bvneg ((_ sign_extend 32) .cse213)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse217 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse214 (bvadd c_~csum~0 .cse217 .cse218)) (.cse215 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse216 (bvadd .cse217 c_~bsum~0))) (and (bvsle .cse214 (bvadd (bvneg .cse215) (_ bv2147483647 32))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse216 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse214) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse215)))) (bvsge .cse212 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse216)))))))) (bvsle .cse213 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse220 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse221 ((_ sign_extend 32) .cse220)) (.cse222 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse219 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse219 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse220 (bvadd (_ bv2147483647 32) (bvneg .cse219))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse221 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse219))))))) (bvsge .cse221 (bvadd (bvneg ((_ sign_extend 32) .cse222)) (_ bv18446744071562067968 64))) (bvsle .cse220 (bvadd (_ bv2147483647 32) (bvneg .cse222))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse229 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse223 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse229))) (.cse224 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse223 (bvadd (bvneg ((_ sign_extend 32) .cse224)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse228 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse225 (bvadd c_~csum~0 .cse228 .cse229)) (.cse226 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse227 (bvadd .cse228 c_~bsum~0))) (and (bvsle .cse225 (bvadd (bvneg .cse226) (_ bv2147483647 32))) (bvsle .cse227 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse225) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse226)))) (bvsge .cse223 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse227)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse224 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse232 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse231 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse230 ((_ sign_extend 32) .cse232))) (and (bvsge .cse230 (bvadd (bvneg ((_ sign_extend 32) .cse231)) (_ bv18446744071562067968 64))) (bvsle .cse232 (bvadd (_ bv2147483647 32) (bvneg .cse231))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse234 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse233 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse233 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse234 (_ bv0 32)) (bvsle .cse232 (bvadd (_ bv2147483647 32) (bvneg .cse233))) (bvsle .cse234 (_ bv0 32)) (bvsge .cse230 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse233))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse239 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse242 (bvadd .cse7 c_~csum~0 .cse239))) (let ((.cse240 ((_ sign_extend 32) .cse242)) (.cse241 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse238 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse237 (bvadd .cse238 c_~bsum~0))) (let ((.cse236 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse235 ((_ sign_extend 32) .cse237))) (and (bvsge .cse235 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse236 (_ bv0 32)) (bvsle .cse237 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse238 .cse239)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse236)))) (bvsge .cse240 (bvadd (_ bv18446744071562067968 64) (bvneg .cse235)))))))) (bvsge .cse240 (bvadd (bvneg ((_ sign_extend 32) .cse241)) (_ bv18446744071562067968 64))) (bvsle .cse242 (bvadd (_ bv2147483647 32) (bvneg .cse241)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse244 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse248 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse244))) (.cse249 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse243 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse246 (bvadd .cse243 c_~bsum~0))) (let ((.cse245 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse247 ((_ sign_extend 32) .cse246))) (and (bvsle (bvadd c_~csum~0 .cse243 .cse244) (bvadd (bvneg .cse245) (_ bv2147483647 32))) (bvsle .cse246 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse245 (_ bv0 32)) (bvsge .cse247 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse246 (_ bv0 32)) (bvsge .cse248 (bvadd (_ bv18446744071562067968 64) (bvneg .cse247)))))))) (bvsge .cse248 (bvadd (bvneg ((_ sign_extend 32) .cse249)) (_ bv18446744071562067968 64))) (bvsle .cse249 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse254 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse252 (bvadd .cse7 c_~csum~0 .cse254))) (let ((.cse251 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse250 ((_ sign_extend 32) .cse252))) (and (bvsge .cse250 (bvadd (bvneg ((_ sign_extend 32) .cse251)) (_ bv18446744071562067968 64))) (bvsle .cse252 (bvadd (_ bv2147483647 32) (bvneg .cse251))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse253 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse255 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse256 (bvadd .cse253 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse253 .cse254) (bvadd (bvneg .cse255) (_ bv2147483647 32))) (bvsle .cse256 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse255 (_ bv0 32)) (bvsle .cse252 (bvadd (_ bv2147483647 32) (bvneg .cse256))) (bvsge .cse250 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse256))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse261 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse259 (bvadd .cse7 c_~csum~0 .cse261))) (let ((.cse258 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse257 ((_ sign_extend 32) .cse259))) (and (bvsge .cse257 (bvadd (bvneg ((_ sign_extend 32) .cse258)) (_ bv18446744071562067968 64))) (bvsle .cse259 (bvadd (_ bv2147483647 32) (bvneg .cse258))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse260 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse262 (bvadd .cse260 c_~bsum~0))) (let ((.cse263 ((_ sign_extend 32) .cse262))) (and (bvsle (bvadd c_~csum~0 .cse260 .cse261) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse262 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse263 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse262 (_ bv0 32)) (bvsge .cse257 (bvadd (_ bv18446744071562067968 64) (bvneg .cse263))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse266 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse264 ((_ sign_extend 32) .cse266)) (.cse265 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse264 (bvadd (bvneg ((_ sign_extend 32) .cse265)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse267 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse266 (bvadd (_ bv2147483647 32) (bvneg .cse267))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse264 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse267)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse266 (bvadd (_ bv2147483647 32) (bvneg .cse265))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse269 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse270 (bvadd .cse7 c_~csum~0 .cse269))) (let ((.cse272 ((_ sign_extend 32) .cse270)) (.cse273 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse268 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse271 (bvadd .cse268 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse268 .cse269) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse270 (bvadd (_ bv2147483647 32) (bvneg .cse271))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse272 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse271)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse272 (bvadd (bvneg ((_ sign_extend 32) .cse273)) (_ bv18446744071562067968 64))) (bvsle .cse270 (bvadd (_ bv2147483647 32) (bvneg .cse273)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse279 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse280 (bvadd .cse7 c_~csum~0 .cse279))) (let ((.cse274 ((_ sign_extend 32) .cse280)) (.cse275 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse274 (bvadd (bvneg ((_ sign_extend 32) .cse275)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse278 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse276 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse277 (bvadd .cse278 c_~bsum~0))) (and (bvsle .cse276 (_ bv0 32)) (bvsle v_arrayElimCell_11 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse277 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse278 .cse279)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse276)))) (bvsge .cse274 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse277)))))))) (bvsle .cse280 (bvadd (_ bv2147483647 32) (bvneg .cse275)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse287 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse281 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse287))) (.cse282 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse281 (bvadd (bvneg ((_ sign_extend 32) .cse282)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse286 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse283 (bvadd c_~csum~0 .cse286 .cse287)) (.cse284 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse285 (bvadd .cse286 c_~bsum~0))) (and (bvsle .cse283 (bvadd (bvneg .cse284) (_ bv2147483647 32))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse285 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse283) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse284)))) (bvsge .cse281 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse285)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse282 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse294 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse292 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse294))) (.cse295 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse293 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse290 (bvadd .cse293 c_~bsum~0))) (let ((.cse288 (bvadd c_~csum~0 .cse293 .cse294)) (.cse289 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse291 ((_ sign_extend 32) .cse290))) (and (bvsle .cse288 (bvadd (bvneg .cse289) (_ bv2147483647 32))) (bvsle .cse290 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse291 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse290 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse288) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse289)))) (bvsge .cse292 (bvadd (_ bv18446744071562067968 64) (bvneg .cse291)))))))) (bvsge .cse292 (bvadd (bvneg ((_ sign_extend 32) .cse295)) (_ bv18446744071562067968 64))) (bvsle .cse295 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse299 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse296 ((_ sign_extend 32) .cse299)) (.cse297 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse296 (bvadd (bvneg ((_ sign_extend 32) .cse297)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse298 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse298 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse299 (bvadd (_ bv2147483647 32) (bvneg .cse298))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse296 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse298))))))) (bvsle .cse297 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse306 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse303 (bvadd .cse7 c_~csum~0 .cse306))) (let ((.cse304 ((_ sign_extend 32) .cse303)) (.cse307 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse305 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse300 (bvadd c_~csum~0 .cse305 .cse306)) (.cse301 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse302 (bvadd .cse305 c_~bsum~0))) (and (bvsle .cse300 (bvadd (bvneg .cse301) (_ bv2147483647 32))) (bvsle .cse302 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse303 (bvadd (_ bv2147483647 32) (bvneg .cse302))) (bvsge ((_ sign_extend 32) .cse300) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse301)))) (bvsge .cse304 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse302)))))))) (bvsge .cse304 (bvadd (bvneg ((_ sign_extend 32) .cse307)) (_ bv18446744071562067968 64))) (bvsle .cse307 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse308 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse309 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse308 (bvadd (bvneg ((_ sign_extend 32) .cse309)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse310 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse311 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse312 ((_ sign_extend 32) .cse310))) (and (bvsle .cse310 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse311 (_ bv0 32)) (bvsge .cse312 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse311 (_ bv0 32)) (bvsle .cse310 (_ bv0 32)) (bvsge .cse308 (bvadd (_ bv18446744071562067968 64) (bvneg .cse312))))))) (bvsle .cse309 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse314 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse320 (bvadd .cse7 c_~csum~0 .cse314))) (let ((.cse318 ((_ sign_extend 32) .cse320)) (.cse319 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse313 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse316 (bvadd .cse313 c_~bsum~0))) (let ((.cse315 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse317 ((_ sign_extend 32) .cse316))) (and (bvsle (bvadd c_~csum~0 .cse313 .cse314) (bvadd (bvneg .cse315) (_ bv2147483647 32))) (bvsle .cse316 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse315 (_ bv0 32)) (bvsge .cse317 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse316 (_ bv0 32)) (bvsge .cse318 (bvadd (_ bv18446744071562067968 64) (bvneg .cse317)))))))) (bvsge .cse318 (bvadd (bvneg ((_ sign_extend 32) .cse319)) (_ bv18446744071562067968 64))) (bvsle .cse320 (bvadd (_ bv2147483647 32) (bvneg .cse319)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse322 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse324 (bvadd .cse7 c_~csum~0 .cse322))) (let ((.cse325 ((_ sign_extend 32) .cse324)) (.cse326 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse321 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse323 (bvadd .cse321 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse321 .cse322) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse323 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse324 (bvadd (_ bv2147483647 32) (bvneg .cse323))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse325 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse323)))))))) (bvsge .cse325 (bvadd (bvneg ((_ sign_extend 32) .cse326)) (_ bv18446744071562067968 64))) (bvsle .cse326 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse334 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse335 (bvadd .cse7 c_~csum~0 .cse334))) (let ((.cse327 ((_ sign_extend 32) .cse335)) (.cse328 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse327 (bvadd (bvneg ((_ sign_extend 32) .cse328)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse333 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse332 (bvadd .cse333 c_~bsum~0))) (let ((.cse329 (bvadd c_~csum~0 .cse333 .cse334)) (.cse330 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse331 ((_ sign_extend 32) .cse332))) (and (bvsle .cse329 (bvadd (bvneg .cse330) (_ bv2147483647 32))) (bvsge .cse331 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse332 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse329) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse330)))) (bvsge .cse327 (bvadd (_ bv18446744071562067968 64) (bvneg .cse331)))))))) (bvsle .cse335 (bvadd (_ bv2147483647 32) (bvneg .cse328)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse343 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse338 (bvadd .cse7 c_~csum~0 .cse343))) (let ((.cse337 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse336 ((_ sign_extend 32) .cse338))) (and (bvsge .cse336 (bvadd (bvneg ((_ sign_extend 32) .cse337)) (_ bv18446744071562067968 64))) (bvsle .cse338 (bvadd (_ bv2147483647 32) (bvneg .cse337))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse342 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse340 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (.cse341 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse339 (bvadd .cse342 c_~bsum~0))) (and (bvsle .cse339 .cse340) (bvsle .cse338 (bvadd (_ bv2147483647 32) (bvneg .cse339))) (bvsle .cse341 (_ bv0 32)) (bvsle v_arrayElimCell_11 .cse340) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse342 .cse343)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse341)))) (bvsge .cse336 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse339))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse347 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse350 (bvadd .cse7 c_~csum~0 .cse347))) (let ((.cse344 ((_ sign_extend 32) .cse350)) (.cse345 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse344 (bvadd (bvneg ((_ sign_extend 32) .cse345)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse346 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse348 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse349 (bvadd .cse346 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse346 .cse347) (bvadd (bvneg .cse348) (_ bv2147483647 32))) (bvsle .cse349 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse348 (_ bv0 32)) (bvsle .cse350 (bvadd (_ bv2147483647 32) (bvneg .cse349))) (bvsge .cse344 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse349)))))))) (bvsle .cse345 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse357 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse353 (bvadd .cse7 c_~csum~0 .cse357))) (let ((.cse351 ((_ sign_extend 32) .cse353)) (.cse352 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse351 (bvadd (bvneg ((_ sign_extend 32) .cse352)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse356 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse355 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse354 (bvadd .cse356 c_~bsum~0))) (and (bvsle .cse353 (bvadd (_ bv2147483647 32) (bvneg .cse354))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse355 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse356 .cse357)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse355)))) (bvsge .cse351 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse354)))))))) (bvsle .cse353 (bvadd (_ bv2147483647 32) (bvneg .cse352)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse364 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse361 (bvadd .cse7 c_~csum~0 .cse364))) (let ((.cse358 ((_ sign_extend 32) .cse361)) (.cse359 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse358 (bvadd (bvneg ((_ sign_extend 32) .cse359)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse363 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse362 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse360 (bvadd .cse363 c_~bsum~0))) (and (bvsle .cse360 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse361 (bvadd (_ bv2147483647 32) (bvneg .cse360))) (bvsle .cse362 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse363 .cse364)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse362)))) (bvsge .cse358 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse360)))))))) (bvsle .cse359 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse371 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse367 (bvadd .cse7 c_~csum~0 .cse371))) (let ((.cse369 ((_ sign_extend 32) .cse367)) (.cse372 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse370 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse365 (bvadd c_~csum~0 .cse370 .cse371)) (.cse366 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse368 (bvadd .cse370 c_~bsum~0))) (and (bvsle .cse365 (bvadd (bvneg .cse366) (_ bv2147483647 32))) (bvsle .cse367 (bvadd (_ bv2147483647 32) (bvneg .cse368))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse365) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse366)))) (bvsge .cse369 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse368)))))))) (bvsge .cse369 (bvadd (bvneg ((_ sign_extend 32) .cse372)) (_ bv18446744071562067968 64))) (bvsle .cse367 (bvadd (_ bv2147483647 32) (bvneg .cse372)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse375 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse374 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse373 ((_ sign_extend 32) .cse375))) (and (bvsge .cse373 (bvadd (bvneg ((_ sign_extend 32) .cse374)) (_ bv18446744071562067968 64))) (bvsle .cse375 (bvadd (_ bv2147483647 32) (bvneg .cse374))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse376 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse377 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse378 ((_ sign_extend 32) .cse376))) (and (bvsle .cse376 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse377 (_ bv0 32)) (bvsge .cse378 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse377 (_ bv0 32)) (bvsle .cse376 (_ bv0 32)) (bvsge .cse373 (bvadd (_ bv18446744071562067968 64) (bvneg .cse378))))))))))))) (= c_~csum~0 (bvadd c_~asum~0 c_~bsum~0))) is different from false