./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d38eb9d6ba70070fe3ced1aec90f1c3400cc1f89786e1bd625a19020cb0869f --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 15:02:50,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:02:51,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 15:02:51,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:02:51,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:02:51,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:02:51,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:02:51,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:02:51,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:02:51,072 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:02:51,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:02:51,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:02:51,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:02:51,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:02:51,074 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:02:51,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:02:51,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:02:51,075 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:02:51,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 15:02:51,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:02:51,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:02:51,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:02:51,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:02:51,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:02:51,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:02:51,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:02:51,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:02:51,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:02:51,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:02:51,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:02:51,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:02:51,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:02:51,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:02:51,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:02:51,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:02:51,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:02:51,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 15:02:51,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 15:02:51,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:02:51,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:02:51,081 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:02:51,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:02:51,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:02:51,081 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 -> Automizer 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 -> 9d38eb9d6ba70070fe3ced1aec90f1c3400cc1f89786e1bd625a19020cb0869f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:02:51,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:02:51,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:02:51,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:02:51,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:02:51,437 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:02:51,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2024-02-19 15:02:52,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:02:52,909 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:02:52,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2024-02-19 15:02:52,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a17020d/8af3a026cca04a2cbe0b08473933e664/FLAGa7f547983 [2024-02-19 15:02:52,926 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a17020d/8af3a026cca04a2cbe0b08473933e664 [2024-02-19 15:02:52,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:02:52,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:02:52,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:02:52,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:02:52,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:02:52,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:02:52" (1/1) ... [2024-02-19 15:02:52,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d4d20e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:52, skipping insertion in model container [2024-02-19 15:02:52,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:02:52" (1/1) ... [2024-02-19 15:02:52,953 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:02:53,073 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c[2533,2546] [2024-02-19 15:02:53,092 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:02:53,100 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:02:53,135 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c[2533,2546] [2024-02-19 15:02:53,141 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:02:53,155 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:02:53,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:53 WrapperNode [2024-02-19 15:02:53,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:02:53,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:02:53,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:02:53,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:02:53,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:53" (1/1) ... [2024-02-19 15:02:53,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:53" (1/1) ... [2024-02-19 15:02:53,220 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 231 [2024-02-19 15:02:53,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:02:53,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:02:53,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:02:53,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:02:53,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:53" (1/1) ... [2024-02-19 15:02:53,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:53" (1/1) ... [2024-02-19 15:02:53,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:53" (1/1) ... [2024-02-19 15:02:53,269 INFO L175 MemorySlicer]: Split 16 memory accesses to 5 slices as follows [2, 2, 8, 2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-02-19 15:02:53,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:53" (1/1) ... [2024-02-19 15:02:53,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:53" (1/1) ... [2024-02-19 15:02:53,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:53" (1/1) ... [2024-02-19 15:02:53,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:53" (1/1) ... [2024-02-19 15:02:53,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:53" (1/1) ... [2024-02-19 15:02:53,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:53" (1/1) ... [2024-02-19 15:02:53,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:02:53,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:02:53,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:02:53,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:02:53,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:53" (1/1) ... [2024-02-19 15:02:53,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:02:53,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:53,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 15:02:53,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 15:02:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:02:53,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:02:53,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 15:02:53,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 15:02:53,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 15:02:53,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 15:02:53,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 15:02:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 15:02:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 15:02:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 15:02:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 15:02:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 15:02:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:02:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:02:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:02:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:02:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 15:02:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 15:02:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 15:02:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 15:02:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 15:02:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 15:02:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 15:02:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 15:02:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 15:02:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:02:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:02:53,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:02:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:02:53,388 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 15:02:53,528 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:02:53,530 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:02:53,775 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:02:53,775 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:02:54,022 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:02:54,022 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-19 15:02:54,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:02:54 BoogieIcfgContainer [2024-02-19 15:02:54,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:02:54,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:02:54,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:02:54,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:02:54,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:02:52" (1/3) ... [2024-02-19 15:02:54,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fafe830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:02:54, skipping insertion in model container [2024-02-19 15:02:54,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:53" (2/3) ... [2024-02-19 15:02:54,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fafe830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:02:54, skipping insertion in model container [2024-02-19 15:02:54,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:02:54" (3/3) ... [2024-02-19 15:02:54,031 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2024-02-19 15:02:54,046 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:02:54,047 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:02:54,047 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:02:54,094 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-19 15:02:54,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 83 flow [2024-02-19 15:02:54,168 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-02-19 15:02:54,168 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:02:54,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 4/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2024-02-19 15:02:54,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 31 transitions, 83 flow [2024-02-19 15:02:54,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 27 transitions, 72 flow [2024-02-19 15:02:54,187 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:02:54,194 INFO L369 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6ddc0bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:02:54,195 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 15:02:54,226 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:02:54,227 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-02-19 15:02:54,227 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:02:54,228 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:54,228 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:54,229 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:02:54,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:54,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1838576641, now seen corresponding path program 1 times [2024-02-19 15:02:54,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:54,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775284609] [2024-02-19 15:02:54,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:54,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:54,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775284609] [2024-02-19 15:02:54,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775284609] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:02:54,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:02:54,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:02:54,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063824803] [2024-02-19 15:02:54,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:02:54,726 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:02:54,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:54,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:02:54,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:02:54,758 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-02-19 15:02:54,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:54,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:54,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-02-19 15:02:54,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:54,947 INFO L124 PetriNetUnfolderBase]: 433/638 cut-off events. [2024-02-19 15:02:54,948 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-02-19 15:02:54,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 638 events. 433/638 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2314 event pairs, 41 based on Foata normal form. 1/467 useless extension candidates. Maximal degree in co-relation 975. Up to 520 conditions per place. [2024-02-19 15:02:54,954 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 33 selfloop transitions, 4 changer transitions 1/43 dead transitions. [2024-02-19 15:02:54,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 195 flow [2024-02-19 15:02:54,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:02:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:02:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2024-02-19 15:02:54,964 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2024-02-19 15:02:54,968 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2024-02-19 15:02:54,968 INFO L507 AbstractCegarLoop]: Abstraction has has 35 places, 43 transitions, 195 flow [2024-02-19 15:02:54,969 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:54,969 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:54,969 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:54,969 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 15:02:54,970 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:02:54,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:54,971 INFO L85 PathProgramCache]: Analyzing trace with hash -301169373, now seen corresponding path program 1 times [2024-02-19 15:02:54,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:54,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959208575] [2024-02-19 15:02:54,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:54,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:02:55,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:55,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959208575] [2024-02-19 15:02:55,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959208575] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:02:55,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:02:55,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:02:55,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731505941] [2024-02-19 15:02:55,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:02:55,090 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:02:55,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:55,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:02:55,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:02:55,093 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-02-19 15:02:55,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 43 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:55,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:55,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-02-19 15:02:55,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:55,185 INFO L124 PetriNetUnfolderBase]: 433/639 cut-off events. [2024-02-19 15:02:55,185 INFO L125 PetriNetUnfolderBase]: For 109/153 co-relation queries the response was YES. [2024-02-19 15:02:55,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1905 conditions, 639 events. 433/639 cut-off events. For 109/153 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2313 event pairs, 41 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 1432. Up to 601 conditions per place. [2024-02-19 15:02:55,189 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 36 selfloop transitions, 2 changer transitions 1/44 dead transitions. [2024-02-19 15:02:55,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 277 flow [2024-02-19 15:02:55,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:02:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:02:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-02-19 15:02:55,191 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-02-19 15:02:55,191 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2024-02-19 15:02:55,192 INFO L507 AbstractCegarLoop]: Abstraction has has 37 places, 44 transitions, 277 flow [2024-02-19 15:02:55,192 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:55,192 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:55,192 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:55,192 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 15:02:55,192 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:02:55,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:55,193 INFO L85 PathProgramCache]: Analyzing trace with hash 812980965, now seen corresponding path program 1 times [2024-02-19 15:02:55,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:55,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885380759] [2024-02-19 15:02:55,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:55,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:02:55,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:55,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885380759] [2024-02-19 15:02:55,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885380759] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:55,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865389890] [2024-02-19 15:02:55,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:55,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:55,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:55,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:02:55,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-19 15:02:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:55,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:02:55,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:02:55,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:02:55,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865389890] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:55,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:02:55,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-02-19 15:02:55,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813379829] [2024-02-19 15:02:55,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:02:55,447 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:02:55,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:55,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:02:55,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:02:55,452 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-02-19 15:02:55,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 44 transitions, 277 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:55,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:55,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-02-19 15:02:55,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:55,554 INFO L124 PetriNetUnfolderBase]: 460/665 cut-off events. [2024-02-19 15:02:55,554 INFO L125 PetriNetUnfolderBase]: For 442/538 co-relation queries the response was YES. [2024-02-19 15:02:55,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2570 conditions, 665 events. 460/665 cut-off events. For 442/538 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2529 event pairs, 57 based on Foata normal form. 2/527 useless extension candidates. Maximal degree in co-relation 2387. Up to 601 conditions per place. [2024-02-19 15:02:55,559 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 47 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2024-02-19 15:02:55,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 56 transitions, 453 flow [2024-02-19 15:02:55,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:02:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:02:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2024-02-19 15:02:55,561 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45806451612903226 [2024-02-19 15:02:55,561 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2024-02-19 15:02:55,561 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 56 transitions, 453 flow [2024-02-19 15:02:55,562 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:55,562 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:55,562 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:55,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-19 15:02:55,773 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:55,773 INFO L432 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)] === [2024-02-19 15:02:55,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:55,774 INFO L85 PathProgramCache]: Analyzing trace with hash 640099616, now seen corresponding path program 1 times [2024-02-19 15:02:55,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:55,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498803133] [2024-02-19 15:02:55,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:55,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:02:55,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:55,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498803133] [2024-02-19 15:02:55,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498803133] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:02:55,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:02:55,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:02:55,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735528585] [2024-02-19 15:02:55,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:02:55,839 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:02:55,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:55,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:02:55,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:02:55,843 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-02-19 15:02:55,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 56 transitions, 453 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:55,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:55,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-02-19 15:02:55,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:55,967 INFO L124 PetriNetUnfolderBase]: 594/843 cut-off events. [2024-02-19 15:02:55,968 INFO L125 PetriNetUnfolderBase]: For 1158/1158 co-relation queries the response was YES. [2024-02-19 15:02:55,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3867 conditions, 843 events. 594/843 cut-off events. For 1158/1158 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3074 event pairs, 50 based on Foata normal form. 37/693 useless extension candidates. Maximal degree in co-relation 3630. Up to 704 conditions per place. [2024-02-19 15:02:55,974 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 67 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-02-19 15:02:55,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 75 transitions, 749 flow [2024-02-19 15:02:55,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:02:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:02:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2024-02-19 15:02:55,976 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.47580645161290325 [2024-02-19 15:02:55,976 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2024-02-19 15:02:55,976 INFO L507 AbstractCegarLoop]: Abstraction has has 44 places, 75 transitions, 749 flow [2024-02-19 15:02:55,977 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:55,977 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:55,977 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:55,977 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 15:02:55,977 INFO L432 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)] === [2024-02-19 15:02:55,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:55,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1076198349, now seen corresponding path program 1 times [2024-02-19 15:02:55,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:55,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884437197] [2024-02-19 15:02:55,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:55,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:57,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:57,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884437197] [2024-02-19 15:02:57,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884437197] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:57,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544422725] [2024-02-19 15:02:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:57,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:57,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:57,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:02:57,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-19 15:02:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:57,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 40 conjunts are in the unsatisfiable core [2024-02-19 15:02:57,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:57,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:02:57,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 35 [2024-02-19 15:02:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:57,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:58,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 416 treesize of output 376 [2024-02-19 15:02:58,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:02:58,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 691 treesize of output 675 [2024-02-19 15:03:36,695 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:03:43,234 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:05:42,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2024-02-19 15:05:42,707 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-02-19 15:05:42,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 1 [2024-02-19 15:05:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:42,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544422725] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:42,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:42,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-02-19 15:05:42,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079476877] [2024-02-19 15:05:42,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:42,745 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-02-19 15:05:42,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:42,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-02-19 15:05:42,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-02-19 15:05:42,853 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-02-19 15:05:42,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 75 transitions, 749 flow. Second operand has 18 states, 18 states have (on average 9.166666666666666) internal successors, (165), 18 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:42,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:42,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-02-19 15:05:42,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:43,573 INFO L124 PetriNetUnfolderBase]: 966/1394 cut-off events. [2024-02-19 15:05:43,573 INFO L125 PetriNetUnfolderBase]: For 2684/2716 co-relation queries the response was YES. [2024-02-19 15:05:43,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7663 conditions, 1394 events. 966/1394 cut-off events. For 2684/2716 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5732 event pairs, 32 based on Foata normal form. 15/1105 useless extension candidates. Maximal degree in co-relation 5727. Up to 1159 conditions per place. [2024-02-19 15:05:43,586 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 123 selfloop transitions, 35 changer transitions 1/163 dead transitions. [2024-02-19 15:05:43,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 163 transitions, 1965 flow [2024-02-19 15:05:43,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-19 15:05:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-19 15:05:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-02-19 15:05:43,590 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5096774193548387 [2024-02-19 15:05:43,592 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2024-02-19 15:05:43,592 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 163 transitions, 1965 flow [2024-02-19 15:05:43,592 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.166666666666666) internal successors, (165), 18 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:43,592 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:43,592 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:43,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-02-19 15:05:43,819 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:43,819 INFO L432 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)] === [2024-02-19 15:05:43,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:43,820 INFO L85 PathProgramCache]: Analyzing trace with hash 82468005, now seen corresponding path program 2 times [2024-02-19 15:05:43,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:43,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016496962] [2024-02-19 15:05:43,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:43,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:44,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:44,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016496962] [2024-02-19 15:05:44,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016496962] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:44,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064229756] [2024-02-19 15:05:44,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:05:44,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:44,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:44,724 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:05:44,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-19 15:05:44,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:05:44,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:44,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 36 conjunts are in the unsatisfiable core [2024-02-19 15:05:44,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:44,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:05:45,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2024-02-19 15:05:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:45,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:46,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2024-02-19 15:05:46,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:05:46,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 70 treesize of output 68 [2024-02-19 15:05:46,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 108 [2024-02-19 15:05:46,437 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-02-19 15:05:46,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 135 [2024-02-19 15:05:46,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 130 [2024-02-19 15:05:46,736 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-02-19 15:05:46,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 209 [2024-02-19 15:05:47,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2024-02-19 15:05:47,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2024-02-19 15:05:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:47,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064229756] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:47,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:47,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-02-19 15:05:47,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982635609] [2024-02-19 15:05:47,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:47,089 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-02-19 15:05:47,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:47,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-02-19 15:05:47,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-02-19 15:05:47,140 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:05:47,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 163 transitions, 1965 flow. Second operand has 25 states, 25 states have (on average 7.88) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:47,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:47,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:05:47,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:48,004 INFO L124 PetriNetUnfolderBase]: 1157/1667 cut-off events. [2024-02-19 15:05:48,004 INFO L125 PetriNetUnfolderBase]: For 3014/3022 co-relation queries the response was YES. [2024-02-19 15:05:48,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10841 conditions, 1667 events. 1157/1667 cut-off events. For 3014/3022 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7112 event pairs, 30 based on Foata normal form. 3/1316 useless extension candidates. Maximal degree in co-relation 8421. Up to 1394 conditions per place. [2024-02-19 15:05:48,024 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 169 selfloop transitions, 38 changer transitions 2/211 dead transitions. [2024-02-19 15:05:48,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 211 transitions, 2926 flow [2024-02-19 15:05:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-19 15:05:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-19 15:05:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-02-19 15:05:48,025 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-02-19 15:05:48,026 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2024-02-19 15:05:48,026 INFO L507 AbstractCegarLoop]: Abstraction has has 62 places, 211 transitions, 2926 flow [2024-02-19 15:05:48,026 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.88) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:48,026 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:48,026 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:48,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-19 15:05:48,238 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:48,238 INFO L432 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)] === [2024-02-19 15:05:48,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:48,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1208698257, now seen corresponding path program 3 times [2024-02-19 15:05:48,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:48,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782532494] [2024-02-19 15:05:48,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:48,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:48,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:48,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782532494] [2024-02-19 15:05:48,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782532494] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:48,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629623565] [2024-02-19 15:05:48,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:05:48,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:48,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:48,901 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:05:48,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-19 15:05:48,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-19 15:05:48,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:48,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 34 conjunts are in the unsatisfiable core [2024-02-19 15:05:49,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:49,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:05:49,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:05:49,315 INFO L378 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 74 treesize of output 46 [2024-02-19 15:05:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:49,455 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:50,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 86 [2024-02-19 15:05:50,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 115 [2024-02-19 15:05:50,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2024-02-19 15:05:50,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2024-02-19 15:05:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:50,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629623565] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:50,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:50,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-02-19 15:05:50,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931603782] [2024-02-19 15:05:50,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:50,481 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-02-19 15:05:50,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:50,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-02-19 15:05:50,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2024-02-19 15:05:50,522 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:05:50,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 211 transitions, 2926 flow. Second operand has 26 states, 26 states have (on average 7.769230769230769) internal successors, (202), 26 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:50,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:50,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:05:50,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:51,672 INFO L124 PetriNetUnfolderBase]: 1727/2506 cut-off events. [2024-02-19 15:05:51,672 INFO L125 PetriNetUnfolderBase]: For 4397/4426 co-relation queries the response was YES. [2024-02-19 15:05:51,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18906 conditions, 2506 events. 1727/2506 cut-off events. For 4397/4426 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11684 event pairs, 36 based on Foata normal form. 6/1989 useless extension candidates. Maximal degree in co-relation 12865. Up to 2152 conditions per place. [2024-02-19 15:05:51,697 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 270 selfloop transitions, 87 changer transitions 4/363 dead transitions. [2024-02-19 15:05:51,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 363 transitions, 5714 flow [2024-02-19 15:05:51,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-02-19 15:05:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-02-19 15:05:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 291 transitions. [2024-02-19 15:05:51,699 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4470046082949309 [2024-02-19 15:05:51,701 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 49 predicate places. [2024-02-19 15:05:51,701 INFO L507 AbstractCegarLoop]: Abstraction has has 82 places, 363 transitions, 5714 flow [2024-02-19 15:05:51,701 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.769230769230769) internal successors, (202), 26 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:51,701 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:51,701 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:51,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-19 15:05:51,904 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:51,905 INFO L432 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)] === [2024-02-19 15:05:51,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:51,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1852408671, now seen corresponding path program 4 times [2024-02-19 15:05:51,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:51,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566770476] [2024-02-19 15:05:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:51,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:52,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:52,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566770476] [2024-02-19 15:05:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566770476] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:52,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737969549] [2024-02-19 15:05:52,542 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:05:52,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:52,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:52,543 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:05:52,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-19 15:05:52,629 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:05:52,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:52,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 32 conjunts are in the unsatisfiable core [2024-02-19 15:05:52,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:52,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:05:52,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:05:52,890 INFO L378 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 82 treesize of output 46 [2024-02-19 15:05:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:53,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:54,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2024-02-19 15:05:54,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2024-02-19 15:05:54,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 86 [2024-02-19 15:05:54,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 115 [2024-02-19 15:05:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:54,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737969549] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:54,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:54,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-02-19 15:05:54,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890725150] [2024-02-19 15:05:54,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:54,125 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-02-19 15:05:54,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:54,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-02-19 15:05:54,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2024-02-19 15:05:54,152 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:05:54,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 363 transitions, 5714 flow. Second operand has 26 states, 26 states have (on average 7.769230769230769) internal successors, (202), 26 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:54,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:54,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:05:54,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:56,025 INFO L124 PetriNetUnfolderBase]: 2263/3308 cut-off events. [2024-02-19 15:05:56,025 INFO L125 PetriNetUnfolderBase]: For 5489/5516 co-relation queries the response was YES. [2024-02-19 15:05:56,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28365 conditions, 3308 events. 2263/3308 cut-off events. For 5489/5516 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16421 event pairs, 40 based on Foata normal form. 6/2635 useless extension candidates. Maximal degree in co-relation 17450. Up to 2937 conditions per place. [2024-02-19 15:05:56,057 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 418 selfloop transitions, 117 changer transitions 7/544 dead transitions. [2024-02-19 15:05:56,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 544 transitions, 9652 flow [2024-02-19 15:05:56,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-02-19 15:05:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-02-19 15:05:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 407 transitions. [2024-02-19 15:05:56,060 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4102822580645161 [2024-02-19 15:05:56,061 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 80 predicate places. [2024-02-19 15:05:56,061 INFO L507 AbstractCegarLoop]: Abstraction has has 113 places, 544 transitions, 9652 flow [2024-02-19 15:05:56,061 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.769230769230769) internal successors, (202), 26 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:56,061 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:56,061 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:56,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-19 15:05:56,273 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:56,273 INFO L432 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)] === [2024-02-19 15:05:56,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:56,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1399394401, now seen corresponding path program 5 times [2024-02-19 15:05:56,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:56,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647970308] [2024-02-19 15:05:56,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:56,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:56,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:56,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647970308] [2024-02-19 15:05:56,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647970308] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:56,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871340108] [2024-02-19 15:05:56,920 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:05:56,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:56,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:56,924 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:05:56,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-19 15:05:57,022 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-19 15:05:57,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:57,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 36 conjunts are in the unsatisfiable core [2024-02-19 15:05:57,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:57,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:05:57,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:05:57,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 81 [2024-02-19 15:05:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:57,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:00,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2024-02-19 15:06:00,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 115 [2024-02-19 15:06:00,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2024-02-19 15:06:00,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2024-02-19 15:06:00,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2024-02-19 15:06:00,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2024-02-19 15:06:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:06:00,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871340108] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:00,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:00,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2024-02-19 15:06:00,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895563194] [2024-02-19 15:06:00,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:00,322 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-02-19 15:06:00,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:00,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-02-19 15:06:00,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2024-02-19 15:06:00,409 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:06:00,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 544 transitions, 9652 flow. Second operand has 28 states, 28 states have (on average 7.571428571428571) internal successors, (212), 28 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:00,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:00,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:06:00,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:03,570 INFO L124 PetriNetUnfolderBase]: 3027/4396 cut-off events. [2024-02-19 15:06:03,571 INFO L125 PetriNetUnfolderBase]: For 7227/7256 co-relation queries the response was YES. [2024-02-19 15:06:03,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42122 conditions, 4396 events. 3027/4396 cut-off events. For 7227/7256 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 22675 event pairs, 46 based on Foata normal form. 6/3527 useless extension candidates. Maximal degree in co-relation 25973. Up to 4025 conditions per place. [2024-02-19 15:06:03,617 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 637 selfloop transitions, 181 changer transitions 9/829 dead transitions. [2024-02-19 15:06:03,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 829 transitions, 16310 flow [2024-02-19 15:06:03,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-02-19 15:06:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-02-19 15:06:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 434 transitions. [2024-02-19 15:06:03,621 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-02-19 15:06:03,622 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 115 predicate places. [2024-02-19 15:06:03,622 INFO L507 AbstractCegarLoop]: Abstraction has has 148 places, 829 transitions, 16310 flow [2024-02-19 15:06:03,623 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.571428571428571) internal successors, (212), 28 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:03,623 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:03,623 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:03,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-02-19 15:06:03,835 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:03,836 INFO L432 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)] === [2024-02-19 15:06:03,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2143084197, now seen corresponding path program 6 times [2024-02-19 15:06:03,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:03,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256933579] [2024-02-19 15:06:03,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:03,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:06:04,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:04,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256933579] [2024-02-19 15:06:04,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256933579] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:04,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178646649] [2024-02-19 15:06:04,364 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:06:04,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:04,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:04,377 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:06:04,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-19 15:06:04,474 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-02-19 15:06:04,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:04,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 40 conjunts are in the unsatisfiable core [2024-02-19 15:06:04,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:04,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:06:04,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2024-02-19 15:06:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:06:04,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:06,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 108 [2024-02-19 15:06:06,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:06:06,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 143 [2024-02-19 15:06:06,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 227 [2024-02-19 15:06:06,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:06:06,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 423 treesize of output 387 [2024-02-19 15:06:08,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 165 [2024-02-19 15:06:08,603 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-02-19 15:06:08,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 1 [2024-02-19 15:06:08,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2024-02-19 15:06:08,617 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-02-19 15:06:08,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 78 treesize of output 1 [2024-02-19 15:06:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:06:08,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178646649] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:08,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:08,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2024-02-19 15:06:08,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393458839] [2024-02-19 15:06:08,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:08,689 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-19 15:06:08,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:08,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-19 15:06:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-02-19 15:06:08,750 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:06:08,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 829 transitions, 16310 flow. Second operand has 21 states, 21 states have (on average 8.333333333333334) internal successors, (175), 21 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:08,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:08,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:06:08,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:10,149 INFO L124 PetriNetUnfolderBase]: 3147/4573 cut-off events. [2024-02-19 15:06:10,149 INFO L125 PetriNetUnfolderBase]: For 7282/7290 co-relation queries the response was YES. [2024-02-19 15:06:10,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48418 conditions, 4573 events. 3147/4573 cut-off events. For 7282/7290 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 23743 event pairs, 56 based on Foata normal form. 1/3660 useless extension candidates. Maximal degree in co-relation 29127. Up to 4202 conditions per place. [2024-02-19 15:06:10,209 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 797 selfloop transitions, 52 changer transitions 10/861 dead transitions. [2024-02-19 15:06:10,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 861 transitions, 18681 flow [2024-02-19 15:06:10,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-19 15:06:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-19 15:06:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-02-19 15:06:10,211 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.436950146627566 [2024-02-19 15:06:10,212 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 125 predicate places. [2024-02-19 15:06:10,212 INFO L507 AbstractCegarLoop]: Abstraction has has 158 places, 861 transitions, 18681 flow [2024-02-19 15:06:10,212 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.333333333333334) internal successors, (175), 21 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:10,213 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:10,213 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:10,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-19 15:06:10,425 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:10,425 INFO L432 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)] === [2024-02-19 15:06:10,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash -343243261, now seen corresponding path program 7 times [2024-02-19 15:06:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:10,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837317722] [2024-02-19 15:06:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:10,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:06:10,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:10,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837317722] [2024-02-19 15:06:10,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837317722] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:10,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793248620] [2024-02-19 15:06:10,546 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 15:06:10,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:10,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:10,555 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:06:10,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-19 15:06:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:10,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:06:10,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:06:10,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:06:10,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793248620] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:10,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:10,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-02-19 15:06:10,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213857705] [2024-02-19 15:06:10,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:10,742 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-19 15:06:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:10,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-19 15:06:10,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-02-19 15:06:10,760 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-02-19 15:06:10,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 861 transitions, 18681 flow. Second operand has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:10,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:10,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-02-19 15:06:10,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:11,834 INFO L124 PetriNetUnfolderBase]: 3587/5130 cut-off events. [2024-02-19 15:06:11,834 INFO L125 PetriNetUnfolderBase]: For 12101/12148 co-relation queries the response was YES. [2024-02-19 15:06:11,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58758 conditions, 5130 events. 3587/5130 cut-off events. For 12101/12148 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 26377 event pairs, 88 based on Foata normal form. 2/4129 useless extension candidates. Maximal degree in co-relation 35449. Up to 4760 conditions per place. [2024-02-19 15:06:11,903 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 747 selfloop transitions, 43 changer transitions 8/854 dead transitions. [2024-02-19 15:06:11,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 854 transitions, 20112 flow [2024-02-19 15:06:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:06:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:06:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-02-19 15:06:11,904 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5040322580645161 [2024-02-19 15:06:11,906 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 128 predicate places. [2024-02-19 15:06:11,906 INFO L507 AbstractCegarLoop]: Abstraction has has 161 places, 854 transitions, 20112 flow [2024-02-19 15:06:11,906 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:11,906 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:11,906 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:11,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-02-19 15:06:12,118 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-02-19 15:06:12,118 INFO L432 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)] === [2024-02-19 15:06:12,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:12,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1956073759, now seen corresponding path program 1 times [2024-02-19 15:06:12,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:12,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315832459] [2024-02-19 15:06:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:12,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:06:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:12,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315832459] [2024-02-19 15:06:12,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315832459] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:12,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534758645] [2024-02-19 15:06:12,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:12,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:12,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:12,207 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:06:12,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-02-19 15:06:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:12,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:06:12,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:06:12,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:06:12,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534758645] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:12,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:12,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-02-19 15:06:12,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303184989] [2024-02-19 15:06:12,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:12,434 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-19 15:06:12,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:12,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-19 15:06:12,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-02-19 15:06:12,461 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-02-19 15:06:12,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 854 transitions, 20112 flow. Second operand has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:12,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:12,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-02-19 15:06:12,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:13,417 INFO L124 PetriNetUnfolderBase]: 3689/5517 cut-off events. [2024-02-19 15:06:13,417 INFO L125 PetriNetUnfolderBase]: For 23495/23600 co-relation queries the response was YES. [2024-02-19 15:06:13,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63590 conditions, 5517 events. 3689/5517 cut-off events. For 23495/23600 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 28499 event pairs, 159 based on Foata normal form. 36/5031 useless extension candidates. Maximal degree in co-relation 37831. Up to 4640 conditions per place. [2024-02-19 15:06:13,485 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 845 selfloop transitions, 78 changer transitions 18/1009 dead transitions. [2024-02-19 15:06:13,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 1009 transitions, 25773 flow [2024-02-19 15:06:13,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:06:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:06:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-02-19 15:06:13,487 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5268817204301075 [2024-02-19 15:06:13,487 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 133 predicate places. [2024-02-19 15:06:13,487 INFO L507 AbstractCegarLoop]: Abstraction has has 166 places, 1009 transitions, 25773 flow [2024-02-19 15:06:13,487 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:13,487 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:13,488 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:13,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-02-19 15:06:13,699 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:13,700 INFO L432 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)] === [2024-02-19 15:06:13,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash 884578782, now seen corresponding path program 8 times [2024-02-19 15:06:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:13,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283399722] [2024-02-19 15:06:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:13,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:06:13,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:13,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283399722] [2024-02-19 15:06:13,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283399722] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:13,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914279236] [2024-02-19 15:06:13,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:06:13,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:13,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:13,772 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:06:13,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-02-19 15:06:13,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:06:13,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:13,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:06:13,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:06:13,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:06:13,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914279236] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:13,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:13,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-02-19 15:06:13,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65186145] [2024-02-19 15:06:13,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:13,969 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-19 15:06:13,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:13,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-19 15:06:13,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-02-19 15:06:13,983 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-02-19 15:06:13,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 1009 transitions, 25773 flow. Second operand has 14 states, 14 states have (on average 9.571428571428571) internal successors, (134), 14 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:13,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:13,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-02-19 15:06:13,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:15,039 INFO L124 PetriNetUnfolderBase]: 3352/5122 cut-off events. [2024-02-19 15:06:15,039 INFO L125 PetriNetUnfolderBase]: For 41537/41667 co-relation queries the response was YES. [2024-02-19 15:06:15,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63160 conditions, 5122 events. 3352/5122 cut-off events. For 41537/41667 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 27258 event pairs, 119 based on Foata normal form. 18/4885 useless extension candidates. Maximal degree in co-relation 35758. Up to 4263 conditions per place. [2024-02-19 15:06:15,091 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 788 selfloop transitions, 106 changer transitions 71/1022 dead transitions. [2024-02-19 15:06:15,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1022 transitions, 28041 flow [2024-02-19 15:06:15,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:06:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:06:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-02-19 15:06:15,092 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5207373271889401 [2024-02-19 15:06:15,093 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 139 predicate places. [2024-02-19 15:06:15,093 INFO L507 AbstractCegarLoop]: Abstraction has has 172 places, 1022 transitions, 28041 flow [2024-02-19 15:06:15,093 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.571428571428571) internal successors, (134), 14 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:15,093 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:15,093 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:15,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-02-19 15:06:15,305 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-02-19 15:06:15,305 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:06:15,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash 837135422, now seen corresponding path program 9 times [2024-02-19 15:06:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:15,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303317220] [2024-02-19 15:06:15,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:06:15,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:15,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303317220] [2024-02-19 15:06:15,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303317220] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:15,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561380527] [2024-02-19 15:06:15,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:06:15,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:15,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:15,448 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:06:15,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-02-19 15:06:15,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-19 15:06:15,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:15,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:06:15,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:06:15,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:06:15,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561380527] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:15,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:15,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-02-19 15:06:15,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585984602] [2024-02-19 15:06:15,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:15,709 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-02-19 15:06:15,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:15,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-02-19 15:06:15,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-02-19 15:06:15,716 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:06:15,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 1022 transitions, 28041 flow. Second operand has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:15,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:15,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:06:15,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:17,541 INFO L124 PetriNetUnfolderBase]: 3992/6069 cut-off events. [2024-02-19 15:06:17,541 INFO L125 PetriNetUnfolderBase]: For 83728/83912 co-relation queries the response was YES. [2024-02-19 15:06:17,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79849 conditions, 6069 events. 3992/6069 cut-off events. For 83728/83912 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 33153 event pairs, 51 based on Foata normal form. 30/5718 useless extension candidates. Maximal degree in co-relation 37892. Up to 5070 conditions per place. [2024-02-19 15:06:17,595 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 1226 selfloop transitions, 268 changer transitions 71/1578 dead transitions. [2024-02-19 15:06:17,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 1578 transitions, 46040 flow [2024-02-19 15:06:17,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 15:06:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 15:06:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 203 transitions. [2024-02-19 15:06:17,598 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2024-02-19 15:06:17,598 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 152 predicate places. [2024-02-19 15:06:17,598 INFO L507 AbstractCegarLoop]: Abstraction has has 185 places, 1578 transitions, 46040 flow [2024-02-19 15:06:17,599 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:17,599 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:17,599 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:17,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-02-19 15:06:17,810 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-02-19 15:06:17,811 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:06:17,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1245683912, now seen corresponding path program 10 times [2024-02-19 15:06:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:17,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775431346] [2024-02-19 15:06:17,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:06:17,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775431346] [2024-02-19 15:06:17,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775431346] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992943731] [2024-02-19 15:06:17,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:06:17,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:17,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:17,955 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:06:17,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-02-19 15:06:18,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:06:18,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:18,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:06:18,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:06:18,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:06:18,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992943731] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:18,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:18,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-02-19 15:06:18,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436776381] [2024-02-19 15:06:18,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:18,249 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-19 15:06:18,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:18,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-19 15:06:18,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-02-19 15:06:18,261 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:06:18,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 1578 transitions, 46040 flow. Second operand has 19 states, 19 states have (on average 7.421052631578948) internal successors, (141), 19 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:18,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:18,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:06:18,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:20,502 INFO L124 PetriNetUnfolderBase]: 4762/7195 cut-off events. [2024-02-19 15:06:20,503 INFO L125 PetriNetUnfolderBase]: For 87133/87369 co-relation queries the response was YES. [2024-02-19 15:06:20,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102582 conditions, 7195 events. 4762/7195 cut-off events. For 87133/87369 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 39076 event pairs, 67 based on Foata normal form. 0/6631 useless extension candidates. Maximal degree in co-relation 56383. Up to 6142 conditions per place. [2024-02-19 15:06:20,570 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 1637 selfloop transitions, 210 changer transitions 71/1931 dead transitions. [2024-02-19 15:06:20,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1931 transitions, 60357 flow [2024-02-19 15:06:20,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-19 15:06:20,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-19 15:06:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 174 transitions. [2024-02-19 15:06:20,571 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2024-02-19 15:06:20,572 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 163 predicate places. [2024-02-19 15:06:20,572 INFO L507 AbstractCegarLoop]: Abstraction has has 196 places, 1931 transitions, 60357 flow [2024-02-19 15:06:20,572 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.421052631578948) internal successors, (141), 19 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:20,572 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:20,572 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:20,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-02-19 15:06:20,780 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-02-19 15:06:20,780 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:06:20,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:20,781 INFO L85 PathProgramCache]: Analyzing trace with hash 132865592, now seen corresponding path program 11 times [2024-02-19 15:06:20,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:20,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79120971] [2024-02-19 15:06:20,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:20,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:20,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:20,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79120971] [2024-02-19 15:06:20,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79120971] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:20,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614776718] [2024-02-19 15:06:20,965 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:06:20,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:20,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:20,966 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:06:20,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-02-19 15:06:21,067 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:06:21,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:21,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:06:21,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:21,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:21,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614776718] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:21,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:21,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2024-02-19 15:06:21,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202614642] [2024-02-19 15:06:21,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:21,218 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-19 15:06:21,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:21,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-19 15:06:21,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-02-19 15:06:21,224 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-02-19 15:06:21,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 1931 transitions, 60357 flow. Second operand has 17 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 17 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:21,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:21,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-02-19 15:06:21,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:25,034 INFO L124 PetriNetUnfolderBase]: 5167/7791 cut-off events. [2024-02-19 15:06:25,035 INFO L125 PetriNetUnfolderBase]: For 84135/84135 co-relation queries the response was YES. [2024-02-19 15:06:25,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118836 conditions, 7791 events. 5167/7791 cut-off events. For 84135/84135 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 42483 event pairs, 47 based on Foata normal form. 24/7179 useless extension candidates. Maximal degree in co-relation 68991. Up to 6660 conditions per place. [2024-02-19 15:06:25,119 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 1500 selfloop transitions, 801 changer transitions 71/2373 dead transitions. [2024-02-19 15:06:25,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 2373 transitions, 77931 flow [2024-02-19 15:06:25,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-02-19 15:06:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-02-19 15:06:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 407 transitions. [2024-02-19 15:06:25,121 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38614800759013285 [2024-02-19 15:06:25,122 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 196 predicate places. [2024-02-19 15:06:25,122 INFO L507 AbstractCegarLoop]: Abstraction has has 229 places, 2373 transitions, 77931 flow [2024-02-19 15:06:25,122 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 17 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:25,122 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:25,122 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:25,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-02-19 15:06:25,328 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-02-19 15:06:25,328 INFO L432 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:06:25,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1886622860, now seen corresponding path program 12 times [2024-02-19 15:06:25,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:25,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648577612] [2024-02-19 15:06:25,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:25,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:25,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:25,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648577612] [2024-02-19 15:06:25,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648577612] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:25,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597829283] [2024-02-19 15:06:25,462 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:06:25,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:25,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:25,463 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:06:25,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-02-19 15:06:25,574 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-02-19 15:06:25,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:25,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:06:25,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:25,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:25,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597829283] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:25,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:25,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-02-19 15:06:25,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41166452] [2024-02-19 15:06:25,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:25,774 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-19 15:06:25,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:25,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-19 15:06:25,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-02-19 15:06:25,792 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:06:25,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 2373 transitions, 77931 flow. Second operand has 21 states, 21 states have (on average 7.142857142857143) internal successors, (150), 21 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:25,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:25,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:06:25,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:31,245 INFO L124 PetriNetUnfolderBase]: 7087/10650 cut-off events. [2024-02-19 15:06:31,246 INFO L125 PetriNetUnfolderBase]: For 140172/140172 co-relation queries the response was YES. [2024-02-19 15:06:31,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176713 conditions, 10650 events. 7087/10650 cut-off events. For 140172/140172 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 61191 event pairs, 69 based on Foata normal form. 0/9690 useless extension candidates. Maximal degree in co-relation 105459. Up to 9408 conditions per place. [2024-02-19 15:06:31,364 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 2671 selfloop transitions, 664 changer transitions 71/3439 dead transitions. [2024-02-19 15:06:31,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 3439 transitions, 120873 flow [2024-02-19 15:06:31,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-19 15:06:31,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-19 15:06:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 219 transitions. [2024-02-19 15:06:31,366 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.47096774193548385 [2024-02-19 15:06:31,366 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 210 predicate places. [2024-02-19 15:06:31,366 INFO L507 AbstractCegarLoop]: Abstraction has has 243 places, 3439 transitions, 120873 flow [2024-02-19 15:06:31,366 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.142857142857143) internal successors, (150), 21 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:31,366 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:31,367 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:31,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-02-19 15:06:31,574 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:31,574 INFO L432 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:06:31,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash -775121824, now seen corresponding path program 13 times [2024-02-19 15:06:31,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:31,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056075842] [2024-02-19 15:06:31,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:31,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:31,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:31,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056075842] [2024-02-19 15:06:31,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056075842] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:31,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437450556] [2024-02-19 15:06:31,690 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 15:06:31,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:31,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:31,705 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:06:31,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-02-19 15:06:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:31,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:06:31,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:31,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:32,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437450556] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:32,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:32,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-02-19 15:06:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274512120] [2024-02-19 15:06:32,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:32,013 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-02-19 15:06:32,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:32,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-02-19 15:06:32,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-02-19 15:06:32,018 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:06:32,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 3439 transitions, 120873 flow. Second operand has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:32,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:32,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:06:32,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:39,126 INFO L124 PetriNetUnfolderBase]: 7109/10685 cut-off events. [2024-02-19 15:06:39,126 INFO L125 PetriNetUnfolderBase]: For 146145/146145 co-relation queries the response was YES. [2024-02-19 15:06:39,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187672 conditions, 10685 events. 7109/10685 cut-off events. For 146145/146145 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 61611 event pairs, 69 based on Foata normal form. 24/9747 useless extension candidates. Maximal degree in co-relation 112221. Up to 9444 conditions per place. [2024-02-19 15:06:39,254 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 2583 selfloop transitions, 778 changer transitions 71/3465 dead transitions. [2024-02-19 15:06:39,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 3465 transitions, 128601 flow [2024-02-19 15:06:39,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-19 15:06:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-19 15:06:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 252 transitions. [2024-02-19 15:06:39,256 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-02-19 15:06:39,257 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 226 predicate places. [2024-02-19 15:06:39,257 INFO L507 AbstractCegarLoop]: Abstraction has has 259 places, 3465 transitions, 128601 flow [2024-02-19 15:06:39,257 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:39,257 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:39,257 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:39,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-02-19 15:06:39,469 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-02-19 15:06:39,469 INFO L432 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:06:39,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash -396782834, now seen corresponding path program 14 times [2024-02-19 15:06:39,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:39,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91256921] [2024-02-19 15:06:39,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:39,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:39,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:39,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91256921] [2024-02-19 15:06:39,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91256921] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:39,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726084644] [2024-02-19 15:06:39,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:06:39,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:39,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:39,703 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:06:39,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-02-19 15:06:39,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:06:39,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:39,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:06:39,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:39,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:39,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726084644] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:39,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:39,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-02-19 15:06:39,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339209395] [2024-02-19 15:06:39,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:39,998 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-19 15:06:39,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:39,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-19 15:06:39,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-02-19 15:06:40,006 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:06:40,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 3465 transitions, 128601 flow. Second operand has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:40,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:40,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:06:40,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:47,673 INFO L124 PetriNetUnfolderBase]: 7199/10839 cut-off events. [2024-02-19 15:06:47,673 INFO L125 PetriNetUnfolderBase]: For 148918/148918 co-relation queries the response was YES. [2024-02-19 15:06:47,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200861 conditions, 10839 events. 7199/10839 cut-off events. For 148918/148918 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 62846 event pairs, 67 based on Foata normal form. 24/9895 useless extension candidates. Maximal degree in co-relation 121175. Up to 9598 conditions per place. [2024-02-19 15:06:47,800 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 2896 selfloop transitions, 539 changer transitions 71/3539 dead transitions. [2024-02-19 15:06:47,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 3539 transitions, 138309 flow [2024-02-19 15:06:47,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 15:06:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 15:06:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 199 transitions. [2024-02-19 15:06:47,802 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45852534562211983 [2024-02-19 15:06:47,803 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 239 predicate places. [2024-02-19 15:06:47,803 INFO L507 AbstractCegarLoop]: Abstraction has has 272 places, 3539 transitions, 138309 flow [2024-02-19 15:06:47,803 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:47,803 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:47,803 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:47,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-02-19 15:06:48,009 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:48,009 INFO L432 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:06:48,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:48,010 INFO L85 PathProgramCache]: Analyzing trace with hash 708013114, now seen corresponding path program 15 times [2024-02-19 15:06:48,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:48,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671861993] [2024-02-19 15:06:48,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:48,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:48,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:48,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671861993] [2024-02-19 15:06:48,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671861993] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:48,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087391514] [2024-02-19 15:06:48,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:06:48,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:48,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:48,140 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:06:48,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-02-19 15:06:48,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:06:48,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:48,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:06:48,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:48,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:48,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087391514] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:48,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:48,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-02-19 15:06:48,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847597610] [2024-02-19 15:06:48,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:48,450 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-02-19 15:06:48,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:48,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-02-19 15:06:48,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-02-19 15:06:48,456 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:06:48,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 3539 transitions, 138309 flow. Second operand has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:48,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:48,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:06:48,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:57,684 INFO L124 PetriNetUnfolderBase]: 8155/12219 cut-off events. [2024-02-19 15:06:57,684 INFO L125 PetriNetUnfolderBase]: For 163529/163529 co-relation queries the response was YES. [2024-02-19 15:06:57,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239081 conditions, 12219 events. 8155/12219 cut-off events. For 163529/163529 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 71577 event pairs, 71 based on Foata normal form. 24/11027 useless extension candidates. Maximal degree in co-relation 155072. Up to 10976 conditions per place. [2024-02-19 15:06:57,855 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 3222 selfloop transitions, 672 changer transitions 71/3998 dead transitions. [2024-02-19 15:06:57,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 3998 transitions, 164249 flow [2024-02-19 15:06:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-02-19 15:06:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-02-19 15:06:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 330 transitions. [2024-02-19 15:06:57,858 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4628330995792426 [2024-02-19 15:06:57,859 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 261 predicate places. [2024-02-19 15:06:57,859 INFO L507 AbstractCegarLoop]: Abstraction has has 294 places, 3998 transitions, 164249 flow [2024-02-19 15:06:57,859 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:57,859 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:57,859 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:57,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-02-19 15:06:58,073 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:58,074 INFO L432 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:06:58,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:58,074 INFO L85 PathProgramCache]: Analyzing trace with hash -403487922, now seen corresponding path program 16 times [2024-02-19 15:06:58,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:58,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461489628] [2024-02-19 15:06:58,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:58,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:58,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:58,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461489628] [2024-02-19 15:06:58,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461489628] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:58,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839379836] [2024-02-19 15:06:58,191 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:06:58,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:58,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:58,192 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:06:58,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-02-19 15:06:58,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:06:58,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:58,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:06:58,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:58,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:58,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839379836] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:58,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:58,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-02-19 15:06:58,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184215969] [2024-02-19 15:06:58,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:58,521 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-19 15:06:58,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:58,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-19 15:06:58,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-02-19 15:06:58,525 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:06:58,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 3998 transitions, 164249 flow. Second operand has 21 states, 21 states have (on average 7.142857142857143) internal successors, (150), 21 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:58,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:58,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:06:58,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:07:09,603 INFO L124 PetriNetUnfolderBase]: 8403/12560 cut-off events. [2024-02-19 15:07:09,603 INFO L125 PetriNetUnfolderBase]: For 169612/169612 co-relation queries the response was YES. [2024-02-19 15:07:09,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258258 conditions, 12560 events. 8403/12560 cut-off events. For 169612/169612 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 73652 event pairs, 83 based on Foata normal form. 0/11296 useless extension candidates. Maximal degree in co-relation 170056. Up to 11318 conditions per place. [2024-02-19 15:07:09,784 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 3286 selfloop transitions, 641 changer transitions 71/4031 dead transitions. [2024-02-19 15:07:09,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 4031 transitions, 173632 flow [2024-02-19 15:07:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-19 15:07:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-19 15:07:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 243 transitions. [2024-02-19 15:07:09,786 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4899193548387097 [2024-02-19 15:07:09,786 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 275 predicate places. [2024-02-19 15:07:09,786 INFO L507 AbstractCegarLoop]: Abstraction has has 308 places, 4031 transitions, 173632 flow [2024-02-19 15:07:09,786 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.142857142857143) internal successors, (150), 21 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:07:09,786 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:07:09,786 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:07:09,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-02-19 15:07:09,998 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:07:09,998 INFO L432 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:07:09,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:07:09,999 INFO L85 PathProgramCache]: Analyzing trace with hash 594890340, now seen corresponding path program 17 times [2024-02-19 15:07:09,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:07:09,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435675899] [2024-02-19 15:07:09,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:07:09,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:07:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:07:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:07:10,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:07:10,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435675899] [2024-02-19 15:07:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435675899] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:07:10,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164119421] [2024-02-19 15:07:10,098 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:07:10,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:07:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:07:10,107 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:07:10,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-02-19 15:07:10,229 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:07:10,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:07:10,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:07:10,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:07:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:07:10,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:07:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:07:10,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164119421] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:07:10,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:07:10,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2024-02-19 15:07:10,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304119232] [2024-02-19 15:07:10,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:07:10,396 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-02-19 15:07:10,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:07:10,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-02-19 15:07:10,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-02-19 15:07:10,404 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-02-19 15:07:10,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 4031 transitions, 173632 flow. Second operand has 18 states, 18 states have (on average 6.944444444444445) internal successors, (125), 18 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:07:10,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:07:10,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-02-19 15:07:10,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:07:24,311 INFO L124 PetriNetUnfolderBase]: 9305/13841 cut-off events. [2024-02-19 15:07:24,311 INFO L125 PetriNetUnfolderBase]: For 171121/171121 co-relation queries the response was YES. [2024-02-19 15:07:24,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299107 conditions, 13841 events. 9305/13841 cut-off events. For 171121/171121 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 81121 event pairs, 95 based on Foata normal form. 24/12371 useless extension candidates. Maximal degree in co-relation 206482. Up to 12598 conditions per place. [2024-02-19 15:07:24,512 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 2844 selfloop transitions, 1395 changer transitions 71/4311 dead transitions. [2024-02-19 15:07:24,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 4311 transitions, 193807 flow [2024-02-19 15:07:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-02-19 15:07:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2024-02-19 15:07:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 876 transitions. [2024-02-19 15:07:24,514 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.37181663837011886 [2024-02-19 15:07:24,515 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 350 predicate places. [2024-02-19 15:07:24,515 INFO L507 AbstractCegarLoop]: Abstraction has has 383 places, 4311 transitions, 193807 flow [2024-02-19 15:07:24,515 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.944444444444445) internal successors, (125), 18 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:07:24,515 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:07:24,515 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:07:24,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-02-19 15:07:24,725 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:07:24,726 INFO L432 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:07:24,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:07:24,726 INFO L85 PathProgramCache]: Analyzing trace with hash -516610696, now seen corresponding path program 18 times [2024-02-19 15:07:24,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:07:24,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215990235] [2024-02-19 15:07:24,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:07:24,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:07:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:07:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:07:25,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:07:25,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215990235] [2024-02-19 15:07:25,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215990235] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:07:25,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59075354] [2024-02-19 15:07:25,041 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:07:25,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:07:25,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:07:25,042 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:07:25,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-02-19 15:07:25,179 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-02-19 15:07:25,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:07:25,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:07:25,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:07:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:07:25,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:07:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:07:25,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59075354] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:07:25,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:07:25,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-02-19 15:07:25,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771270976] [2024-02-19 15:07:25,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:07:25,377 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-19 15:07:25,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:07:25,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-19 15:07:25,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-02-19 15:07:25,384 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:07:25,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 4311 transitions, 193807 flow. Second operand has 21 states, 21 states have (on average 7.142857142857143) internal successors, (150), 21 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:07:25,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:07:25,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:07:25,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:07:39,670 INFO L124 PetriNetUnfolderBase]: 9273/13782 cut-off events. [2024-02-19 15:07:39,670 INFO L125 PetriNetUnfolderBase]: For 177307/177307 co-relation queries the response was YES. [2024-02-19 15:07:39,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311086 conditions, 13782 events. 9273/13782 cut-off events. For 177307/177307 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 80505 event pairs, 97 based on Foata normal form. 0/12312 useless extension candidates. Maximal degree in co-relation 214272. Up to 12540 conditions per place. [2024-02-19 15:07:39,877 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 3259 selfloop transitions, 882 changer transitions 71/4275 dead transitions. [2024-02-19 15:07:39,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 4275 transitions, 200586 flow [2024-02-19 15:07:39,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-02-19 15:07:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-02-19 15:07:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 304 transitions. [2024-02-19 15:07:39,879 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.49032258064516127 [2024-02-19 15:07:39,879 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 366 predicate places. [2024-02-19 15:07:39,879 INFO L507 AbstractCegarLoop]: Abstraction has has 399 places, 4275 transitions, 200586 flow [2024-02-19 15:07:39,879 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.142857142857143) internal successors, (150), 21 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:07:39,880 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:07:39,880 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:07:39,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-02-19 15:07:40,104 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-02-19 15:07:40,104 INFO L432 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:07:40,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:07:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash 675726776, now seen corresponding path program 2 times [2024-02-19 15:07:40,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:07:40,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304620601] [2024-02-19 15:07:40,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:07:40,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:07:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:07:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:07:42,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:07:42,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304620601] [2024-02-19 15:07:42,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304620601] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:07:42,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795568422] [2024-02-19 15:07:42,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:07:42,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:07:42,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:07:42,458 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:07:42,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-02-19 15:07:42,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:07:42,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:07:42,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 56 conjunts are in the unsatisfiable core [2024-02-19 15:07:42,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:07:42,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:07:43,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:07:43,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 104 [2024-02-19 15:07:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:07:44,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:07:58,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 823 treesize of output 739 [2024-02-19 15:07:58,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:07:58,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1599 treesize of output 1252 [2024-02-19 15:08:08,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 943 treesize of output 843 [2024-02-19 15:08:08,075 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-02-19 15:08:08,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2210 treesize of output 1710 [2024-02-19 15:08:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:08:19,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795568422] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:08:19,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:08:19,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 39 [2024-02-19 15:08:19,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846779590] [2024-02-19 15:08:19,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:08:19,398 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-02-19 15:08:19,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:08:19,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-02-19 15:08:19,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1400, Unknown=0, NotChecked=0, Total=1560 [2024-02-19 15:08:19,741 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-02-19 15:08:19,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 4275 transitions, 200586 flow. Second operand has 40 states, 40 states have (on average 6.1) internal successors, (244), 40 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:08:19,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:08:19,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-02-19 15:08:19,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:09:17,645 INFO L124 PetriNetUnfolderBase]: 13818/20771 cut-off events. [2024-02-19 15:09:17,645 INFO L125 PetriNetUnfolderBase]: For 220173/220173 co-relation queries the response was YES. [2024-02-19 15:09:17,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492282 conditions, 20771 events. 13818/20771 cut-off events. For 220173/220173 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 132397 event pairs, 74 based on Foata normal form. 2/18272 useless extension candidates. Maximal degree in co-relation 312382. Up to 19080 conditions per place. [2024-02-19 15:09:17,984 INFO L140 encePairwiseOnDemand]: 15/31 looper letters, 5648 selfloop transitions, 1985 changer transitions 79/7713 dead transitions. [2024-02-19 15:09:17,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 7713 transitions, 377380 flow [2024-02-19 15:09:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-02-19 15:09:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2024-02-19 15:09:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 868 transitions. [2024-02-19 15:09:17,986 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-02-19 15:09:17,986 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 431 predicate places. [2024-02-19 15:09:17,987 INFO L507 AbstractCegarLoop]: Abstraction has has 464 places, 7713 transitions, 377380 flow [2024-02-19 15:09:17,987 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.1) internal successors, (244), 40 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:09:17,987 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:17,987 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:17,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-02-19 15:09:18,199 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-02-19 15:09:18,199 INFO L432 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:09:18,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:18,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2105048450, now seen corresponding path program 3 times [2024-02-19 15:09:18,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:09:18,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635792668] [2024-02-19 15:09:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:18,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:09:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:09:19,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:09:19,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635792668] [2024-02-19 15:09:19,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635792668] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:09:19,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777658167] [2024-02-19 15:09:19,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:09:19,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:19,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:09:19,602 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:09:19,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-02-19 15:09:19,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-19 15:09:19,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:09:19,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 56 conjunts are in the unsatisfiable core [2024-02-19 15:09:19,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:19,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:09:20,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:09:20,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 104 [2024-02-19 15:09:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:09:21,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:09:35,108 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-02-19 15:09:35,109 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-02-19 15:09:35,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-02-19 15:09:35,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-02-19 15:09:35,318 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:35,318 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/UAutomizer-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.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) 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:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:443) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:378) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:527) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) ... 52 more [2024-02-19 15:09:35,323 INFO L158 Benchmark]: Toolchain (without parser) took 402393.71ms. Allocated memory was 67.1MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 42.9MB in the beginning and 4.0GB in the end (delta: -4.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2024-02-19 15:09:35,323 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 67.1MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-19 15:09:35,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.30ms. Allocated memory is still 67.1MB. Free memory was 42.7MB in the beginning and 30.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-02-19 15:09:35,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.98ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 30.2MB in the beginning and 74.7MB in the end (delta: -44.6MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-02-19 15:09:35,324 INFO L158 Benchmark]: Boogie Preprocessor took 77.05ms. Allocated memory is still 96.5MB. Free memory was 74.7MB in the beginning and 71.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-19 15:09:35,324 INFO L158 Benchmark]: RCFGBuilder took 723.17ms. Allocated memory is still 96.5MB. Free memory was 71.8MB in the beginning and 56.4MB in the end (delta: 15.5MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2024-02-19 15:09:35,324 INFO L158 Benchmark]: TraceAbstraction took 401297.18ms. Allocated memory was 96.5MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 55.4MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2024-02-19 15:09:35,325 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.19ms. Allocated memory is still 67.1MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.30ms. Allocated memory is still 67.1MB. Free memory was 42.7MB in the beginning and 30.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.98ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 30.2MB in the beginning and 74.7MB in the end (delta: -44.6MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.05ms. Allocated memory is still 96.5MB. Free memory was 74.7MB in the beginning and 71.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 723.17ms. Allocated memory is still 96.5MB. Free memory was 71.8MB in the beginning and 56.4MB in the end (delta: 15.5MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. * TraceAbstraction took 401297.18ms. Allocated memory was 96.5MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 55.4MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-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/UAutomizer-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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d38eb9d6ba70070fe3ced1aec90f1c3400cc1f89786e1bd625a19020cb0869f --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 15:09:37,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:09:37,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-02-19 15:09:37,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:09:37,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:09:37,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:09:37,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:09:37,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:09:37,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:09:37,636 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:09:37,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:09:37,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:09:37,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:09:37,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:09:37,638 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:09:37,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:09:37,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:09:37,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:09:37,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:09:37,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:09:37,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:09:37,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:09:37,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:09:37,639 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-02-19 15:09:37,639 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-02-19 15:09:37,640 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:09:37,640 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-02-19 15:09:37,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:09:37,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:09:37,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:09:37,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:09:37,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:09:37,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:09:37,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:09:37,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:09:37,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:09:37,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:09:37,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:09:37,642 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-02-19 15:09:37,642 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-02-19 15:09:37,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:09:37,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:09:37,643 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:09:37,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:09:37,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:09:37,643 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-02-19 15:09:37,643 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 -> Automizer 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 -> 9d38eb9d6ba70070fe3ced1aec90f1c3400cc1f89786e1bd625a19020cb0869f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:09:37,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:09:37,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:09:37,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:09:37,962 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:09:37,963 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:09:37,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2024-02-19 15:09:39,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:09:39,272 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:09:39,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2024-02-19 15:09:39,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4fe2df4/076fc017a8b84709a3e3214763498726/FLAGafff0896a [2024-02-19 15:09:39,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4fe2df4/076fc017a8b84709a3e3214763498726 [2024-02-19 15:09:39,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:09:39,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:09:39,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:09:39,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:09:39,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:09:39,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:09:39" (1/1) ... [2024-02-19 15:09:39,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f6e802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39, skipping insertion in model container [2024-02-19 15:09:39,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:09:39" (1/1) ... [2024-02-19 15:09:39,325 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:09:39,486 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c[2533,2546] [2024-02-19 15:09:39,505 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:09:39,517 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-02-19 15:09:39,522 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:09:39,545 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c[2533,2546] [2024-02-19 15:09:39,554 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:09:39,558 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:09:39,587 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c[2533,2546] [2024-02-19 15:09:39,592 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:09:39,608 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:09:39,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39 WrapperNode [2024-02-19 15:09:39,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:09:39,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:09:39,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:09:39,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:09:39,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39" (1/1) ... [2024-02-19 15:09:39,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39" (1/1) ... [2024-02-19 15:09:39,655 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 224 [2024-02-19 15:09:39,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:09:39,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:09:39,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:09:39,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:09:39,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39" (1/1) ... [2024-02-19 15:09:39,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39" (1/1) ... [2024-02-19 15:09:39,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39" (1/1) ... [2024-02-19 15:09:39,686 INFO L175 MemorySlicer]: Split 16 memory accesses to 5 slices as follows [2, 2, 8, 2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-02-19 15:09:39,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39" (1/1) ... [2024-02-19 15:09:39,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39" (1/1) ... [2024-02-19 15:09:39,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39" (1/1) ... [2024-02-19 15:09:39,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39" (1/1) ... [2024-02-19 15:09:39,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39" (1/1) ... [2024-02-19 15:09:39,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39" (1/1) ... [2024-02-19 15:09:39,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:09:39,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:09:39,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:09:39,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:09:39,724 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39" (1/1) ... [2024-02-19 15:09:39,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:09:39,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:09:39,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 15:09:39,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 15:09:39,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:09:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-02-19 15:09:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-02-19 15:09:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-02-19 15:09:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-02-19 15:09:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-02-19 15:09:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:09:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-02-19 15:09:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-02-19 15:09:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-02-19 15:09:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-02-19 15:09:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-02-19 15:09:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:09:39,791 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:09:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:09:39,792 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:09:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 15:09:39,792 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 15:09:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 15:09:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 15:09:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:09:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:09:39,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:09:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:09:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-02-19 15:09:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-02-19 15:09:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-02-19 15:09:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-02-19 15:09:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-02-19 15:09:39,794 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 15:09:39,884 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:09:39,886 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:09:40,210 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:09:40,210 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:09:40,514 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:09:40,514 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-19 15:09:40,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:09:40 BoogieIcfgContainer [2024-02-19 15:09:40,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:09:40,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:09:40,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:09:40,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:09:40,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:09:39" (1/3) ... [2024-02-19 15:09:40,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a18731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:09:40, skipping insertion in model container [2024-02-19 15:09:40,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:39" (2/3) ... [2024-02-19 15:09:40,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a18731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:09:40, skipping insertion in model container [2024-02-19 15:09:40,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:09:40" (3/3) ... [2024-02-19 15:09:40,522 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2024-02-19 15:09:40,536 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:09:40,536 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:09:40,536 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:09:40,579 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-19 15:09:40,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 83 flow [2024-02-19 15:09:40,654 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-02-19 15:09:40,654 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:09:40,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 4/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2024-02-19 15:09:40,659 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 31 transitions, 83 flow [2024-02-19 15:09:40,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 27 transitions, 72 flow [2024-02-19 15:09:40,673 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:09:40,678 INFO L369 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@51dbc787, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:09:40,679 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 15:09:40,689 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:09:40,690 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-02-19 15:09:40,690 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:09:40,690 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:40,691 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:40,691 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:09:40,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash 613076083, now seen corresponding path program 1 times [2024-02-19 15:09:40,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:09:40,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273372268] [2024-02-19 15:09:40,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:40,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:09:40,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:09:40,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:09:40,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-02-19 15:09:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:40,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-19 15:09:40,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:09:41,099 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:09:41,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:09:41,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273372268] [2024-02-19 15:09:41,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273372268] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:09:41,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:09:41,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:09:41,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174615903] [2024-02-19 15:09:41,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:09:41,120 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:09:41,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:09:41,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:09:41,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:09:41,158 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-02-19 15:09:41,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:09:41,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:09:41,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-02-19 15:09:41,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:09:41,339 INFO L124 PetriNetUnfolderBase]: 433/638 cut-off events. [2024-02-19 15:09:41,339 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-02-19 15:09:41,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 638 events. 433/638 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2300 event pairs, 41 based on Foata normal form. 1/473 useless extension candidates. Maximal degree in co-relation 975. Up to 520 conditions per place. [2024-02-19 15:09:41,344 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 33 selfloop transitions, 4 changer transitions 1/43 dead transitions. [2024-02-19 15:09:41,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 195 flow [2024-02-19 15:09:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:09:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:09:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2024-02-19 15:09:41,353 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2024-02-19 15:09:41,355 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2024-02-19 15:09:41,355 INFO L507 AbstractCegarLoop]: Abstraction has has 35 places, 43 transitions, 195 flow [2024-02-19 15:09:41,356 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:09:41,356 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:41,356 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:41,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-02-19 15:09:41,561 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:09:41,562 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:09:41,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:41,563 INFO L85 PathProgramCache]: Analyzing trace with hash -131925009, now seen corresponding path program 1 times [2024-02-19 15:09:41,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:09:41,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879414594] [2024-02-19 15:09:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:41,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:09:41,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:09:41,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:09:41,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-02-19 15:09:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:41,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 15:09:41,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:09:41,730 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:09:41,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:09:41,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879414594] [2024-02-19 15:09:41,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879414594] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:09:41,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:09:41,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:09:41,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987973932] [2024-02-19 15:09:41,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:09:41,732 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:09:41,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:09:41,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:09:41,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:09:41,738 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-02-19 15:09:41,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 43 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:09:41,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:09:41,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-02-19 15:09:41,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:09:41,957 INFO L124 PetriNetUnfolderBase]: 460/664 cut-off events. [2024-02-19 15:09:41,958 INFO L125 PetriNetUnfolderBase]: For 162/190 co-relation queries the response was YES. [2024-02-19 15:09:41,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 664 events. 460/664 cut-off events. For 162/190 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2516 event pairs, 57 based on Foata normal form. 2/528 useless extension candidates. Maximal degree in co-relation 1825. Up to 557 conditions per place. [2024-02-19 15:09:41,962 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 46 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-02-19 15:09:41,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 55 transitions, 345 flow [2024-02-19 15:09:41,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:09:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:09:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2024-02-19 15:09:41,964 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-02-19 15:09:41,964 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2024-02-19 15:09:41,964 INFO L507 AbstractCegarLoop]: Abstraction has has 39 places, 55 transitions, 345 flow [2024-02-19 15:09:41,965 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:09:41,965 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:41,965 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:41,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-02-19 15:09:42,168 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:09:42,168 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:09:42,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:42,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2044008234, now seen corresponding path program 1 times [2024-02-19 15:09:42,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:09:42,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361638726] [2024-02-19 15:09:42,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:42,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:09:42,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:09:42,185 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:09:42,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-02-19 15:09:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:42,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:09:42,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:09:42,399 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:09:42,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:09:42,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361638726] [2024-02-19 15:09:42,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361638726] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:09:42,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:09:42,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:09:42,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411768921] [2024-02-19 15:09:42,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:09:42,401 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:09:42,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:09:42,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:09:42,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:09:42,412 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-02-19 15:09:42,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 55 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:09:42,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:09:42,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-02-19 15:09:42,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:09:42,706 INFO L124 PetriNetUnfolderBase]: 594/881 cut-off events. [2024-02-19 15:09:42,707 INFO L125 PetriNetUnfolderBase]: For 694/698 co-relation queries the response was YES. [2024-02-19 15:09:42,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 881 events. 594/881 cut-off events. For 694/698 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3490 event pairs, 69 based on Foata normal form. 47/744 useless extension candidates. Maximal degree in co-relation 3107. Up to 726 conditions per place. [2024-02-19 15:09:42,713 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 68 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2024-02-19 15:09:42,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 77 transitions, 629 flow [2024-02-19 15:09:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:09:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:09:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2024-02-19 15:09:42,716 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-02-19 15:09:42,717 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2024-02-19 15:09:42,717 INFO L507 AbstractCegarLoop]: Abstraction has has 43 places, 77 transitions, 629 flow [2024-02-19 15:09:42,717 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:09:42,718 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:42,718 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:42,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-02-19 15:09:42,924 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:09:42,924 INFO L432 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)] === [2024-02-19 15:09:42,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:42,925 INFO L85 PathProgramCache]: Analyzing trace with hash -590914213, now seen corresponding path program 1 times [2024-02-19 15:09:42,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:09:42,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670040325] [2024-02-19 15:09:42,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:42,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:09:42,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:09:42,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:09:42,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-02-19 15:09:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:43,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:09:43,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:43,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:09:43,087 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:09:43,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:09:43,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670040325] [2024-02-19 15:09:43,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670040325] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:09:43,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:09:43,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:09:43,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740007341] [2024-02-19 15:09:43,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:09:43,088 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:09:43,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:09:43,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:09:43,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:09:43,104 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-02-19 15:09:43,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 77 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:09:43,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:09:43,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-02-19 15:09:43,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:09:43,280 INFO L124 PetriNetUnfolderBase]: 594/882 cut-off events. [2024-02-19 15:09:43,280 INFO L125 PetriNetUnfolderBase]: For 1278/1292 co-relation queries the response was YES. [2024-02-19 15:09:43,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4079 conditions, 882 events. 594/882 cut-off events. For 1278/1292 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3505 event pairs, 69 based on Foata normal form. 4/701 useless extension candidates. Maximal degree in co-relation 3828. Up to 764 conditions per place. [2024-02-19 15:09:43,288 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 71 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-02-19 15:09:43,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 78 transitions, 783 flow [2024-02-19 15:09:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:09:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:09:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-02-19 15:09:43,289 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-02-19 15:09:43,290 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2024-02-19 15:09:43,290 INFO L507 AbstractCegarLoop]: Abstraction has has 45 places, 78 transitions, 783 flow [2024-02-19 15:09:43,290 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:09:43,290 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:43,291 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:43,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-02-19 15:09:43,494 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:09:43,495 INFO L432 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)] === [2024-02-19 15:09:43,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:43,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1458776755, now seen corresponding path program 1 times [2024-02-19 15:09:43,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:09:43,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857695544] [2024-02-19 15:09:43,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:43,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:09:43,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:09:43,503 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:09:43,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-02-19 15:09:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:43,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 25 conjunts are in the unsatisfiable core [2024-02-19 15:09:43,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:44,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:44,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:44,313 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 15:09:44,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:44,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:44,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:44,317 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 15:09:44,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:44,318 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 15:09:44,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 15:09:44,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:09:44,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 246 treesize of output 90 [2024-02-19 15:09:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:09:44,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:09:45,284 INFO L349 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2024-02-19 15:09:45,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 675 treesize of output 233 [2024-02-19 15:10:03,275 WARN L293 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 569 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 15:10:32,649 WARN L293 SmtUtils]: Spent 7.03s on a formula simplification that was a NOOP. DAG size: 567 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 15:11:47,480 WARN L293 SmtUtils]: Spent 8.75s on a formula simplification that was a NOOP. DAG size: 581 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 15:12:12,193 WARN L293 SmtUtils]: Spent 10.63s on a formula simplification that was a NOOP. DAG size: 585 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 15:12:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:12:12,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:12:12,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857695544] [2024-02-19 15:12:12,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857695544] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:12:12,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:12:12,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2024-02-19 15:12:12,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305097148] [2024-02-19 15:12:12,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:12:12,212 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-19 15:12:12,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:12:12,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-19 15:12:12,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=213, Unknown=2, NotChecked=0, Total=272 [2024-02-19 15:12:14,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:12:16,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:12:18,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:12:19,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:12:21,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:12:24,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:12:29,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:12:29,975 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:12:29,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 78 transitions, 783 flow. Second operand has 17 states, 17 states have (on average 7.823529411764706) internal successors, (133), 17 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:12:29,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:12:29,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:12:29,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:12:48,968 WARN L293 SmtUtils]: Spent 11.81s on a formula simplification. DAG size of input: 598 DAG size of output: 250 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 15:12:50,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:12:53,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:13:08,436 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 596 DAG size of output: 247 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 15:13:12,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:13:14,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:13:18,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:13:26,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:13:29,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:13:31,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:13:33,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:13:35,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:13:45,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:13:49,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:13:54,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:13:56,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:14:00,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:14:05,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:14:07,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:14:10,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:11,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:13,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:15,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:18,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:21,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:26,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:29,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:33,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:36,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:39,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:40,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:42,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:43,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:45,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:46,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:48,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:14:52,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:14:52,156 INFO L124 PetriNetUnfolderBase]: 1131/1620 cut-off events. [2024-02-19 15:14:52,157 INFO L125 PetriNetUnfolderBase]: For 3215/3219 co-relation queries the response was YES. [2024-02-19 15:14:52,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8947 conditions, 1620 events. 1131/1620 cut-off events. For 3215/3219 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6840 event pairs, 38 based on Foata normal form. 3/1273 useless extension candidates. Maximal degree in co-relation 6949. Up to 1359 conditions per place. [2024-02-19 15:14:52,169 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 133 selfloop transitions, 35 changer transitions 1/171 dead transitions. [2024-02-19 15:14:52,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 171 transitions, 2029 flow [2024-02-19 15:14:52,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:14:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:14:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-02-19 15:14:52,173 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-02-19 15:14:52,173 INFO L308 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2024-02-19 15:14:52,174 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 171 transitions, 2029 flow [2024-02-19 15:14:52,174 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.823529411764706) internal successors, (133), 17 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:14:52,174 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:14:52,174 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:14:52,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-02-19 15:14:52,379 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:14:52,379 INFO L432 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)] === [2024-02-19 15:14:52,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:14:52,380 INFO L85 PathProgramCache]: Analyzing trace with hash 326114499, now seen corresponding path program 2 times [2024-02-19 15:14:52,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:14:52,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992953913] [2024-02-19 15:14:52,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:14:52,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:14:52,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:14:52,382 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:14:52,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-02-19 15:14:52,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:14:52,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:14:52,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 24 conjunts are in the unsatisfiable core [2024-02-19 15:14:52,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:14:56,507 INFO L349 Elim1Store]: treesize reduction 480, result has 14.4 percent of original size [2024-02-19 15:14:56,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 6 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 297 treesize of output 179 [2024-02-19 15:14:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:14:59,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:15:01,375 INFO L349 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2024-02-19 15:15:01,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 632 treesize of output 225 [2024-02-19 15:15:34,179 WARN L293 SmtUtils]: Spent 8.87s on a formula simplification that was a NOOP. DAG size: 611 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 15:16:18,201 WARN L293 SmtUtils]: Spent 9.28s on a formula simplification that was a NOOP. DAG size: 609 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 15:16:40,167 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse72 (= (bvmul (_ bv4 32) c_~M~0) (_ bv0 32))) (.cse274 (= (bvadd c_~mts2~0 c_~sum~0) c_~mts1~0)) (.cse127 (= c_~mts3~0 c_~mts1~0))) (and (or (and (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse0 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse2 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse1 (bvadd .cse0 c_~mts2~0 c_~sum~0))) (or (not (bvslt (bvadd .cse0 c_~mts3~0) (_ bv0 32))) (not (bvslt (_ bv0 32) .cse1)) (bvslt .cse2 (_ bv0 32)) (= .cse2 .cse1))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse3 (bvadd (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_31) c_~mts3~0))) (or (bvslt .cse3 (_ bv0 32)) (= .cse3 (_ bv0 32)) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse5 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse6 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse4 (bvadd .cse5 c_~mts3~0))) (or (bvslt .cse4 (bvadd .cse5 c_~mts2~0 c_~sum~0)) (bvslt .cse4 (_ bv0 32)) (bvslt .cse6 (_ bv0 32)) (= .cse6 .cse4))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse9 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_35))) (let ((.cse8 (bvadd .cse9 c_~mts2~0 c_~sum~0))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse7 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (bvslt .cse7 (_ bv0 32)) (= .cse7 .cse8)))) (not (bvslt (_ bv0 32) .cse8)) (not (bvslt (bvadd c_~mts3~0 .cse9) (_ bv0 32))))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse12 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_35))) (let ((.cse10 (bvadd c_~mts3~0 .cse12))) (or (bvslt .cse10 (_ bv0 32)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse11 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse11 .cse10) (bvslt .cse11 (_ bv0 32)) (= .cse11 (bvadd .cse12 c_~mts2~0 c_~sum~0))))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse14 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse13 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_31))) (or (not (bvslt (bvadd .cse13 c_~mts3~0) (_ bv0 32))) (bvslt .cse14 (_ bv0 32)) (= .cse14 (_ bv0 32)) (= .cse14 (bvadd .cse13 c_~mts2~0 c_~sum~0))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse18 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse15 (bvadd .cse18 c_~mts3~0)) (.cse17 (bvadd .cse18 c_~mts2~0 c_~sum~0))) (or (bvslt .cse15 (_ bv0 32)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse16 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse16 .cse17) (bvslt .cse16 (_ bv0 32))))) (not (bvslt .cse15 .cse17)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse19 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (or (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (not (bvslt (_ bv0 32) (bvadd .cse19 c_~mts2~0 c_~sum~0))) (not (bvslt (bvadd .cse19 c_~mts3~0) (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse23 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse20 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse22 (bvadd .cse23 c_~mts3~0)) (.cse21 (bvadd .cse23 c_~mts2~0 c_~sum~0))) (or (bvslt .cse20 (_ bv0 32)) (= .cse20 .cse21) (bvslt .cse22 (_ bv0 32)) (not (bvslt .cse22 .cse21)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (or (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse24 (bvadd (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_35) c_~mts3~0))) (or (bvslt .cse24 (_ bv0 32)) (= .cse24 (_ bv0 32))))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse27 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_35))) (let ((.cse26 (bvadd c_~mts3~0 .cse27))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse25 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse25 .cse26) (bvslt .cse25 (_ bv0 32))))) (bvslt .cse26 (_ bv0 32)) (bvslt .cse26 (bvadd .cse27 c_~mts2~0 c_~sum~0)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse29 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse28 (bvadd .cse29 c_~mts2~0 c_~sum~0))) (or (not (bvslt (_ bv0 32) .cse28)) (not (bvslt (bvadd .cse29 c_~mts3~0) (_ bv0 32))) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse30 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse30 .cse28) (bvslt .cse30 (_ bv0 32))))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse33 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse32 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse31 (bvadd .cse33 c_~mts3~0))) (or (bvslt .cse31 (_ bv0 32)) (bvslt .cse32 (_ bv0 32)) (= .cse32 (bvadd .cse33 c_~mts2~0 c_~sum~0)) (= .cse32 .cse31))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse34 (bvadd (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31) c_~mts3~0))) (or (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (= .cse34 (_ bv0 32)) (bvslt .cse34 (_ bv0 32))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse35 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_35))) (or (not (bvslt (bvadd .cse35 c_~mts3~0) (_ bv0 32))) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse36 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse36 (bvadd .cse35 c_~mts2~0 c_~sum~0)) (bvslt .cse36 (_ bv0 32)) (= .cse36 (_ bv0 32)))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse37 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_31))) (or (not (bvslt (bvadd .cse37 c_~mts3~0) (_ bv0 32))) (not (bvslt (_ bv0 32) (bvadd .cse37 c_~mts2~0 c_~sum~0))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32)))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse41 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_35))) (let ((.cse39 (bvadd .cse41 c_~mts2~0 c_~sum~0)) (.cse40 (bvadd c_~mts3~0 .cse41))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse38 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (bvslt .cse38 (_ bv0 32)) (= .cse38 .cse39)))) (not (bvslt .cse40 .cse39)) (bvslt .cse40 (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse42 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (or (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (bvslt (bvadd .cse42 c_~mts3~0) (_ bv0 32)) (not (bvslt (_ bv0 32) (bvadd .cse42 c_~mts2~0 c_~sum~0)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse45 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse43 (bvadd .cse45 c_~mts3~0))) (or (bvslt .cse43 (_ bv0 32)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse44 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse44 (bvadd .cse45 c_~mts2~0 c_~sum~0)) (bvslt .cse44 (_ bv0 32)) (= .cse43 .cse44)))))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse47 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse48 (bvadd .cse47 c_~mts3~0)) (.cse46 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (bvslt .cse46 (_ bv0 32)) (= .cse46 (bvadd .cse47 c_~mts2~0 c_~sum~0)) (bvslt .cse48 (_ bv0 32)) (= .cse48 .cse46))))) (forall ((v_arrayElimCell_30 (_ BitVec 8))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32)))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse49 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_35))) (or (not (bvslt (_ bv0 32) (bvadd .cse49 c_~mts2~0 c_~sum~0))) (not (bvslt (bvadd .cse49 c_~mts3~0) (_ bv0 32)))))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (or (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse50 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_35))) (or (not (bvslt (_ bv0 32) (bvadd .cse50 c_~mts2~0 c_~sum~0))) (bvslt (bvadd .cse50 c_~mts3~0) (_ bv0 32))))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32)))) (forall ((v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse51 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_35))) (or (not (bvslt (_ bv0 32) (bvadd .cse51 c_~mts2~0 c_~sum~0))) (not (bvslt (bvadd c_~mts3~0 .cse51) (_ bv0 32)))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse55 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse52 (bvadd .cse55 c_~mts3~0)) (.cse53 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse54 (bvadd .cse55 c_~mts2~0 c_~sum~0))) (or (bvslt .cse52 (_ bv0 32)) (bvslt .cse53 (_ bv0 32)) (not (bvslt .cse52 .cse54)) (= .cse53 .cse54))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (or (forall ((v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse56 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_35))) (or (bvslt (bvadd c_~mts3~0 .cse56) (_ bv0 32)) (not (bvslt (_ bv0 32) (bvadd .cse56 c_~mts2~0 c_~sum~0)))))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (or (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (forall ((v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse57 (bvadd c_~mts3~0 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_35)))) (or (bvslt .cse57 (_ bv0 32)) (= .cse57 (_ bv0 32))))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse58 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse59 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (or (bvslt .cse58 (_ bv0 32)) (= .cse58 (_ bv0 32)) (= .cse58 (bvadd .cse59 c_~mts2~0 c_~sum~0)) (not (bvslt (bvadd .cse59 c_~mts3~0) (_ bv0 32)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse60 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_31))) (or (bvslt (bvadd .cse60 c_~mts3~0) (_ bv0 32)) (not (bvslt (_ bv0 32) (bvadd .cse60 c_~mts2~0 c_~sum~0))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse63 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse61 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse62 (bvadd .cse63 c_~mts2~0 c_~sum~0))) (or (bvslt .cse61 (_ bv0 32)) (= .cse61 .cse62) (not (bvslt (_ bv0 32) .cse62)) (not (bvslt (bvadd .cse63 c_~mts3~0) (_ bv0 32))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse65 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse64 (bvadd .cse65 c_~mts3~0))) (or (bvslt .cse64 (_ bv0 32)) (bvslt .cse64 (bvadd .cse65 c_~mts2~0 c_~sum~0)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse66 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (bvslt .cse66 (_ bv0 32)) (= .cse64 .cse66)))))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse68 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_35))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse67 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (bvslt .cse67 (_ bv0 32)) (= .cse67 (_ bv0 32)) (= .cse67 (bvadd .cse68 c_~mts2~0 c_~sum~0))))) (not (bvslt (bvadd c_~mts3~0 .cse68) (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse70 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse69 (bvadd .cse70 c_~mts3~0)) (.cse71 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (bvslt .cse69 (bvadd .cse70 c_~mts2~0 c_~sum~0)) (bvslt .cse71 (_ bv0 32)) (bvslt .cse69 (_ bv0 32)) (= .cse69 .cse71)))))) .cse72) (or .cse72 (and (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse75 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (let ((.cse74 (concat (concat .cse75 v_arrayElimCell_32) v_arrayElimCell_35))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse73 (bvadd c_~mts1~0 (concat (concat .cse75 v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse73 (bvadd .cse74 c_~mts2~0 c_~sum~0)) (bvslt .cse73 (_ bv0 32)) (= .cse73 (_ bv0 32))))) (not (bvslt (bvadd .cse74 c_~mts3~0) (_ bv0 32))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse79 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (let ((.cse77 (concat (concat .cse79 v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse76 (bvadd c_~mts2~0 c_~sum~0 .cse77)) (.cse78 (bvadd c_~mts1~0 (concat (concat .cse79 v_arrayElimCell_34) v_arrayElimCell_31)))) (or (not (bvslt (_ bv0 32) .cse76)) (not (bvslt (bvadd c_~mts3~0 .cse77) (_ bv0 32))) (bvslt .cse78 (_ bv0 32)) (= .cse76 .cse78)))))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse81 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (or (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse80 (concat (concat .cse81 v_arrayElimCell_32) v_arrayElimCell_35))) (or (not (bvslt (_ bv0 32) (bvadd .cse80 c_~mts2~0 c_~sum~0))) (not (bvslt (bvadd .cse80 c_~mts3~0) (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8))) (not (bvslt (bvadd c_~mts1~0 (concat (concat .cse81 v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse85 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (let ((.cse83 (concat (concat .cse85 v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse84 (bvadd c_~mts1~0 (concat (concat .cse85 v_arrayElimCell_34) v_arrayElimCell_31))) (.cse82 (bvadd c_~mts3~0 .cse83))) (or (bvslt .cse82 (bvadd c_~mts2~0 c_~sum~0 .cse83)) (= .cse82 .cse84) (bvslt .cse84 (_ bv0 32)) (bvslt .cse82 (_ bv0 32))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse88 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (let ((.cse89 (concat (concat .cse88 v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse87 (bvadd .cse89 c_~mts3~0))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse86 (bvadd c_~mts1~0 (concat (concat .cse88 v_arrayElimCell_34) v_arrayElimCell_31)))) (or (bvslt .cse86 (_ bv0 32)) (= .cse86 .cse87)))) (bvslt .cse87 (bvadd .cse89 c_~mts2~0 c_~sum~0)) (bvslt .cse87 (_ bv0 32))))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse90 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (or (not (bvslt (bvadd c_~mts1~0 (concat (concat .cse90 v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse91 (bvadd (concat (concat .cse90 v_arrayElimCell_32) v_arrayElimCell_35) c_~mts3~0))) (or (= .cse91 (_ bv0 32)) (bvslt .cse91 (_ bv0 32)))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse94 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (let ((.cse96 (concat (concat .cse94 v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse95 (bvadd .cse96 c_~mts3~0)) (.cse93 (bvadd .cse96 c_~mts2~0 c_~sum~0))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse92 (bvadd c_~mts1~0 (concat (concat .cse94 v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse92 .cse93) (bvslt .cse92 (_ bv0 32))))) (bvslt .cse95 (_ bv0 32)) (not (bvslt .cse95 .cse93))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse100 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (let ((.cse98 (concat (concat .cse100 v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse99 (bvadd .cse98 c_~mts3~0))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse97 (bvadd c_~mts1~0 (concat (concat .cse100 v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse97 (bvadd .cse98 c_~mts2~0 c_~sum~0)) (bvslt .cse97 (_ bv0 32)) (= .cse97 .cse99)))) (bvslt .cse99 (_ bv0 32))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse102 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (let ((.cse101 (bvadd c_~mts3~0 (concat (concat .cse102 v_arrayElimCell_32) v_arrayElimCell_31)))) (or (= .cse101 (_ bv0 32)) (not (bvslt (bvadd c_~mts1~0 (concat (concat .cse102 v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (bvslt .cse101 (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse103 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (or (not (bvslt (bvadd c_~mts1~0 (concat (concat .cse103 v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse104 (concat (concat .cse103 v_arrayElimCell_32) v_arrayElimCell_35))) (or (not (bvslt (_ bv0 32) (bvadd .cse104 c_~mts2~0 c_~sum~0))) (bvslt (bvadd .cse104 c_~mts3~0) (_ bv0 32)))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse107 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (let ((.cse108 (concat (concat .cse107 v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse105 (bvadd .cse108 c_~mts2~0 c_~sum~0))) (or (not (bvslt (_ bv0 32) .cse105)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse106 (bvadd c_~mts1~0 (concat (concat .cse107 v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse106 .cse105) (bvslt .cse106 (_ bv0 32))))) (not (bvslt (bvadd .cse108 c_~mts3~0) (_ bv0 32)))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse110 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (let ((.cse109 (concat (concat .cse110 v_arrayElimCell_32) v_arrayElimCell_31))) (or (not (bvslt (_ bv0 32) (bvadd c_~mts2~0 c_~sum~0 .cse109))) (not (bvslt (bvadd c_~mts1~0 (concat (concat .cse110 v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (bvslt (bvadd c_~mts3~0 .cse109) (_ bv0 32)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse115 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (let ((.cse114 (concat (concat .cse115 v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse111 (bvadd c_~mts1~0 (concat (concat .cse115 v_arrayElimCell_34) v_arrayElimCell_31))) (.cse112 (bvadd c_~mts2~0 c_~sum~0 .cse114)) (.cse113 (bvadd c_~mts3~0 .cse114))) (or (bvslt .cse111 (_ bv0 32)) (= .cse112 .cse111) (not (bvslt .cse113 .cse112)) (bvslt .cse113 (_ bv0 32))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse117 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (let ((.cse116 (concat (concat .cse117 v_arrayElimCell_32) v_arrayElimCell_31))) (or (not (bvslt (_ bv0 32) (bvadd c_~mts2~0 c_~sum~0 .cse116))) (not (bvslt (bvadd c_~mts3~0 .cse116) (_ bv0 32))) (not (bvslt (bvadd c_~mts1~0 (concat (concat .cse117 v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse120 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (let ((.cse118 (concat (concat .cse120 v_arrayElimCell_32) v_arrayElimCell_31)) (.cse119 (bvadd c_~mts1~0 (concat (concat .cse120 v_arrayElimCell_34) v_arrayElimCell_31)))) (or (not (bvslt (bvadd c_~mts3~0 .cse118) (_ bv0 32))) (bvslt .cse119 (_ bv0 32)) (= .cse119 (_ bv0 32)) (= (bvadd c_~mts2~0 c_~sum~0 .cse118) .cse119))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse124 (concat v_arrayElimCell_36 v_arrayElimCell_30))) (let ((.cse123 (concat (concat .cse124 v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse122 (bvadd c_~mts1~0 (concat (concat .cse124 v_arrayElimCell_34) v_arrayElimCell_31))) (.cse121 (bvadd c_~mts3~0 .cse123))) (or (= .cse121 .cse122) (bvslt .cse122 (_ bv0 32)) (= (bvadd c_~mts2~0 c_~sum~0 .cse123) .cse122) (bvslt .cse121 (_ bv0 32))))))))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse126 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse125 (bvadd c_~mts3~0 .cse126))) (or (bvslt .cse125 (bvadd c_~mts2~0 .cse126 c_~sum~0)) (bvslt (bvadd c_~mts1~0 .cse126) (_ bv0 32)) (bvslt .cse125 (_ bv0 32)))))) .cse127) (or (let ((.cse160 (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32)))))) (and (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse130 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35))) (let ((.cse129 (bvadd .cse130 c_~mts2~0 c_~sum~0))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse128 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse128 .cse129) (bvslt .cse128 (_ bv0 32))))) (not (bvslt (bvadd .cse130 c_~mts3~0) (_ bv0 32))) (not (bvslt (_ bv0 32) .cse129)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (or (forall ((v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse131 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35))) (or (bvslt (bvadd .cse131 c_~mts3~0) (_ bv0 32)) (not (bvslt (_ bv0 32) (bvadd .cse131 c_~mts2~0 c_~sum~0)))))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse134 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse133 (bvadd .cse134 c_~mts3~0))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse132 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse132 .cse133) (bvslt .cse132 (_ bv0 32))))) (bvslt .cse133 (_ bv0 32)) (bvslt .cse133 (bvadd .cse134 c_~mts2~0 c_~sum~0)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse138 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse135 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse136 (bvadd c_~mts2~0 .cse138 c_~sum~0)) (.cse137 (bvadd c_~mts3~0 .cse138))) (or (= .cse135 .cse136) (bvslt .cse135 (_ bv0 32)) (not (bvslt .cse137 .cse136)) (bvslt .cse137 (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse139 (bvadd c_~mts3~0 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (bvslt .cse139 (_ bv0 32)) (= .cse139 (_ bv0 32)) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32)))))) (forall ((v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (or (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse140 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35))) (or (not (bvslt (_ bv0 32) (bvadd .cse140 c_~mts2~0 c_~sum~0))) (not (bvslt (bvadd .cse140 c_~mts3~0) (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse144 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse142 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse141 (bvadd c_~mts3~0 .cse144)) (.cse143 (bvadd c_~mts2~0 .cse144 c_~sum~0))) (or (bvslt .cse141 (_ bv0 32)) (bvslt .cse142 (_ bv0 32)) (= .cse143 .cse142) (not (bvslt .cse141 .cse143)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse148 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse145 (bvadd .cse148 c_~mts3~0)) (.cse146 (bvadd .cse148 c_~mts2~0 c_~sum~0))) (or (not (bvslt .cse145 .cse146)) (bvslt .cse145 (_ bv0 32)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse147 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (bvslt .cse147 (_ bv0 32)) (= .cse147 .cse146)))))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse150 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse149 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse149 (bvadd .cse150 c_~mts2~0 c_~sum~0)) (bvslt .cse149 (_ bv0 32)) (= .cse149 (_ bv0 32))))) (not (bvslt (bvadd .cse150 c_~mts3~0) (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (or (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse151 (bvadd (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35) c_~mts3~0))) (or (= .cse151 (_ bv0 32)) (bvslt .cse151 (_ bv0 32))))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse154 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse153 (bvadd .cse154 c_~mts3~0))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse152 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse152 .cse153) (bvslt .cse152 (_ bv0 32))))) (bvslt .cse153 (bvadd .cse154 c_~mts2~0 c_~sum~0)) (bvslt .cse153 (_ bv0 32)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse156 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse157 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse155 (bvadd c_~mts3~0 .cse156))) (or (bvslt .cse155 (bvadd c_~mts2~0 .cse156 c_~sum~0)) (= .cse157 .cse155) (bvslt .cse157 (_ bv0 32)) (bvslt .cse155 (_ bv0 32)))))) (or (and (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse158 (bvadd (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35) c_~mts3~0))) (or (= (_ bv0 32) .cse158) (bvslt .cse158 (_ bv0 32))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse159 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35))) (or (not (bvslt (_ bv0 32) (bvadd .cse159 c_~mts2~0 c_~sum~0))) (bvslt (bvadd .cse159 c_~mts3~0) (_ bv0 32)))))) .cse160) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse161 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31)) (.cse162 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (not (bvslt (bvadd .cse161 c_~mts3~0) (_ bv0 32))) (= .cse162 (bvadd .cse161 c_~mts2~0 c_~sum~0)) (bvslt .cse162 (_ bv0 32)) (= .cse162 (_ bv0 32))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse163 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31))) (or (bvslt (bvadd c_~mts3~0 .cse163) (_ bv0 32)) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (not (bvslt (_ bv0 32) (bvadd c_~mts2~0 .cse163 c_~sum~0)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (or (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (forall ((v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse164 (bvadd (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35) c_~mts3~0))) (or (bvslt .cse164 (_ bv0 32)) (= (_ bv0 32) .cse164)))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse168 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35))) (let ((.cse165 (bvadd .cse168 c_~mts3~0)) (.cse167 (bvadd .cse168 c_~mts2~0 c_~sum~0))) (or (bvslt .cse165 (_ bv0 32)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse166 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse166 .cse167) (bvslt .cse166 (_ bv0 32))))) (not (bvslt .cse165 .cse167)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse171 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse170 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse169 (bvadd c_~mts3~0 .cse171))) (or (bvslt .cse169 (_ bv0 32)) (bvslt .cse170 (_ bv0 32)) (= (bvadd c_~mts2~0 .cse171 c_~sum~0) .cse170) (= .cse170 .cse169))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse174 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse173 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse172 (bvadd c_~mts3~0 .cse174))) (or (bvslt .cse172 (_ bv0 32)) (bvslt .cse173 (_ bv0 32)) (bvslt .cse172 (bvadd c_~mts2~0 .cse174 c_~sum~0)) (= .cse173 .cse172))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse177 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse176 (bvadd .cse177 c_~mts3~0))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse175 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse175 .cse176) (bvslt .cse175 (_ bv0 32)) (= .cse175 (bvadd .cse177 c_~mts2~0 c_~sum~0))))) (bvslt .cse176 (_ bv0 32)))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse180 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35))) (let ((.cse179 (bvadd c_~mts3~0 .cse180))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse178 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse178 .cse179) (bvslt .cse178 (_ bv0 32)) (= .cse178 (bvadd c_~mts2~0 .cse180 c_~sum~0))))) (bvslt .cse179 (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse181 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31))) (or (not (bvslt (_ bv0 32) (bvadd .cse181 c_~mts2~0 c_~sum~0))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (bvslt (bvadd .cse181 c_~mts3~0) (_ bv0 32))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse182 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31))) (or (not (bvslt (_ bv0 32) (bvadd .cse182 c_~mts2~0 c_~sum~0))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (bvslt (bvadd .cse182 c_~mts3~0) (_ bv0 32))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (or (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse183 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35))) (or (not (bvslt (_ bv0 32) (bvadd .cse183 c_~mts2~0 c_~sum~0))) (bvslt (bvadd .cse183 c_~mts3~0) (_ bv0 32))))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse186 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse184 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse185 (bvadd .cse186 c_~mts3~0))) (or (= .cse184 .cse185) (bvslt .cse184 (_ bv0 32)) (= (bvadd .cse186 c_~mts2~0 c_~sum~0) .cse184) (bvslt .cse185 (_ bv0 32)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse189 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse187 (bvadd .cse189 c_~mts2~0 c_~sum~0))) (or (not (bvslt (_ bv0 32) .cse187)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse188 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse187 .cse188) (bvslt .cse188 (_ bv0 32))))) (not (bvslt (bvadd .cse189 c_~mts3~0) (_ bv0 32))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse192 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse190 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse191 (bvadd c_~mts2~0 .cse192 c_~sum~0))) (or (= .cse190 .cse191) (not (bvslt (bvadd c_~mts3~0 .cse192) (_ bv0 32))) (bvslt .cse190 (_ bv0 32)) (not (bvslt (_ bv0 32) .cse191)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse193 (bvadd c_~mts3~0 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31)))) (or (bvslt .cse193 (_ bv0 32)) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (= .cse193 (_ bv0 32))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse194 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35))) (or (not (bvslt (bvadd c_~mts3~0 .cse194) (_ bv0 32))) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse195 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (bvslt .cse195 (_ bv0 32)) (= .cse195 (_ bv0 32)) (= .cse195 (bvadd c_~mts2~0 .cse194 c_~sum~0)))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse198 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse196 (bvadd .cse198 c_~mts2~0 c_~sum~0)) (.cse197 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (not (bvslt (_ bv0 32) .cse196)) (bvslt .cse197 (_ bv0 32)) (= .cse196 .cse197) (not (bvslt (bvadd .cse198 c_~mts3~0) (_ bv0 32))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse202 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse200 (bvadd .cse202 c_~mts2~0 c_~sum~0)) (.cse201 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse199 (bvadd .cse202 c_~mts3~0))) (or (not (bvslt .cse199 .cse200)) (bvslt .cse201 (_ bv0 32)) (= .cse200 .cse201) (bvslt .cse199 (_ bv0 32)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse203 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse204 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= (bvadd .cse203 c_~mts2~0 c_~sum~0) .cse204) (bvslt .cse204 (_ bv0 32)) (= .cse204 (_ bv0 32))))) (not (bvslt (bvadd .cse203 c_~mts3~0) (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (or (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (forall ((v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse205 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35))) (or (bvslt (bvadd c_~mts3~0 .cse205) (_ bv0 32)) (not (bvslt (_ bv0 32) (bvadd c_~mts2~0 .cse205 c_~sum~0)))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse208 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse206 (bvadd .cse208 c_~mts3~0))) (or (bvslt .cse206 (_ bv0 32)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse207 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse207 .cse206) (= (bvadd .cse208 c_~mts2~0 c_~sum~0) .cse207) (bvslt .cse207 (_ bv0 32))))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse209 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse210 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31))) (or (bvslt .cse209 (_ bv0 32)) (= .cse209 (_ bv0 32)) (= (bvadd .cse210 c_~mts2~0 c_~sum~0) .cse209) (not (bvslt (bvadd .cse210 c_~mts3~0) (_ bv0 32)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse211 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31))) (or (not (bvslt (bvadd c_~mts3~0 .cse211) (_ bv0 32))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (not (bvslt (_ bv0 32) (bvadd c_~mts2~0 .cse211 c_~sum~0)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse212 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35))) (or (not (bvslt (bvadd .cse212 c_~mts3~0) (_ bv0 32))) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse213 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (bvslt .cse213 (_ bv0 32)) (= .cse213 (_ bv0 32)) (= .cse213 (bvadd .cse212 c_~mts2~0 c_~sum~0)))))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (or (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (forall ((v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse214 (bvadd c_~mts3~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35)))) (or (bvslt .cse214 (_ bv0 32)) (= .cse214 (_ bv0 32))))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse216 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35))) (let ((.cse215 (bvadd c_~mts3~0 .cse216))) (or (bvslt .cse215 (bvadd c_~mts2~0 .cse216 c_~sum~0)) (bvslt .cse215 (_ bv0 32)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse217 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse217 .cse215) (bvslt .cse217 (_ bv0 32))))))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse218 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31))) (or (not (bvslt (_ bv0 32) (bvadd .cse218 c_~mts2~0 c_~sum~0))) (not (bvslt (bvadd .cse218 c_~mts3~0) (_ bv0 32))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32)))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32)))) (forall ((v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse219 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35))) (or (not (bvslt (bvadd .cse219 c_~mts3~0) (_ bv0 32))) (not (bvslt (_ bv0 32) (bvadd .cse219 c_~mts2~0 c_~sum~0)))))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse220 (bvadd (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31) c_~mts3~0))) (or (= .cse220 (_ bv0 32)) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (bvslt .cse220 (_ bv0 32))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse223 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse221 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse222 (bvadd .cse223 c_~mts3~0))) (or (= .cse221 .cse222) (bvslt .cse221 (_ bv0 32)) (bvslt .cse222 (bvadd .cse223 c_~mts2~0 c_~sum~0)) (bvslt .cse222 (_ bv0 32)))))) (or (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse224 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35))) (or (not (bvslt (bvadd .cse224 c_~mts3~0) (_ bv0 32))) (not (bvslt (_ bv0 32) (bvadd .cse224 c_~mts2~0 c_~sum~0)))))) .cse160) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse226 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35))) (let ((.cse225 (bvadd .cse226 c_~mts3~0))) (or (bvslt .cse225 (bvadd .cse226 c_~mts2~0 c_~sum~0)) (bvslt .cse225 (_ bv0 32)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse227 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse227 .cse225) (bvslt .cse227 (_ bv0 32))))))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse228 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31))) (or (not (bvslt (_ bv0 32) (bvadd c_~mts2~0 .cse228 c_~sum~0))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (not (bvslt (bvadd c_~mts3~0 .cse228) (_ bv0 32)))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse231 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35))) (let ((.cse230 (bvadd c_~mts2~0 .cse231 c_~sum~0))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse229 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (bvslt .cse229 (_ bv0 32)) (= .cse229 .cse230)))) (not (bvslt (bvadd c_~mts3~0 .cse231) (_ bv0 32))) (not (bvslt (_ bv0 32) .cse230)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse233 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse232 (bvadd .cse233 c_~mts2~0 c_~sum~0)) (.cse234 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (not (bvslt (_ bv0 32) .cse232)) (not (bvslt (bvadd .cse233 c_~mts3~0) (_ bv0 32))) (= .cse234 .cse232) (bvslt .cse234 (_ bv0 32)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse235 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse236 (bvadd .cse235 c_~mts2~0 c_~sum~0))) (or (not (bvslt (bvadd .cse235 c_~mts3~0) (_ bv0 32))) (not (bvslt (_ bv0 32) .cse236)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse237 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (bvslt .cse237 (_ bv0 32)) (= .cse237 .cse236)))))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse238 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse239 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31))) (or (bvslt .cse238 (_ bv0 32)) (= (bvadd c_~mts2~0 .cse239 c_~sum~0) .cse238) (= .cse238 (_ bv0 32)) (not (bvslt (bvadd c_~mts3~0 .cse239) (_ bv0 32)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse240 (bvadd (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31) c_~mts3~0))) (or (= .cse240 (_ bv0 32)) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (bvslt .cse240 (_ bv0 32))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse241 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31))) (or (bvslt (bvadd c_~mts3~0 .cse241) (_ bv0 32)) (not (bvslt (_ bv0 32) (bvadd c_~mts2~0 .cse241 c_~sum~0))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse245 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_35))) (let ((.cse242 (bvadd .cse245 c_~mts3~0)) (.cse243 (bvadd .cse245 c_~mts2~0 c_~sum~0))) (or (bvslt .cse242 (_ bv0 32)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse244 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse243 .cse244) (bvslt .cse244 (_ bv0 32))))) (not (bvslt .cse242 .cse243)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse248 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse246 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse247 (bvadd .cse248 c_~mts3~0))) (or (bvslt .cse246 (_ bv0 32)) (bvslt .cse247 (_ bv0 32)) (bvslt .cse247 (bvadd .cse248 c_~mts2~0 c_~sum~0)) (= .cse246 .cse247))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse250 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse249 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse251 (bvadd .cse250 c_~mts3~0))) (or (= .cse249 (bvadd .cse250 c_~mts2~0 c_~sum~0)) (bvslt .cse249 (_ bv0 32)) (bvslt .cse251 (_ bv0 32)) (= .cse249 .cse251))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse253 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31)) (.cse252 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse252 (bvadd c_~mts2~0 .cse253 c_~sum~0)) (not (bvslt (bvadd c_~mts3~0 .cse253) (_ bv0 32))) (bvslt .cse252 (_ bv0 32)) (= .cse252 (_ bv0 32))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse255 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35))) (let ((.cse256 (bvadd .cse255 c_~mts3~0))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse254 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (= .cse254 (bvadd .cse255 c_~mts2~0 c_~sum~0)) (= .cse254 .cse256) (bvslt .cse254 (_ bv0 32))))) (bvslt .cse256 (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse259 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse257 (bvadd c_~mts2~0 .cse259 c_~sum~0)) (.cse258 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (not (bvslt (_ bv0 32) .cse257)) (bvslt .cse258 (_ bv0 32)) (= .cse257 .cse258) (not (bvslt (bvadd c_~mts3~0 .cse259) (_ bv0 32))))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse261 (concat (concat (concat v_arrayElimCell_29 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31))) (let ((.cse260 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse262 (bvadd c_~mts3~0 .cse261))) (or (= .cse260 (bvadd c_~mts2~0 .cse261 c_~sum~0)) (= .cse260 .cse262) (bvslt .cse260 (_ bv0 32)) (bvslt .cse262 (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse266 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse263 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (.cse264 (bvadd .cse266 c_~mts2~0 c_~sum~0)) (.cse265 (bvadd .cse266 c_~mts3~0))) (or (= .cse263 .cse264) (bvslt .cse263 (_ bv0 32)) (not (bvslt .cse265 .cse264)) (bvslt .cse265 (_ bv0 32)))))) (forall ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse267 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_32) v_arrayElimCell_31))) (or (not (bvslt (_ bv0 32) (bvadd .cse267 c_~mts2~0 c_~sum~0))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32))) (not (bvslt (bvadd .cse267 c_~mts3~0) (_ bv0 32)))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (not (bvslt (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)) (_ bv0 32)))) (forall ((v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse268 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35))) (or (not (bvslt (bvadd c_~mts3~0 .cse268) (_ bv0 32))) (not (bvslt (_ bv0 32) (bvadd c_~mts2~0 .cse268 c_~sum~0)))))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse272 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_33) v_arrayElimCell_34) v_arrayElimCell_35))) (let ((.cse271 (bvadd c_~mts3~0 .cse272)) (.cse270 (bvadd c_~mts2~0 .cse272 c_~sum~0))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse269 (bvadd c_~mts1~0 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31)))) (or (bvslt .cse269 (_ bv0 32)) (= .cse269 .cse270)))) (bvslt .cse271 (_ bv0 32)) (not (bvslt .cse271 .cse270)))))))) .cse72) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse273 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (or (not (bvslt (bvadd c_~mts1~0 .cse273) (_ bv0 32))) (bvslt (bvadd c_~mts3~0 .cse273) (_ bv0 32)) (not (bvslt (_ bv0 32) (bvadd c_~mts2~0 .cse273 c_~sum~0)))))) (or .cse274 (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse275 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (or (not (bvslt (bvadd c_~mts3~0 .cse275) (_ bv0 32))) (bvslt (bvadd c_~mts1~0 .cse275) (_ bv0 32)) (not (bvslt (_ bv0 32) (bvadd c_~mts2~0 .cse275 c_~sum~0))))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse276 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse277 (bvadd c_~mts3~0 .cse276))) (or (not (bvslt (bvadd c_~mts1~0 .cse276) (_ bv0 32))) (= .cse277 (_ bv0 32)) (bvslt .cse277 (_ bv0 32)))))) (or .cse72 (and (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse280 (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34))) (let ((.cse281 (concat .cse280 v_arrayElimCell_35))) (let ((.cse279 (bvadd .cse281 c_~mts3~0))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse278 (bvadd c_~mts1~0 (concat .cse280 v_arrayElimCell_31)))) (or (bvslt .cse278 (_ bv0 32)) (= .cse278 .cse279)))) (bvslt .cse279 (bvadd .cse281 c_~mts2~0 c_~sum~0)) (bvslt .cse279 (_ bv0 32))))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse282 (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34))) (or (not (bvslt (bvadd c_~mts1~0 (concat .cse282 v_arrayElimCell_31)) (_ bv0 32))) (forall ((v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse283 (bvadd (concat .cse282 v_arrayElimCell_35) c_~mts3~0))) (or (= .cse283 (_ bv0 32)) (bvslt .cse283 (_ bv0 32)))))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse287 (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34))) (let ((.cse288 (concat .cse287 v_arrayElimCell_35))) (let ((.cse284 (bvadd .cse288 c_~mts3~0)) (.cse286 (bvadd .cse288 c_~mts2~0 c_~sum~0))) (or (bvslt .cse284 (_ bv0 32)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse285 (bvadd c_~mts1~0 (concat .cse287 v_arrayElimCell_31)))) (or (bvslt .cse285 (_ bv0 32)) (= .cse285 .cse286)))) (not (bvslt .cse284 .cse286))))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse291 (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34))) (let ((.cse289 (concat .cse291 v_arrayElimCell_35))) (or (not (bvslt (bvadd .cse289 c_~mts3~0) (_ bv0 32))) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse290 (bvadd c_~mts1~0 (concat .cse291 v_arrayElimCell_31)))) (or (bvslt .cse290 (_ bv0 32)) (= .cse290 (_ bv0 32)) (= .cse290 (bvadd .cse289 c_~mts2~0 c_~sum~0))))))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse292 (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (not (bvslt (bvadd c_~mts1~0 (concat .cse292 v_arrayElimCell_31)) (_ bv0 32)))) (forall ((v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse293 (concat .cse292 v_arrayElimCell_35))) (or (not (bvslt (bvadd .cse293 c_~mts3~0) (_ bv0 32))) (not (bvslt (_ bv0 32) (bvadd .cse293 c_~mts2~0 c_~sum~0))))))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse297 (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34))) (let ((.cse296 (concat .cse297 v_arrayElimCell_35))) (let ((.cse295 (bvadd .cse296 c_~mts3~0))) (or (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse294 (bvadd c_~mts1~0 (concat .cse297 v_arrayElimCell_31)))) (or (bvslt .cse294 (_ bv0 32)) (= .cse294 .cse295) (= .cse294 (bvadd .cse296 c_~mts2~0 c_~sum~0))))) (bvslt .cse295 (_ bv0 32))))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse298 (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34))) (or (not (bvslt (bvadd c_~mts1~0 (concat .cse298 v_arrayElimCell_31)) (_ bv0 32))) (forall ((v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse299 (concat .cse298 v_arrayElimCell_35))) (or (not (bvslt (_ bv0 32) (bvadd .cse299 c_~mts2~0 c_~sum~0))) (bvslt (bvadd .cse299 c_~mts3~0) (_ bv0 32)))))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse303 (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34))) (let ((.cse300 (concat .cse303 v_arrayElimCell_35))) (let ((.cse301 (bvadd .cse300 c_~mts2~0 c_~sum~0))) (or (not (bvslt (bvadd .cse300 c_~mts3~0) (_ bv0 32))) (not (bvslt (_ bv0 32) .cse301)) (forall ((v_arrayElimCell_31 (_ BitVec 8))) (let ((.cse302 (bvadd c_~mts1~0 (concat .cse303 v_arrayElimCell_31)))) (or (bvslt .cse302 (_ bv0 32)) (= .cse302 .cse301))))))))))) (or .cse274 (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse304 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse305 (bvadd c_~mts1~0 .cse304))) (or (not (bvslt (bvadd c_~mts3~0 .cse304) (_ bv0 32))) (bvslt .cse305 (_ bv0 32)) (= .cse305 (_ bv0 32))))))) (or .cse274 (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse306 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (let ((.cse307 (bvadd c_~mts3~0 .cse306))) (or (bvslt (bvadd c_~mts1~0 .cse306) (_ bv0 32)) (not (bvslt .cse307 (bvadd c_~mts2~0 .cse306 c_~sum~0))) (bvslt .cse307 (_ bv0 32))))))) (or .cse274 .cse127 (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse308 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (or (bvslt (bvadd c_~mts1~0 .cse308) (_ bv0 32)) (bvslt (bvadd c_~mts3~0 .cse308) (_ bv0 32)))))) (forall ((v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse309 (concat (concat (concat v_arrayElimCell_36 v_arrayElimCell_30) v_arrayElimCell_34) v_arrayElimCell_31))) (or (not (bvslt (bvadd c_~mts3~0 .cse309) (_ bv0 32))) (not (bvslt (bvadd c_~mts1~0 .cse309) (_ bv0 32))) (not (bvslt (_ bv0 32) (bvadd c_~mts2~0 .cse309 c_~sum~0)))))))) is different from false Killed by 15