./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:01:09,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:01:09,941 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 18:01:09,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:01:09,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:01:09,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:01:09,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:01:09,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:01:09,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:01:09,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:01:09,974 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:01:09,975 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:01:09,975 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:01:09,976 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 18:01:09,976 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:01:09,977 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:01:09,977 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 18:01:09,978 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 18:01:09,978 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:01:09,979 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 18:01:09,979 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 18:01:09,984 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 18:01:09,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:01:09,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 18:01:09,985 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:01:09,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:01:09,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:01:09,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:01:09,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 18:01:09,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:01:09,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 18:01:09,988 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:01:09,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 18:01:09,988 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:01:09,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:01:09,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:01:09,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:01:09,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:01:09,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:01:09,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:01:09,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 18:01:09,990 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 18:01:09,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 18:01:09,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:01:09,990 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 18:01:09,991 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:01:09,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:01:09,991 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 [2023-12-02 18:01:10,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:01:10,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:01:10,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:01:10,244 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:01:10,245 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:01:10,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2023-12-02 18:01:13,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:01:13,199 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:01:13,200 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2023-12-02 18:01:13,207 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/data/cdad3172a/b2f5f4ddebed46b38d3b21f28cf81c0f/FLAG9463727ea [2023-12-02 18:01:13,219 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/data/cdad3172a/b2f5f4ddebed46b38d3b21f28cf81c0f [2023-12-02 18:01:13,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:01:13,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:01:13,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:01:13,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:01:13,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:01:13,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:01:13" (1/1) ... [2023-12-02 18:01:13,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d3b215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:13, skipping insertion in model container [2023-12-02 18:01:13,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:01:13" (1/1) ... [2023-12-02 18:01:13,252 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:01:13,398 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c[2592,2605] [2023-12-02 18:01:13,408 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:01:13,418 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:01:13,436 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c[2592,2605] [2023-12-02 18:01:13,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:01:13,447 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 18:01:13,447 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 18:01:13,455 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:01:13,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:13 WrapperNode [2023-12-02 18:01:13,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:01:13,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:01:13,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:01:13,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:01:13,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:13" (1/1) ... [2023-12-02 18:01:13,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:13" (1/1) ... [2023-12-02 18:01:13,489 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 104 [2023-12-02 18:01:13,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:01:13,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:01:13,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:01:13,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:01:13,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:13" (1/1) ... [2023-12-02 18:01:13,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:13" (1/1) ... [2023-12-02 18:01:13,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:13" (1/1) ... [2023-12-02 18:01:13,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:13" (1/1) ... [2023-12-02 18:01:13,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:13" (1/1) ... [2023-12-02 18:01:13,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:13" (1/1) ... [2023-12-02 18:01:13,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:13" (1/1) ... [2023-12-02 18:01:13,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:13" (1/1) ... [2023-12-02 18:01:13,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:01:13,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:01:13,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:01:13,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:01:13,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:13" (1/1) ... [2023-12-02 18:01:13,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:01:13,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:13,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:01:13,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:01:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:01:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 18:01:13,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 18:01:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 18:01:13,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 18:01:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-02 18:01:13,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-02 18:01:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 18:01:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 18:01:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 18:01:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 18:01:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 18:01:13,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 18:01:13,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:01:13,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:01:13,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 18:01:13,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 18:01:13,583 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 18:01:13,676 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:01:13,678 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:01:13,939 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:01:14,164 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:01:14,165 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 18:01:14,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:01:14 BoogieIcfgContainer [2023-12-02 18:01:14,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:01:14,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:01:14,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:01:14,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:01:14,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:01:13" (1/3) ... [2023-12-02 18:01:14,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cbf063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:01:14, skipping insertion in model container [2023-12-02 18:01:14,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:13" (2/3) ... [2023-12-02 18:01:14,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cbf063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:01:14, skipping insertion in model container [2023-12-02 18:01:14,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:01:14" (3/3) ... [2023-12-02 18:01:14,173 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2023-12-02 18:01:14,181 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 18:01:14,189 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:01:14,189 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 18:01:14,189 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 18:01:14,240 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-02 18:01:14,270 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 35 transitions, 91 flow [2023-12-02 18:01:14,332 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 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) [2023-12-02 18:01:14,346 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:01:14,353 INFO L357 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7179e4ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:01:14,354 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-02 18:01:14,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 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) [2023-12-02 18:01:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 18:01:14,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:14,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:01:14,377 INFO L420 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)] === [2023-12-02 18:01:14,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:14,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1495966733, now seen corresponding path program 1 times [2023-12-02 18:01:14,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:14,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231105982] [2023-12-02 18:01:14,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:14,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:01:14,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:14,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231105982] [2023-12-02 18:01:14,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231105982] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:01:14,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:01:14,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:01:14,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617296927] [2023-12-02 18:01:14,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:01:14,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:01:14,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:14,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:01:14,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:01:14,758 INFO L87 Difference]: Start difference. First operand has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 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) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:14,862 INFO L93 Difference]: Finished difference Result 579 states and 1878 transitions. [2023-12-02 18:01:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:01:14,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 18:01:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:14,883 INFO L225 Difference]: With dead ends: 579 [2023-12-02 18:01:14,883 INFO L226 Difference]: Without dead ends: 572 [2023-12-02 18:01:14,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:01:14,888 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:14,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:01:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2023-12-02 18:01:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 466. [2023-12-02 18:01:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 3.2451612903225806) internal successors, (1509), 465 states have internal predecessors, (1509), 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) [2023-12-02 18:01:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1509 transitions. [2023-12-02 18:01:14,977 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1509 transitions. Word has length 21 [2023-12-02 18:01:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:14,977 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 1509 transitions. [2023-12-02 18:01:14,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1509 transitions. [2023-12-02 18:01:14,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 18:01:14,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:14,982 INFO L195 NwaCegarLoop]: 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] [2023-12-02 18:01:14,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 18:01:14,983 INFO L420 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)] === [2023-12-02 18:01:14,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:14,983 INFO L85 PathProgramCache]: Analyzing trace with hash -948083096, now seen corresponding path program 1 times [2023-12-02 18:01:14,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:14,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098658341] [2023-12-02 18:01:14,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:14,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:15,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:15,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098658341] [2023-12-02 18:01:15,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098658341] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:01:15,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:01:15,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:01:15,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388755949] [2023-12-02 18:01:15,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:01:15,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:01:15,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:15,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:01:15,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:01:15,173 INFO L87 Difference]: Start difference. First operand 466 states and 1509 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:15,238 INFO L93 Difference]: Finished difference Result 467 states and 1510 transitions. [2023-12-02 18:01:15,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:01:15,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-02 18:01:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:15,243 INFO L225 Difference]: With dead ends: 467 [2023-12-02 18:01:15,243 INFO L226 Difference]: Without dead ends: 467 [2023-12-02 18:01:15,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:01:15,245 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:15,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:01:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-12-02 18:01:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2023-12-02 18:01:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 3.240343347639485) internal successors, (1510), 466 states have internal predecessors, (1510), 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) [2023-12-02 18:01:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1510 transitions. [2023-12-02 18:01:15,271 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 1510 transitions. Word has length 24 [2023-12-02 18:01:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:15,271 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 1510 transitions. [2023-12-02 18:01:15,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 1510 transitions. [2023-12-02 18:01:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 18:01:15,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:15,274 INFO L195 NwaCegarLoop]: 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] [2023-12-02 18:01:15,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 18:01:15,275 INFO L420 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)] === [2023-12-02 18:01:15,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash -100350785, now seen corresponding path program 1 times [2023-12-02 18:01:15,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:15,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431712693] [2023-12-02 18:01:15,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:15,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 18:01:15,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:15,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431712693] [2023-12-02 18:01:15,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431712693] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:01:15,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:01:15,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:01:15,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586600262] [2023-12-02 18:01:15,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:01:15,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:01:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:01:15,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:01:15,379 INFO L87 Difference]: Start difference. First operand 467 states and 1510 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:15,478 INFO L93 Difference]: Finished difference Result 507 states and 1644 transitions. [2023-12-02 18:01:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:01:15,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-02 18:01:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:15,483 INFO L225 Difference]: With dead ends: 507 [2023-12-02 18:01:15,483 INFO L226 Difference]: Without dead ends: 507 [2023-12-02 18:01:15,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:01:15,485 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:15,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:01:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2023-12-02 18:01:15,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 439. [2023-12-02 18:01:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 3.269406392694064) internal successors, (1432), 438 states have internal predecessors, (1432), 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) [2023-12-02 18:01:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1432 transitions. [2023-12-02 18:01:15,502 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1432 transitions. Word has length 25 [2023-12-02 18:01:15,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:15,503 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 1432 transitions. [2023-12-02 18:01:15,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1432 transitions. [2023-12-02 18:01:15,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 18:01:15,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:15,504 INFO L195 NwaCegarLoop]: 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] [2023-12-02 18:01:15,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 18:01:15,505 INFO L420 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)] === [2023-12-02 18:01:15,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:15,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2059563649, now seen corresponding path program 1 times [2023-12-02 18:01:15,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:15,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296275133] [2023-12-02 18:01:15,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:15,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:15,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:15,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296275133] [2023-12-02 18:01:15,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296275133] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:15,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66698977] [2023-12-02 18:01:15,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:15,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:15,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:15,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:15,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 18:01:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:15,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 18:01:15,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:15,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:15,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66698977] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:15,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 18:01:15,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-12-02 18:01:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667658612] [2023-12-02 18:01:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:01:15,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:01:15,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:15,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:01:15,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-02 18:01:15,863 INFO L87 Difference]: Start difference. First operand 439 states and 1432 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:15,960 INFO L93 Difference]: Finished difference Result 511 states and 1676 transitions. [2023-12-02 18:01:15,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:01:15,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-02 18:01:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:15,965 INFO L225 Difference]: With dead ends: 511 [2023-12-02 18:01:15,965 INFO L226 Difference]: Without dead ends: 511 [2023-12-02 18:01:15,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-02 18:01:15,967 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 73 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:15,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 5 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:01:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-12-02 18:01:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2023-12-02 18:01:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 3.2862745098039214) internal successors, (1676), 510 states have internal predecessors, (1676), 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) [2023-12-02 18:01:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1676 transitions. [2023-12-02 18:01:15,991 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 1676 transitions. Word has length 25 [2023-12-02 18:01:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:15,992 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 1676 transitions. [2023-12-02 18:01:15,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 1676 transitions. [2023-12-02 18:01:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 18:01:15,994 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:15,995 INFO L195 NwaCegarLoop]: 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, 1] [2023-12-02 18:01:16,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 18:01:16,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:16,196 INFO L420 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)] === [2023-12-02 18:01:16,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1396014372, now seen corresponding path program 1 times [2023-12-02 18:01:16,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:16,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389667132] [2023-12-02 18:01:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:01:17,338 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:17,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389667132] [2023-12-02 18:01:17,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389667132] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:17,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860621582] [2023-12-02 18:01:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:17,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:17,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:17,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:17,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 18:01:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:17,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 18:01:17,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:17,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:01:17,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-12-02 18:01:18,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:01:18,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-12-02 18:01:18,451 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 30 [2023-12-02 18:01:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:01:18,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:18,766 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~A~0.base) .cse1))) (or (< .cse0 (+ c_~max2~0 1)) (= c_~max1~0 .cse0)))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_110 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~A~0.base) .cse1)))))) is different from false [2023-12-02 18:01:18,850 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~A~0.base) .cse1))) (or (= c_~max1~0 .cse0) (< .cse0 (+ c_~max2~0 1))))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~A~0.base) .cse1)))))) is different from false [2023-12-02 18:01:18,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:01:18,936 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 263 treesize of output 223 [2023-12-02 18:01:18,951 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 191 treesize of output 179 [2023-12-02 18:01:18,962 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 179 treesize of output 173 [2023-12-02 18:01:18,974 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 173 treesize of output 149 [2023-12-02 18:01:18,984 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 149 treesize of output 137 [2023-12-02 18:01:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 18:01:19,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860621582] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:19,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1382349989] [2023-12-02 18:01:19,460 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:19,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:19,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-12-02 18:01:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869205180] [2023-12-02 18:01:19,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:19,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 18:01:19,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:19,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 18:01:19,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=500, Unknown=2, NotChecked=94, Total=702 [2023-12-02 18:01:19,466 INFO L87 Difference]: Start difference. First operand 511 states and 1676 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 states have internal predecessors, (72), 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) [2023-12-02 18:01:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:20,603 INFO L93 Difference]: Finished difference Result 1120 states and 3676 transitions. [2023-12-02 18:01:20,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 18:01:20,604 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 states have internal predecessors, (72), 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) Word has length 28 [2023-12-02 18:01:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:20,612 INFO L225 Difference]: With dead ends: 1120 [2023-12-02 18:01:20,612 INFO L226 Difference]: Without dead ends: 1113 [2023-12-02 18:01:20,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=170, Invalid=828, Unknown=2, NotChecked=122, Total=1122 [2023-12-02 18:01:20,614 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 262 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:20,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 50 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 881 Invalid, 0 Unknown, 335 Unchecked, 0.7s Time] [2023-12-02 18:01:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2023-12-02 18:01:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 721. [2023-12-02 18:01:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 3.2680555555555557) internal successors, (2353), 720 states have internal predecessors, (2353), 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) [2023-12-02 18:01:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 2353 transitions. [2023-12-02 18:01:20,641 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 2353 transitions. Word has length 28 [2023-12-02 18:01:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:20,642 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 2353 transitions. [2023-12-02 18:01:20,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 states have internal predecessors, (72), 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) [2023-12-02 18:01:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 2353 transitions. [2023-12-02 18:01:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 18:01:20,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:20,644 INFO L195 NwaCegarLoop]: 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, 1] [2023-12-02 18:01:20,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 18:01:20,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:20,845 INFO L420 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)] === [2023-12-02 18:01:20,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash -735401882, now seen corresponding path program 2 times [2023-12-02 18:01:20,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:20,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998382229] [2023-12-02 18:01:20,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:20,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:01:21,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:21,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998382229] [2023-12-02 18:01:21,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998382229] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:21,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711913718] [2023-12-02 18:01:21,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:01:21,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:21,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:21,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:21,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 18:01:21,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 18:01:21,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:01:21,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 18:01:21,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:22,152 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 30 [2023-12-02 18:01:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:01:22,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:22,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:01:22,372 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 89 treesize of output 49 [2023-12-02 18:01:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:01:22,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711913718] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:22,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1658110879] [2023-12-02 18:01:22,591 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:22,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:22,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2023-12-02 18:01:22,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217023085] [2023-12-02 18:01:22,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:22,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 18:01:22,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:22,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 18:01:22,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2023-12-02 18:01:22,595 INFO L87 Difference]: Start difference. First operand 721 states and 2353 transitions. Second operand has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 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) [2023-12-02 18:01:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:23,387 INFO L93 Difference]: Finished difference Result 1144 states and 3773 transitions. [2023-12-02 18:01:23,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 18:01:23,387 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 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) Word has length 28 [2023-12-02 18:01:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:23,398 INFO L225 Difference]: With dead ends: 1144 [2023-12-02 18:01:23,398 INFO L226 Difference]: Without dead ends: 1137 [2023-12-02 18:01:23,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2023-12-02 18:01:23,400 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 161 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:23,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 40 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 18:01:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2023-12-02 18:01:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 745. [2023-12-02 18:01:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 744 states have (on average 3.275537634408602) internal successors, (2437), 744 states have internal predecessors, (2437), 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) [2023-12-02 18:01:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 2437 transitions. [2023-12-02 18:01:23,436 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 2437 transitions. Word has length 28 [2023-12-02 18:01:23,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:23,437 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 2437 transitions. [2023-12-02 18:01:23,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 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) [2023-12-02 18:01:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 2437 transitions. [2023-12-02 18:01:23,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 18:01:23,440 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:23,441 INFO L195 NwaCegarLoop]: 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, 1] [2023-12-02 18:01:23,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 18:01:23,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:23,643 INFO L420 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)] === [2023-12-02 18:01:23,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1133761002, now seen corresponding path program 3 times [2023-12-02 18:01:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:23,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123618611] [2023-12-02 18:01:23,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:01:24,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123618611] [2023-12-02 18:01:24,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123618611] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102283882] [2023-12-02 18:01:24,170 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:01:24,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:24,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:24,171 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:24,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 18:01:24,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:01:24,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:01:24,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 18:01:24,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:24,561 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 55 treesize of output 31 [2023-12-02 18:01:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:24,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:24,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:01:24,749 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 89 treesize of output 49 [2023-12-02 18:01:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:25,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102283882] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:25,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [632731376] [2023-12-02 18:01:25,014 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:25,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:25,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 24 [2023-12-02 18:01:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277830140] [2023-12-02 18:01:25,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:25,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 18:01:25,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:25,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 18:01:25,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2023-12-02 18:01:25,018 INFO L87 Difference]: Start difference. First operand 745 states and 2437 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 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) [2023-12-02 18:01:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:26,468 INFO L93 Difference]: Finished difference Result 1454 states and 4825 transitions. [2023-12-02 18:01:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-02 18:01:26,469 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 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) Word has length 28 [2023-12-02 18:01:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:26,482 INFO L225 Difference]: With dead ends: 1454 [2023-12-02 18:01:26,483 INFO L226 Difference]: Without dead ends: 1447 [2023-12-02 18:01:26,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=449, Invalid=1621, Unknown=0, NotChecked=0, Total=2070 [2023-12-02 18:01:26,484 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 167 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:26,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 68 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 18:01:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2023-12-02 18:01:26,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 811. [2023-12-02 18:01:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 3.274074074074074) internal successors, (2652), 810 states have internal predecessors, (2652), 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) [2023-12-02 18:01:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2652 transitions. [2023-12-02 18:01:26,538 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2652 transitions. Word has length 28 [2023-12-02 18:01:26,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:26,538 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 2652 transitions. [2023-12-02 18:01:26,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 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) [2023-12-02 18:01:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2652 transitions. [2023-12-02 18:01:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 18:01:26,542 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:26,542 INFO L195 NwaCegarLoop]: 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, 1] [2023-12-02 18:01:26,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 18:01:26,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:26,743 INFO L420 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)] === [2023-12-02 18:01:26,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash 948163430, now seen corresponding path program 4 times [2023-12-02 18:01:26,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:26,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781675687] [2023-12-02 18:01:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:01:27,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:27,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781675687] [2023-12-02 18:01:27,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781675687] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:27,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125514436] [2023-12-02 18:01:27,406 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:01:27,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:27,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:27,407 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:27,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 18:01:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:27,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 18:01:27,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:27,863 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 30 [2023-12-02 18:01:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:01:27,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:28,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:01:28,085 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 89 treesize of output 49 [2023-12-02 18:01:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:01:28,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125514436] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:28,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1341523832] [2023-12-02 18:01:28,299 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:28,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:28,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2023-12-02 18:01:28,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811064702] [2023-12-02 18:01:28,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:28,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 18:01:28,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:28,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 18:01:28,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2023-12-02 18:01:28,301 INFO L87 Difference]: Start difference. First operand 811 states and 2652 transitions. Second operand has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 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) [2023-12-02 18:01:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:28,908 INFO L93 Difference]: Finished difference Result 1204 states and 3971 transitions. [2023-12-02 18:01:28,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 18:01:28,908 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 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) Word has length 28 [2023-12-02 18:01:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:28,916 INFO L225 Difference]: With dead ends: 1204 [2023-12-02 18:01:28,916 INFO L226 Difference]: Without dead ends: 1197 [2023-12-02 18:01:28,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2023-12-02 18:01:28,917 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 114 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:28,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 54 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 18:01:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2023-12-02 18:01:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 847. [2023-12-02 18:01:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 846 states have (on average 3.2836879432624113) internal successors, (2778), 846 states have internal predecessors, (2778), 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) [2023-12-02 18:01:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 2778 transitions. [2023-12-02 18:01:28,941 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 2778 transitions. Word has length 28 [2023-12-02 18:01:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:28,942 INFO L495 AbstractCegarLoop]: Abstraction has 847 states and 2778 transitions. [2023-12-02 18:01:28,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 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) [2023-12-02 18:01:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 2778 transitions. [2023-12-02 18:01:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 18:01:28,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:28,944 INFO L195 NwaCegarLoop]: 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, 1] [2023-12-02 18:01:28,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 18:01:29,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:29,145 INFO L420 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)] === [2023-12-02 18:01:29,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:29,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1477640982, now seen corresponding path program 5 times [2023-12-02 18:01:29,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:29,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187572443] [2023-12-02 18:01:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:29,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:01:29,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:29,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187572443] [2023-12-02 18:01:29,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187572443] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:29,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482983871] [2023-12-02 18:01:29,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:01:29,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:29,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:29,674 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:29,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 18:01:29,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 18:01:29,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:01:29,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 18:01:29,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:30,057 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 55 treesize of output 31 [2023-12-02 18:01:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:30,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:30,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:01:30,201 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 89 treesize of output 49 [2023-12-02 18:01:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:30,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482983871] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:30,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [707319503] [2023-12-02 18:01:30,356 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:30,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:30,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 24 [2023-12-02 18:01:30,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625206607] [2023-12-02 18:01:30,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:30,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 18:01:30,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:30,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 18:01:30,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2023-12-02 18:01:30,359 INFO L87 Difference]: Start difference. First operand 847 states and 2778 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 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) [2023-12-02 18:01:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:31,404 INFO L93 Difference]: Finished difference Result 1408 states and 4659 transitions. [2023-12-02 18:01:31,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-02 18:01:31,404 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 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) Word has length 28 [2023-12-02 18:01:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:31,414 INFO L225 Difference]: With dead ends: 1408 [2023-12-02 18:01:31,414 INFO L226 Difference]: Without dead ends: 1401 [2023-12-02 18:01:31,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=352, Invalid=1454, Unknown=0, NotChecked=0, Total=1806 [2023-12-02 18:01:31,415 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 183 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:31,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 71 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 18:01:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2023-12-02 18:01:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 835. [2023-12-02 18:01:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 834 states have (on average 3.273381294964029) internal successors, (2730), 834 states have internal predecessors, (2730), 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) [2023-12-02 18:01:31,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 2730 transitions. [2023-12-02 18:01:31,448 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 2730 transitions. Word has length 28 [2023-12-02 18:01:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:31,449 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 2730 transitions. [2023-12-02 18:01:31,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 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) [2023-12-02 18:01:31,449 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 2730 transitions. [2023-12-02 18:01:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 18:01:31,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:31,453 INFO L195 NwaCegarLoop]: 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, 1] [2023-12-02 18:01:31,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-02 18:01:31,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:31,654 INFO L420 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)] === [2023-12-02 18:01:31,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1395750742, now seen corresponding path program 6 times [2023-12-02 18:01:31,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:31,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203593143] [2023-12-02 18:01:31,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:31,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:01:32,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:32,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203593143] [2023-12-02 18:01:32,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203593143] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:32,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221967804] [2023-12-02 18:01:32,093 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:01:32,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:32,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:32,094 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:32,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 18:01:32,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:01:32,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:01:32,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 18:01:32,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:32,473 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 55 treesize of output 31 [2023-12-02 18:01:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:32,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:32,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:01:32,689 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 77 treesize of output 49 [2023-12-02 18:01:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:32,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221967804] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:32,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1896798696] [2023-12-02 18:01:32,859 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:32,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:32,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 23 [2023-12-02 18:01:32,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614442452] [2023-12-02 18:01:32,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:32,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 18:01:32,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:32,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 18:01:32,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2023-12-02 18:01:32,863 INFO L87 Difference]: Start difference. First operand 835 states and 2730 transitions. Second operand has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 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) [2023-12-02 18:01:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:34,421 INFO L93 Difference]: Finished difference Result 1400 states and 4643 transitions. [2023-12-02 18:01:34,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-02 18:01:34,422 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 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) Word has length 28 [2023-12-02 18:01:34,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:34,430 INFO L225 Difference]: With dead ends: 1400 [2023-12-02 18:01:34,431 INFO L226 Difference]: Without dead ends: 1393 [2023-12-02 18:01:34,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=391, Invalid=1961, Unknown=0, NotChecked=0, Total=2352 [2023-12-02 18:01:34,432 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 240 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1991 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:34,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 143 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1991 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 18:01:34,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2023-12-02 18:01:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 853. [2023-12-02 18:01:34,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 852 states have (on average 3.278169014084507) internal successors, (2793), 852 states have internal predecessors, (2793), 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) [2023-12-02 18:01:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 2793 transitions. [2023-12-02 18:01:34,464 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 2793 transitions. Word has length 28 [2023-12-02 18:01:34,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:34,464 INFO L495 AbstractCegarLoop]: Abstraction has 853 states and 2793 transitions. [2023-12-02 18:01:34,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 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) [2023-12-02 18:01:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 2793 transitions. [2023-12-02 18:01:34,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 18:01:34,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:34,468 INFO L195 NwaCegarLoop]: 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, 1, 1] [2023-12-02 18:01:34,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 18:01:34,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 18:01:34,669 INFO L420 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)] === [2023-12-02 18:01:34,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:34,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1966923187, now seen corresponding path program 7 times [2023-12-02 18:01:34,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:34,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217113473] [2023-12-02 18:01:34,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:34,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:34,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:34,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217113473] [2023-12-02 18:01:34,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217113473] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:34,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421794577] [2023-12-02 18:01:34,782 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:01:34,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:34,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:34,783 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:34,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 18:01:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:34,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:01:34,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:34,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:35,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421794577] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [325568618] [2023-12-02 18:01:35,015 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:35,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:35,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-12-02 18:01:35,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229200169] [2023-12-02 18:01:35,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:35,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 18:01:35,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:35,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 18:01:35,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-02 18:01:35,018 INFO L87 Difference]: Start difference. First operand 853 states and 2793 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 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) [2023-12-02 18:01:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:35,319 INFO L93 Difference]: Finished difference Result 1728 states and 5694 transitions. [2023-12-02 18:01:35,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 18:01:35,320 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 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) Word has length 29 [2023-12-02 18:01:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:35,334 INFO L225 Difference]: With dead ends: 1728 [2023-12-02 18:01:35,334 INFO L226 Difference]: Without dead ends: 1728 [2023-12-02 18:01:35,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-12-02 18:01:35,335 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 106 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:35,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 36 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 18:01:35,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2023-12-02 18:01:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1083. [2023-12-02 18:01:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1082 states have (on average 3.33456561922366) internal successors, (3608), 1082 states have internal predecessors, (3608), 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) [2023-12-02 18:01:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3608 transitions. [2023-12-02 18:01:35,379 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3608 transitions. Word has length 29 [2023-12-02 18:01:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:35,379 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 3608 transitions. [2023-12-02 18:01:35,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 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) [2023-12-02 18:01:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3608 transitions. [2023-12-02 18:01:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 18:01:35,384 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:35,384 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2023-12-02 18:01:35,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-02 18:01:35,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:35,584 INFO L420 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)] === [2023-12-02 18:01:35,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:35,585 INFO L85 PathProgramCache]: Analyzing trace with hash 961000543, now seen corresponding path program 8 times [2023-12-02 18:01:35,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:35,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770037397] [2023-12-02 18:01:35,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:35,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:35,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:35,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770037397] [2023-12-02 18:01:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770037397] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:35,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99299675] [2023-12-02 18:01:35,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:01:35,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:35,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:35,678 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:35,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 18:01:35,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 18:01:35,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:01:35,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:01:35,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:35,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:35,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99299675] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:35,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1356956554] [2023-12-02 18:01:35,902 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:35,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:35,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-12-02 18:01:35,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638646546] [2023-12-02 18:01:35,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:35,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 18:01:35,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:35,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 18:01:35,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-02 18:01:35,904 INFO L87 Difference]: Start difference. First operand 1083 states and 3608 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:36,106 INFO L93 Difference]: Finished difference Result 1484 states and 4810 transitions. [2023-12-02 18:01:36,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:01:36,106 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 18:01:36,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:36,115 INFO L225 Difference]: With dead ends: 1484 [2023-12-02 18:01:36,115 INFO L226 Difference]: Without dead ends: 1474 [2023-12-02 18:01:36,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-02 18:01:36,116 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 114 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:36,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 25 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:01:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2023-12-02 18:01:36,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1329. [2023-12-02 18:01:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1328 states have (on average 3.3140060240963853) internal successors, (4401), 1328 states have internal predecessors, (4401), 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) [2023-12-02 18:01:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 4401 transitions. [2023-12-02 18:01:36,178 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 4401 transitions. Word has length 31 [2023-12-02 18:01:36,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:36,178 INFO L495 AbstractCegarLoop]: Abstraction has 1329 states and 4401 transitions. [2023-12-02 18:01:36,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 4401 transitions. [2023-12-02 18:01:36,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 18:01:36,183 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:36,183 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2023-12-02 18:01:36,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 18:01:36,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:36,390 INFO L420 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)] === [2023-12-02 18:01:36,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:36,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1300814316, now seen corresponding path program 1 times [2023-12-02 18:01:36,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:36,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423567136] [2023-12-02 18:01:36,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:36,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 18:01:36,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:36,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423567136] [2023-12-02 18:01:36,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423567136] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:36,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623815989] [2023-12-02 18:01:36,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:36,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:36,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:36,506 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:36,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 18:01:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:36,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:01:36,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 18:01:36,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 18:01:36,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623815989] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:36,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1725134257] [2023-12-02 18:01:36,726 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:36,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:36,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-12-02 18:01:36,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757789785] [2023-12-02 18:01:36,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:36,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 18:01:36,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:36,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 18:01:36,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-12-02 18:01:36,729 INFO L87 Difference]: Start difference. First operand 1329 states and 4401 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:36,912 INFO L93 Difference]: Finished difference Result 1204 states and 3756 transitions. [2023-12-02 18:01:36,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:01:36,912 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 18:01:36,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:36,922 INFO L225 Difference]: With dead ends: 1204 [2023-12-02 18:01:36,922 INFO L226 Difference]: Without dead ends: 1176 [2023-12-02 18:01:36,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-02 18:01:36,923 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 102 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:36,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 14 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:01:36,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2023-12-02 18:01:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1143. [2023-12-02 18:01:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 3.169877408056042) internal successors, (3620), 1142 states have internal predecessors, (3620), 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) [2023-12-02 18:01:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 3620 transitions. [2023-12-02 18:01:36,960 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 3620 transitions. Word has length 31 [2023-12-02 18:01:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:36,961 INFO L495 AbstractCegarLoop]: Abstraction has 1143 states and 3620 transitions. [2023-12-02 18:01:36,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 3620 transitions. [2023-12-02 18:01:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 18:01:36,964 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:36,964 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2023-12-02 18:01:36,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 18:01:37,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 18:01:37,165 INFO L420 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)] === [2023-12-02 18:01:37,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:37,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1638845537, now seen corresponding path program 9 times [2023-12-02 18:01:37,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:37,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304585861] [2023-12-02 18:01:37,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:37,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:37,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:37,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304585861] [2023-12-02 18:01:37,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304585861] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:37,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055982991] [2023-12-02 18:01:37,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:01:37,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:37,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:37,283 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:37,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 18:01:37,381 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:01:37,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:01:37,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:01:37,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:37,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:01:37,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055982991] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:37,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1400860262] [2023-12-02 18:01:37,595 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:37,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:37,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2023-12-02 18:01:37,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707341385] [2023-12-02 18:01:37,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:37,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 18:01:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:37,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 18:01:37,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-12-02 18:01:37,597 INFO L87 Difference]: Start difference. First operand 1143 states and 3620 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 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) [2023-12-02 18:01:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:37,950 INFO L93 Difference]: Finished difference Result 1141 states and 3607 transitions. [2023-12-02 18:01:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 18:01:37,950 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 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) Word has length 31 [2023-12-02 18:01:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:37,955 INFO L225 Difference]: With dead ends: 1141 [2023-12-02 18:01:37,955 INFO L226 Difference]: Without dead ends: 872 [2023-12-02 18:01:37,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2023-12-02 18:01:37,956 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 214 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:37,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 8 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 18:01:37,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2023-12-02 18:01:37,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 728. [2023-12-02 18:01:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 3.313617606602476) internal successors, (2409), 727 states have internal predecessors, (2409), 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) [2023-12-02 18:01:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 2409 transitions. [2023-12-02 18:01:37,996 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 2409 transitions. Word has length 31 [2023-12-02 18:01:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:37,997 INFO L495 AbstractCegarLoop]: Abstraction has 728 states and 2409 transitions. [2023-12-02 18:01:37,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 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) [2023-12-02 18:01:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 2409 transitions. [2023-12-02 18:01:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 18:01:37,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:37,999 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2023-12-02 18:01:38,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 18:01:38,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 18:01:38,220 INFO L420 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)] === [2023-12-02 18:01:38,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:38,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1826674216, now seen corresponding path program 10 times [2023-12-02 18:01:38,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:38,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648099415] [2023-12-02 18:01:38,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:38,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:38,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:38,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648099415] [2023-12-02 18:01:38,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648099415] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:38,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847952360] [2023-12-02 18:01:38,373 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:01:38,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:38,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:38,375 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:38,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 18:01:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:38,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 18:01:38,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:38,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:38,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:38,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847952360] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:38,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2482233] [2023-12-02 18:01:38,719 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:38,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:38,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-12-02 18:01:38,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579218096] [2023-12-02 18:01:38,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:38,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 18:01:38,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:38,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 18:01:38,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-12-02 18:01:38,721 INFO L87 Difference]: Start difference. First operand 728 states and 2409 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:39,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:39,175 INFO L93 Difference]: Finished difference Result 1427 states and 4626 transitions. [2023-12-02 18:01:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 18:01:39,176 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-02 18:01:39,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:39,182 INFO L225 Difference]: With dead ends: 1427 [2023-12-02 18:01:39,182 INFO L226 Difference]: Without dead ends: 1427 [2023-12-02 18:01:39,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2023-12-02 18:01:39,183 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 134 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:39,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 10 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:01:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2023-12-02 18:01:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 872. [2023-12-02 18:01:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 871 states have (on average 3.235361653272101) internal successors, (2818), 871 states have internal predecessors, (2818), 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) [2023-12-02 18:01:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 2818 transitions. [2023-12-02 18:01:39,214 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 2818 transitions. Word has length 32 [2023-12-02 18:01:39,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:39,214 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 2818 transitions. [2023-12-02 18:01:39,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 2818 transitions. [2023-12-02 18:01:39,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 18:01:39,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:39,217 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2023-12-02 18:01:39,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-02 18:01:39,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 18:01:39,418 INFO L420 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)] === [2023-12-02 18:01:39,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:39,418 INFO L85 PathProgramCache]: Analyzing trace with hash -918623624, now seen corresponding path program 11 times [2023-12-02 18:01:39,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:39,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064104585] [2023-12-02 18:01:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:39,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:39,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:39,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064104585] [2023-12-02 18:01:39,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064104585] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:39,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470812851] [2023-12-02 18:01:39,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:01:39,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:39,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:39,560 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:39,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 18:01:39,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 18:01:39,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:01:39,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 18:01:39,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:39,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:39,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470812851] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:39,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1708750945] [2023-12-02 18:01:39,922 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:39,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:39,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-12-02 18:01:39,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473225214] [2023-12-02 18:01:39,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:39,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 18:01:39,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:39,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 18:01:39,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-12-02 18:01:39,924 INFO L87 Difference]: Start difference. First operand 872 states and 2818 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 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) [2023-12-02 18:01:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:40,431 INFO L93 Difference]: Finished difference Result 2080 states and 6992 transitions. [2023-12-02 18:01:40,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 18:01:40,432 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 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) Word has length 32 [2023-12-02 18:01:40,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:40,437 INFO L225 Difference]: With dead ends: 2080 [2023-12-02 18:01:40,438 INFO L226 Difference]: Without dead ends: 2080 [2023-12-02 18:01:40,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2023-12-02 18:01:40,439 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 180 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:40,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 9 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:01:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2023-12-02 18:01:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 932. [2023-12-02 18:01:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 3.313641245972073) internal successors, (3085), 931 states have internal predecessors, (3085), 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) [2023-12-02 18:01:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 3085 transitions. [2023-12-02 18:01:40,465 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 3085 transitions. Word has length 32 [2023-12-02 18:01:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:40,465 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 3085 transitions. [2023-12-02 18:01:40,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 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) [2023-12-02 18:01:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 3085 transitions. [2023-12-02 18:01:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 18:01:40,467 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:40,467 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2023-12-02 18:01:40,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-02 18:01:40,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 18:01:40,668 INFO L420 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)] === [2023-12-02 18:01:40,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:40,668 INFO L85 PathProgramCache]: Analyzing trace with hash 844041952, now seen corresponding path program 12 times [2023-12-02 18:01:40,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:40,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240086681] [2023-12-02 18:01:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:40,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:40,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240086681] [2023-12-02 18:01:40,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240086681] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36335845] [2023-12-02 18:01:40,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:01:40,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:40,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:40,816 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:40,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 18:01:40,918 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:01:40,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:01:40,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:01:40,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 18:01:41,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 18:01:41,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36335845] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:41,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1277787244] [2023-12-02 18:01:41,125 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:41,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:41,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-12-02 18:01:41,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380689235] [2023-12-02 18:01:41,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:41,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 18:01:41,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:41,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 18:01:41,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-12-02 18:01:41,127 INFO L87 Difference]: Start difference. First operand 932 states and 3085 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 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) [2023-12-02 18:01:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:43,123 INFO L93 Difference]: Finished difference Result 2769 states and 9571 transitions. [2023-12-02 18:01:43,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-12-02 18:01:43,123 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 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) Word has length 32 [2023-12-02 18:01:43,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:43,131 INFO L225 Difference]: With dead ends: 2769 [2023-12-02 18:01:43,131 INFO L226 Difference]: Without dead ends: 2769 [2023-12-02 18:01:43,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1481, Invalid=5161, Unknown=0, NotChecked=0, Total=6642 [2023-12-02 18:01:43,133 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 295 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:43,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 11 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 18:01:43,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2023-12-02 18:01:43,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 952. [2023-12-02 18:01:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 951 states have (on average 3.3585699263932702) internal successors, (3194), 951 states have internal predecessors, (3194), 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) [2023-12-02 18:01:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 3194 transitions. [2023-12-02 18:01:43,165 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 3194 transitions. Word has length 32 [2023-12-02 18:01:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:43,166 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 3194 transitions. [2023-12-02 18:01:43,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 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) [2023-12-02 18:01:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 3194 transitions. [2023-12-02 18:01:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 18:01:43,168 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:43,169 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2023-12-02 18:01:43,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 18:01:43,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 18:01:43,369 INFO L420 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)] === [2023-12-02 18:01:43,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:43,369 INFO L85 PathProgramCache]: Analyzing trace with hash 592309176, now seen corresponding path program 13 times [2023-12-02 18:01:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:43,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54297074] [2023-12-02 18:01:43,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:43,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:43,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:43,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54297074] [2023-12-02 18:01:43,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54297074] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:43,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557861818] [2023-12-02 18:01:43,487 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:01:43,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:43,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:43,489 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:43,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 18:01:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:43,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 18:01:43,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:43,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:43,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557861818] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1988434257] [2023-12-02 18:01:43,874 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:43,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:43,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-12-02 18:01:43,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682072088] [2023-12-02 18:01:43,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:43,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 18:01:43,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:43,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 18:01:43,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-12-02 18:01:43,876 INFO L87 Difference]: Start difference. First operand 952 states and 3194 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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) [2023-12-02 18:01:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:44,526 INFO L93 Difference]: Finished difference Result 2060 states and 7163 transitions. [2023-12-02 18:01:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 18:01:44,526 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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) Word has length 32 [2023-12-02 18:01:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:44,532 INFO L225 Difference]: With dead ends: 2060 [2023-12-02 18:01:44,532 INFO L226 Difference]: Without dead ends: 2060 [2023-12-02 18:01:44,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2023-12-02 18:01:44,533 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 213 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:44,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 11 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 18:01:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2023-12-02 18:01:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 972. [2023-12-02 18:01:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 3.339855818743563) internal successors, (3243), 971 states have internal predecessors, (3243), 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) [2023-12-02 18:01:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3243 transitions. [2023-12-02 18:01:44,562 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3243 transitions. Word has length 32 [2023-12-02 18:01:44,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:44,562 INFO L495 AbstractCegarLoop]: Abstraction has 972 states and 3243 transitions. [2023-12-02 18:01:44,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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) [2023-12-02 18:01:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3243 transitions. [2023-12-02 18:01:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 18:01:44,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:44,565 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2023-12-02 18:01:44,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 18:01:44,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 18:01:44,765 INFO L420 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)] === [2023-12-02 18:01:44,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:44,766 INFO L85 PathProgramCache]: Analyzing trace with hash -689073898, now seen corresponding path program 14 times [2023-12-02 18:01:44,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:44,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554917986] [2023-12-02 18:01:44,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:44,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:44,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:44,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554917986] [2023-12-02 18:01:44,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554917986] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:44,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219579084] [2023-12-02 18:01:44,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:01:44,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:44,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:44,874 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:44,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 18:01:44,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 18:01:44,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:01:44,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 18:01:44,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:45,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:45,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219579084] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:45,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [261402303] [2023-12-02 18:01:45,196 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:45,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:45,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-12-02 18:01:45,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456969428] [2023-12-02 18:01:45,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:45,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 18:01:45,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:45,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 18:01:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-12-02 18:01:45,199 INFO L87 Difference]: Start difference. First operand 972 states and 3243 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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) [2023-12-02 18:01:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:45,678 INFO L93 Difference]: Finished difference Result 1830 states and 6097 transitions. [2023-12-02 18:01:45,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 18:01:45,679 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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) Word has length 32 [2023-12-02 18:01:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:45,686 INFO L225 Difference]: With dead ends: 1830 [2023-12-02 18:01:45,686 INFO L226 Difference]: Without dead ends: 1830 [2023-12-02 18:01:45,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2023-12-02 18:01:45,687 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 144 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:45,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 11 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:01:45,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2023-12-02 18:01:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1072. [2023-12-02 18:01:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 3.4061624649859943) internal successors, (3648), 1071 states have internal predecessors, (3648), 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) [2023-12-02 18:01:45,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 3648 transitions. [2023-12-02 18:01:45,734 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 3648 transitions. Word has length 32 [2023-12-02 18:01:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:45,734 INFO L495 AbstractCegarLoop]: Abstraction has 1072 states and 3648 transitions. [2023-12-02 18:01:45,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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) [2023-12-02 18:01:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 3648 transitions. [2023-12-02 18:01:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 18:01:45,736 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:45,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2023-12-02 18:01:45,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 18:01:45,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:45,937 INFO L420 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)] === [2023-12-02 18:01:45,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:45,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1073591678, now seen corresponding path program 15 times [2023-12-02 18:01:45,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:45,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560202906] [2023-12-02 18:01:45,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:45,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:46,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:46,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560202906] [2023-12-02 18:01:46,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560202906] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:46,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849702175] [2023-12-02 18:01:46,073 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:01:46,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:46,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:46,074 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:46,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 18:01:46,186 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:01:46,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:01:46,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:01:46,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 18:01:46,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 18:01:46,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849702175] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:46,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1343902856] [2023-12-02 18:01:46,394 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:46,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:46,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-12-02 18:01:46,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409606228] [2023-12-02 18:01:46,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:46,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 18:01:46,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:46,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 18:01:46,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-12-02 18:01:46,397 INFO L87 Difference]: Start difference. First operand 1072 states and 3648 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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) [2023-12-02 18:01:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:48,849 INFO L93 Difference]: Finished difference Result 2974 states and 10181 transitions. [2023-12-02 18:01:48,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-12-02 18:01:48,850 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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) Word has length 32 [2023-12-02 18:01:48,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:48,857 INFO L225 Difference]: With dead ends: 2974 [2023-12-02 18:01:48,857 INFO L226 Difference]: Without dead ends: 2974 [2023-12-02 18:01:48,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3175 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1794, Invalid=7518, Unknown=0, NotChecked=0, Total=9312 [2023-12-02 18:01:48,860 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 348 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 2460 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:48,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 30 Invalid, 2477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2460 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 18:01:48,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2023-12-02 18:01:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1092. [2023-12-02 18:01:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1091 states have (on average 3.443629697525206) internal successors, (3757), 1091 states have internal predecessors, (3757), 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) [2023-12-02 18:01:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 3757 transitions. [2023-12-02 18:01:48,896 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 3757 transitions. Word has length 32 [2023-12-02 18:01:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:48,896 INFO L495 AbstractCegarLoop]: Abstraction has 1092 states and 3757 transitions. [2023-12-02 18:01:48,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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) [2023-12-02 18:01:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 3757 transitions. [2023-12-02 18:01:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 18:01:48,898 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:48,898 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2023-12-02 18:01:48,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-02 18:01:49,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:49,099 INFO L420 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)] === [2023-12-02 18:01:49,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:49,099 INFO L85 PathProgramCache]: Analyzing trace with hash 821858902, now seen corresponding path program 16 times [2023-12-02 18:01:49,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:49,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481783860] [2023-12-02 18:01:49,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:49,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:49,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:49,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481783860] [2023-12-02 18:01:49,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481783860] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:49,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102724450] [2023-12-02 18:01:49,235 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:01:49,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:49,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:49,236 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:49,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 18:01:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:49,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 18:01:49,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:49,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:49,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102724450] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:49,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1054315471] [2023-12-02 18:01:49,536 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:49,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:49,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-12-02 18:01:49,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202535533] [2023-12-02 18:01:49,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:49,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 18:01:49,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:49,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 18:01:49,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-12-02 18:01:49,537 INFO L87 Difference]: Start difference. First operand 1092 states and 3757 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:50,205 INFO L93 Difference]: Finished difference Result 2819 states and 9644 transitions. [2023-12-02 18:01:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 18:01:50,206 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-02 18:01:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:50,214 INFO L225 Difference]: With dead ends: 2819 [2023-12-02 18:01:50,214 INFO L226 Difference]: Without dead ends: 2819 [2023-12-02 18:01:50,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=1230, Unknown=0, NotChecked=0, Total=1640 [2023-12-02 18:01:50,216 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 337 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:50,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 20 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:01:50,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2023-12-02 18:01:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 1012. [2023-12-02 18:01:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.344213649851632) internal successors, (3381), 1011 states have internal predecessors, (3381), 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) [2023-12-02 18:01:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3381 transitions. [2023-12-02 18:01:50,264 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3381 transitions. Word has length 32 [2023-12-02 18:01:50,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:50,264 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 3381 transitions. [2023-12-02 18:01:50,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3381 transitions. [2023-12-02 18:01:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 18:01:50,267 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:50,267 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2023-12-02 18:01:50,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 18:01:50,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:50,468 INFO L420 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)] === [2023-12-02 18:01:50,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:50,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1824087188, now seen corresponding path program 17 times [2023-12-02 18:01:50,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:50,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387042241] [2023-12-02 18:01:50,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:50,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:50,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:50,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387042241] [2023-12-02 18:01:50,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387042241] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:50,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997580907] [2023-12-02 18:01:50,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:01:50,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:50,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:50,575 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:50,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 18:01:50,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 18:01:50,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:01:50,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 18:01:50,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:50,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:50,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997580907] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:50,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1216229662] [2023-12-02 18:01:50,941 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:50,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:50,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-12-02 18:01:50,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971044102] [2023-12-02 18:01:50,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:50,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 18:01:50,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:50,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 18:01:50,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-12-02 18:01:50,943 INFO L87 Difference]: Start difference. First operand 1012 states and 3381 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:51,998 INFO L93 Difference]: Finished difference Result 3628 states and 12723 transitions. [2023-12-02 18:01:51,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 18:01:51,998 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-02 18:01:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:52,006 INFO L225 Difference]: With dead ends: 3628 [2023-12-02 18:01:52,006 INFO L226 Difference]: Without dead ends: 3628 [2023-12-02 18:01:52,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=667, Invalid=1783, Unknown=0, NotChecked=0, Total=2450 [2023-12-02 18:01:52,008 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 391 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:52,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 14 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 18:01:52,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2023-12-02 18:01:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 1052. [2023-12-02 18:01:52,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 3.4053282588011418) internal successors, (3579), 1051 states have internal predecessors, (3579), 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) [2023-12-02 18:01:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 3579 transitions. [2023-12-02 18:01:52,048 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 3579 transitions. Word has length 32 [2023-12-02 18:01:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:52,048 INFO L495 AbstractCegarLoop]: Abstraction has 1052 states and 3579 transitions. [2023-12-02 18:01:52,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 3579 transitions. [2023-12-02 18:01:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 18:01:52,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:52,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2023-12-02 18:01:52,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 18:01:52,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-02 18:01:52,251 INFO L420 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)] === [2023-12-02 18:01:52,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:52,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2075819964, now seen corresponding path program 18 times [2023-12-02 18:01:52,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:52,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299370298] [2023-12-02 18:01:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:52,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:52,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:52,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299370298] [2023-12-02 18:01:52,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299370298] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:52,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811153276] [2023-12-02 18:01:52,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:01:52,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:52,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:52,388 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:52,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 18:01:52,503 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:01:52,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:01:52,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:01:52,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 18:01:52,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 18:01:52,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811153276] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:52,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [163406874] [2023-12-02 18:01:52,702 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:52,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:52,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2023-12-02 18:01:52,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339957400] [2023-12-02 18:01:52,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:52,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 18:01:52,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:52,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 18:01:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-12-02 18:01:52,703 INFO L87 Difference]: Start difference. First operand 1052 states and 3579 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:55,487 INFO L93 Difference]: Finished difference Result 4590 states and 16105 transitions. [2023-12-02 18:01:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2023-12-02 18:01:55,488 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-02 18:01:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:55,497 INFO L225 Difference]: With dead ends: 4590 [2023-12-02 18:01:55,497 INFO L226 Difference]: Without dead ends: 4590 [2023-12-02 18:01:55,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6174 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3464, Invalid=12792, Unknown=0, NotChecked=0, Total=16256 [2023-12-02 18:01:55,501 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 542 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:55,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 21 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 18:01:55,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4590 states. [2023-12-02 18:01:55,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4590 to 1032. [2023-12-02 18:01:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1031 states have (on average 3.3656644034917558) internal successors, (3470), 1031 states have internal predecessors, (3470), 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) [2023-12-02 18:01:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 3470 transitions. [2023-12-02 18:01:55,544 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 3470 transitions. Word has length 32 [2023-12-02 18:01:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:55,545 INFO L495 AbstractCegarLoop]: Abstraction has 1032 states and 3470 transitions. [2023-12-02 18:01:55,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 3470 transitions. [2023-12-02 18:01:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 18:01:55,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:55,547 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2023-12-02 18:01:55,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 18:01:55,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-02 18:01:55,747 INFO L420 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)] === [2023-12-02 18:01:55,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash -383640682, now seen corresponding path program 19 times [2023-12-02 18:01:55,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:55,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081037027] [2023-12-02 18:01:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:55,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:55,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:55,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081037027] [2023-12-02 18:01:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081037027] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:55,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900367090] [2023-12-02 18:01:55,873 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:01:55,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:55,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:55,874 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:55,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-02 18:01:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:55,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 18:01:55,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:56,044 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:01:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:01:56,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900367090] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:01:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [205721340] [2023-12-02 18:01:56,130 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:01:56,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:01:56,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-12-02 18:01:56,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593815226] [2023-12-02 18:01:56,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:01:56,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 18:01:56,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:56,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 18:01:56,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-12-02 18:01:56,132 INFO L87 Difference]: Start difference. First operand 1032 states and 3470 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:56,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:56,483 INFO L93 Difference]: Finished difference Result 1669 states and 5540 transitions. [2023-12-02 18:01:56,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 18:01:56,484 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-02 18:01:56,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:56,488 INFO L225 Difference]: With dead ends: 1669 [2023-12-02 18:01:56,488 INFO L226 Difference]: Without dead ends: 1669 [2023-12-02 18:01:56,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2023-12-02 18:01:56,489 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 200 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:56,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 11 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 18:01:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2023-12-02 18:01:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1052. [2023-12-02 18:01:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 3.3482397716460515) internal successors, (3519), 1051 states have internal predecessors, (3519), 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) [2023-12-02 18:01:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 3519 transitions. [2023-12-02 18:01:56,510 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 3519 transitions. Word has length 32 [2023-12-02 18:01:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:56,510 INFO L495 AbstractCegarLoop]: Abstraction has 1052 states and 3519 transitions. [2023-12-02 18:01:56,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:01:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 3519 transitions. [2023-12-02 18:01:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 18:01:56,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:56,513 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1] [2023-12-02 18:01:56,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-12-02 18:01:56,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 18:01:56,714 INFO L420 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)] === [2023-12-02 18:01:56,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:56,714 INFO L85 PathProgramCache]: Analyzing trace with hash 410943304, now seen corresponding path program 2 times [2023-12-02 18:01:56,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:56,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229007170] [2023-12-02 18:01:56,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:56,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:01:58,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:58,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229007170] [2023-12-02 18:01:58,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229007170] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:01:58,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640434815] [2023-12-02 18:01:58,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:01:58,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:01:58,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:58,579 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:01:58,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 18:01:58,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 18:01:58,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:01:58,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 18:01:58,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:01:59,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:01:59,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 69 [2023-12-02 18:02:00,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:02:00,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 90 [2023-12-02 18:02:00,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:02:00,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2023-12-02 18:02:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:02:00,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:02:03,109 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-12-02 18:02:03,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2246 treesize of output 1793 [2023-12-02 18:02:03,183 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 969 treesize of output 957 [2023-12-02 18:02:03,213 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 957 treesize of output 945 [2023-12-02 18:02:03,254 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:03,254 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 945 treesize of output 931 [2023-12-02 18:02:03,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 931 treesize of output 907 [2023-12-02 18:02:03,325 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:03,326 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 907 treesize of output 893 [2023-12-02 18:02:03,354 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 893 treesize of output 881 [2023-12-02 18:02:03,393 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:03,394 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 881 treesize of output 873 [2023-12-02 18:02:03,422 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 873 treesize of output 849 [2023-12-02 18:02:03,461 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:03,462 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 849 treesize of output 831 [2023-12-02 18:02:03,503 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:03,503 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 831 treesize of output 817 [2023-12-02 18:02:03,544 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:03,545 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 817 treesize of output 803 [2023-12-02 18:02:03,584 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 803 treesize of output 779 [2023-12-02 18:02:03,631 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:03,632 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 779 treesize of output 771 [2023-12-02 18:02:03,666 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 771 treesize of output 759 [2023-12-02 18:02:03,710 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:03,711 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 759 treesize of output 741 [2023-12-02 18:02:03,744 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 741 treesize of output 717 [2023-12-02 18:02:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:02:06,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640434815] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:02:06,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [416846783] [2023-12-02 18:02:06,663 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:02:06,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:02:06,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 48 [2023-12-02 18:02:06,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899673946] [2023-12-02 18:02:06,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:02:06,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-02 18:02:06,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:02:06,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-02 18:02:06,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2141, Unknown=12, NotChecked=0, Total=2352 [2023-12-02 18:02:06,666 INFO L87 Difference]: Start difference. First operand 1052 states and 3519 transitions. Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 48 states have internal predecessors, (99), 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) [2023-12-02 18:02:10,553 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (* 4 c_~M~0))) (let ((.cse10 (select |c_#memory_int| c_~A~0.base)) (.cse19 (+ c_~A~0.offset .cse11))) (let ((.cse23 (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_800 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_799))) (or (< c_~max2~0 (select (select .cse37 c_~A~0.base) c_~A~0.offset)) (< c_~max2~0 (select (select (store .cse37 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse19)))))) (.cse6 (= c_~max1~0 c_~max2~0)) (.cse17 (+ c_~max2~0 1)) (.cse7 (select .cse10 0))) (let ((.cse8 (= c_~max1~0 0)) (.cse3 (+ .cse7 1)) (.cse0 (< c_~M~0 1)) (.cse1 (and (forall ((v_ArrVal_799 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_799))) (or (< c_~max2~0 (select (select .cse30 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_800 (Array Int Int))) (let ((.cse31 (select (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse19))) (or (< .cse31 .cse17) (= c_~max1~0 .cse31))))))) (forall ((v_ArrVal_799 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_799))) (let ((.cse32 (select (select .cse33 c_~A~0.base) c_~A~0.offset))) (or (< .cse32 .cse17) (forall ((v_ArrVal_800 (Array Int Int))) (< .cse32 (select (select (store .cse33 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse19))) (= c_~max1~0 .cse32))))) (or .cse23 .cse6) (forall ((v_ArrVal_799 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_799))) (let ((.cse35 (select (select .cse36 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_800 (Array Int Int))) (let ((.cse34 (select (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse19))) (or (= c_~max1~0 .cse34) (< .cse34 (+ .cse35 1))))) (< .cse35 .cse17))))))) (.cse9 (= c_~max2~0 0)) (.cse12 (<= .cse7 0)) (.cse2 (= .cse7 c_~max2~0)) (.cse15 (<= 1 .cse7)) (.cse16 (select .cse10 (+ c_~A~0.offset (* c_thread2Thread1of1ForFork2_~i~1 4))))) (and (or .cse0 .cse1) (let ((.cse4 (select .cse10 .cse11))) (let ((.cse5 (= c_~max1~0 .cse4))) (or (and .cse2 (or (and (<= .cse3 .cse4) .cse5) (and .cse6 (<= .cse4 .cse7)))) (and (or (and .cse8 (<= .cse4 0)) (and (<= 1 .cse4) .cse5)) .cse9)))) (= c_~M~0 1) (let ((.cse13 (select .cse10 4))) (let ((.cse14 (= c_~max1~0 .cse13))) (or (and .cse12 (or (and (<= 1 .cse13) .cse14) (and (<= .cse13 0) .cse8))) (and (or (and .cse14 (<= .cse3 .cse13)) (and (= .cse7 c_~max1~0) (<= .cse13 .cse7))) .cse15)))) (<= (+ 2 c_~A~0.base) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= c_~A~0.offset 0) (or (< .cse16 .cse17) (and (forall ((v_ArrVal_800 (Array Int Int))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse19))) (or (< .cse18 (+ .cse16 1)) (= c_~max1~0 .cse18)))) (or (= c_~max1~0 .cse16) (forall ((v_ArrVal_800 (Array Int Int))) (< .cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse19)))))) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (= c_thread2Thread1of1ForFork2_~i~1 0) (or .cse0 (let ((.cse21 (select .cse10 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))))) (and (or (and (forall ((v_ArrVal_799 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_799))) (let ((.cse20 (select (select .cse22 c_~A~0.base) c_~A~0.offset))) (or (< .cse20 .cse17) (= .cse21 .cse20) (forall ((v_ArrVal_800 (Array Int Int))) (< .cse20 (select (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse19))))))) (or .cse23 (= .cse21 c_~max2~0)) (forall ((v_ArrVal_799 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_799))) (or (< c_~max2~0 (select (select .cse24 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_800 (Array Int Int))) (let ((.cse25 (select (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse19))) (or (< .cse25 .cse17) (= .cse21 .cse25))))))) (forall ((v_ArrVal_799 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_799))) (let ((.cse26 (select (select .cse28 c_~A~0.base) c_~A~0.offset))) (or (< .cse26 .cse17) (forall ((v_ArrVal_800 (Array Int Int))) (let ((.cse27 (select (select (store .cse28 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse19))) (or (< .cse27 (+ .cse26 1)) (= .cse21 .cse27))))))))) (< .cse21 (+ c_~max1~0 1))) (or (< c_~max1~0 .cse21) .cse1)))) (or (and .cse9 .cse12) (and .cse2 .cse15)) (or (< c_~max2~0 .cse16) (and (forall ((v_ArrVal_800 (Array Int Int))) (let ((.cse29 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse19))) (or (< .cse29 .cse17) (= c_~max1~0 .cse29)))) (or (forall ((v_ArrVal_800 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse19))) .cse6)))))))) is different from false [2023-12-02 18:02:15,241 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| c_~A~0.base))) (let ((.cse19 (* 4 c_~M~0)) (.cse15 (select .cse18 0))) (let ((.cse16 (= c_~max1~0 0)) (.cse12 (+ .cse15 1)) (.cse17 (= c_~max2~0 0)) (.cse20 (<= .cse15 0)) (.cse11 (= .cse15 c_~max2~0)) (.cse23 (<= 1 .cse15)) (.cse24 (select .cse18 (+ c_~A~0.offset (* c_thread2Thread1of1ForFork2_~i~1 4)))) (.cse2 (+ c_~max2~0 1)) (.cse3 (+ c_~A~0.offset .cse19)) (.cse7 (= c_~max1~0 c_~max2~0))) (and (or (< c_~M~0 1) (and (forall ((v_ArrVal_799 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_799))) (or (< c_~max2~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_800 (Array Int Int))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse3))) (or (< .cse1 .cse2) (= c_~max1~0 .cse1))))))) (forall ((v_ArrVal_799 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_799))) (let ((.cse4 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (< .cse4 .cse2) (forall ((v_ArrVal_800 (Array Int Int))) (< .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse3))) (= c_~max1~0 .cse4))))) (or (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_800 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_799))) (or (< c_~max2~0 (select (select .cse6 c_~A~0.base) c_~A~0.offset)) (< c_~max2~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse3))))) .cse7) (forall ((v_ArrVal_799 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_799))) (let ((.cse9 (select (select .cse10 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_800 (Array Int Int))) (let ((.cse8 (select (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse3))) (or (= c_~max1~0 .cse8) (< .cse8 (+ .cse9 1))))) (< .cse9 .cse2))))))) (let ((.cse13 (select .cse18 .cse19))) (let ((.cse14 (= c_~max1~0 .cse13))) (or (and .cse11 (or (and (<= .cse12 .cse13) .cse14) (and .cse7 (<= .cse13 .cse15)))) (and (or (and .cse16 (<= .cse13 0)) (and (<= 1 .cse13) .cse14)) .cse17)))) (= c_thread3Thread1of1ForFork0_~i~2 1) (= c_~M~0 1) (let ((.cse21 (select .cse18 4))) (let ((.cse22 (= c_~max1~0 .cse21))) (or (and .cse20 (or (and (<= 1 .cse21) .cse22) (and (<= .cse21 0) .cse16))) (and (or (and .cse22 (<= .cse12 .cse21)) (and (= .cse15 c_~max1~0) (<= .cse21 .cse15))) .cse23)))) (<= (+ 2 c_~A~0.base) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= c_~A~0.offset 0) (or (< .cse24 .cse2) (and (forall ((v_ArrVal_800 (Array Int Int))) (let ((.cse25 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse3))) (or (< .cse25 (+ .cse24 1)) (= c_~max1~0 .cse25)))) (or (= c_~max1~0 .cse24) (forall ((v_ArrVal_800 (Array Int Int))) (< .cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse3)))))) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (= c_thread2Thread1of1ForFork2_~i~1 0) (or (and .cse17 .cse20) (and .cse11 .cse23)) (or (< c_~max2~0 .cse24) (and (forall ((v_ArrVal_800 (Array Int Int))) (let ((.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse3))) (or (< .cse26 .cse2) (= c_~max1~0 .cse26)))) (or (forall ((v_ArrVal_800 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_800) c_~A~0.base) .cse3))) .cse7))))))) is different from false [2023-12-02 18:02:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:02:30,896 INFO L93 Difference]: Finished difference Result 3881 states and 12784 transitions. [2023-12-02 18:02:30,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-12-02 18:02:30,898 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 48 states have internal predecessors, (99), 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) Word has length 35 [2023-12-02 18:02:30,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:02:30,905 INFO L225 Difference]: With dead ends: 3881 [2023-12-02 18:02:30,905 INFO L226 Difference]: Without dead ends: 3839 [2023-12-02 18:02:30,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3058 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1035, Invalid=9423, Unknown=56, NotChecked=406, Total=10920 [2023-12-02 18:02:30,906 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 905 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 5621 mSolverCounterSat, 151 mSolverCounterUnsat, 425 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 6933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 5621 IncrementalHoareTripleChecker+Invalid, 425 IncrementalHoareTripleChecker+Unknown, 736 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:02:30,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 235 Invalid, 6933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 5621 Invalid, 425 Unknown, 736 Unchecked, 15.0s Time] [2023-12-02 18:02:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2023-12-02 18:02:30,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 1363. [2023-12-02 18:02:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1362 states have (on average 3.381057268722467) internal successors, (4605), 1362 states have internal predecessors, (4605), 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) [2023-12-02 18:02:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 4605 transitions. [2023-12-02 18:02:30,944 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 4605 transitions. Word has length 35 [2023-12-02 18:02:30,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:02:30,944 INFO L495 AbstractCegarLoop]: Abstraction has 1363 states and 4605 transitions. [2023-12-02 18:02:30,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 48 states have internal predecessors, (99), 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) [2023-12-02 18:02:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 4605 transitions. [2023-12-02 18:02:30,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 18:02:30,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:02:30,947 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1] [2023-12-02 18:02:30,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 18:02:31,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 18:02:31,147 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 18:02:31,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:02:31,148 INFO L85 PathProgramCache]: Analyzing trace with hash 928596436, now seen corresponding path program 3 times [2023-12-02 18:02:31,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:02:31,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089252210] [2023-12-02 18:02:31,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:31,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:02:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:02:33,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:02:33,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089252210] [2023-12-02 18:02:33,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089252210] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:02:33,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139211681] [2023-12-02 18:02:33,219 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:02:33,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:02:33,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:02:33,220 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:02:33,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 18:02:33,320 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:02:33,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:02:33,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-02 18:02:33,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:02:34,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:02:34,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 105 [2023-12-02 18:02:35,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:02:35,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 105 [2023-12-02 18:02:36,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:02:36,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:02:36,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 187 treesize of output 213 [2023-12-02 18:02:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 18:02:39,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:02:39,549 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~max2~0 1)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ c_~A~0.offset (* c_thread2Thread1of1ForFork2_~i~1 4)))) (and (forall ((v_ArrVal_838 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_838) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse4))) (or (< .cse0 (select .cse1 .cse2)) (< .cse0 .cse3) (= c_~max1~0 .cse0))))) (forall ((v_ArrVal_838 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_838) c_~A~0.base))) (let ((.cse5 (select .cse7 .cse4)) (.cse6 (select .cse7 .cse2))) (or (< .cse5 .cse3) (< .cse6 (+ 1 .cse5)) (= .cse6 c_~max1~0))))) (forall ((v_ArrVal_838 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_838) c_~A~0.base))) (let ((.cse9 (select .cse8 .cse2))) (or (< c_~max2~0 (select .cse8 .cse4)) (< .cse9 .cse3) (= .cse9 c_~max1~0))))) (or (forall ((v_ArrVal_838 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_838) c_~A~0.base))) (or (< c_~max2~0 (select .cse10 .cse2)) (< c_~max2~0 (select .cse10 .cse4))))) (= c_~max1~0 c_~max2~0)))) is different from false [2023-12-02 18:02:42,009 INFO L349 Elim1Store]: treesize reduction 8, result has 96.4 percent of original size [2023-12-02 18:02:42,010 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 2600 treesize of output 2356 [2023-12-02 18:02:42,156 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:42,157 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 1356 treesize of output 1340 [2023-12-02 18:02:42,280 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:42,281 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 1340 treesize of output 1308 [2023-12-02 18:02:42,395 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:42,396 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 1308 treesize of output 1294 [2023-12-02 18:02:42,486 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:42,486 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 1294 treesize of output 1266 [2023-12-02 18:02:42,576 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:42,577 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 1266 treesize of output 1242 [2023-12-02 18:02:42,688 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:42,689 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 1242 treesize of output 1230 [2023-12-02 18:02:42,797 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:42,798 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 1230 treesize of output 1222 [2023-12-02 18:02:42,890 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:42,891 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 1222 treesize of output 1206 [2023-12-02 18:02:42,976 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:42,977 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 1206 treesize of output 1190 [2023-12-02 18:02:43,105 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:43,106 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 1190 treesize of output 1182 [2023-12-02 18:02:43,218 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:43,219 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 1182 treesize of output 1158 [2023-12-02 18:02:43,362 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:43,363 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 1158 treesize of output 1146 [2023-12-02 18:02:43,479 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:43,480 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 1146 treesize of output 1130 [2023-12-02 18:02:43,562 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:43,563 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 1130 treesize of output 1098 [2023-12-02 18:02:43,665 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:43,665 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 1098 treesize of output 1084 [2023-12-02 18:02:43,752 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:43,752 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 1084 treesize of output 1056 [2023-12-02 18:03:09,488 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 18:03:19,239 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 18:04:22,039 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 18:05:13,670 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 18:05:21,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-12-02 18:05:21,382 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-02 18:05:21,383 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2023-12-02 18:05:21,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [737261469] [2023-12-02 18:05:21,383 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 18:05:21,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:05:21,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2023-12-02 18:05:21,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451830550] [2023-12-02 18:05:21,384 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-02 18:05:21,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 18:05:21,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:05:21,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 18:05:21,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1694, Unknown=8, NotChecked=84, Total=1980 [2023-12-02 18:05:21,385 INFO L87 Difference]: Start difference. First operand 1363 states and 4605 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 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) [2023-12-02 18:05:21,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=194, Invalid=1694, Unknown=8, NotChecked=84, Total=1980 [2023-12-02 18:05:21,386 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:05:21,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:05:21,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 18:05:21,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:05:21,587 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:365) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2023-12-02 18:05:21,589 INFO L158 Benchmark]: Toolchain (without parser) took 248367.48ms. Allocated memory was 138.4MB in the beginning and 539.0MB in the end (delta: 400.6MB). Free memory was 97.6MB in the beginning and 184.1MB in the end (delta: -86.5MB). Peak memory consumption was 315.6MB. Max. memory is 16.1GB. [2023-12-02 18:05:21,589 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 104.9MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:05:21,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.06ms. Allocated memory is still 138.4MB. Free memory was 97.1MB in the beginning and 85.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 18:05:21,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.52ms. Allocated memory is still 138.4MB. Free memory was 85.0MB in the beginning and 83.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:05:21,590 INFO L158 Benchmark]: Boogie Preprocessor took 27.84ms. Allocated memory is still 138.4MB. Free memory was 83.5MB in the beginning and 81.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 18:05:21,590 INFO L158 Benchmark]: RCFGBuilder took 646.50ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 81.9MB in the beginning and 133.5MB in the end (delta: -51.6MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2023-12-02 18:05:21,590 INFO L158 Benchmark]: TraceAbstraction took 247420.91ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 132.4MB in the beginning and 185.2MB in the end (delta: -52.7MB). Peak memory consumption was 309.0MB. Max. memory is 16.1GB. [2023-12-02 18:05:21,591 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.21ms. Allocated memory is still 104.9MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.06ms. Allocated memory is still 138.4MB. Free memory was 97.1MB in the beginning and 85.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.52ms. Allocated memory is still 138.4MB. Free memory was 85.0MB in the beginning and 83.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.84ms. Allocated memory is still 138.4MB. Free memory was 83.5MB in the beginning and 81.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 646.50ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 81.9MB in the beginning and 133.5MB in the end (delta: -51.6MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * TraceAbstraction took 247420.91ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 132.4MB in the beginning and 185.2MB in the end (delta: -52.7MB). Peak memory consumption was 309.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) 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: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:05:23,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:05:23,436 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 18:05:23,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:05:23,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:05:23,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:05:23,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:05:23,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:05:23,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:05:23,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:05:23,472 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:05:23,472 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:05:23,473 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:05:23,474 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:05:23,474 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:05:23,475 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:05:23,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:05:23,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 18:05:23,477 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:05:23,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:05:23,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:05:23,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 18:05:23,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:05:23,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 18:05:23,480 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 18:05:23,481 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 18:05:23,481 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 18:05:23,481 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:05:23,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 18:05:23,482 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:05:23,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:05:23,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 18:05:23,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:05:23,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:05:23,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:05:23,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:05:23,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:05:23,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 18:05:23,485 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 18:05:23,485 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 18:05:23,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:05:23,486 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 18:05:23,486 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:05:23,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:05:23,487 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 [2023-12-02 18:05:23,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:05:23,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:05:23,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:05:23,821 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:05:23,822 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:05:23,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2023-12-02 18:05:26,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:05:26,820 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:05:26,821 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2023-12-02 18:05:26,830 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/data/c71f74d72/30fc221b9f854d0e8cee490429d711ad/FLAG612a9c1b3 [2023-12-02 18:05:26,845 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/data/c71f74d72/30fc221b9f854d0e8cee490429d711ad [2023-12-02 18:05:26,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:05:26,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:05:26,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:05:26,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:05:26,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:05:26,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:05:26" (1/1) ... [2023-12-02 18:05:26,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c33779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:26, skipping insertion in model container [2023-12-02 18:05:26,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:05:26" (1/1) ... [2023-12-02 18:05:26,886 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:05:27,071 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c[2592,2605] [2023-12-02 18:05:27,082 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:05:27,095 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 18:05:27,100 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:05:27,113 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c[2592,2605] [2023-12-02 18:05:27,117 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:05:27,122 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:05:27,145 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c[2592,2605] [2023-12-02 18:05:27,149 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:05:27,159 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 18:05:27,159 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 18:05:27,166 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:05:27,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:27 WrapperNode [2023-12-02 18:05:27,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:05:27,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:05:27,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:05:27,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:05:27,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:27" (1/1) ... [2023-12-02 18:05:27,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:27" (1/1) ... [2023-12-02 18:05:27,208 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2023-12-02 18:05:27,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:05:27,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:05:27,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:05:27,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:05:27,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:27" (1/1) ... [2023-12-02 18:05:27,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:27" (1/1) ... [2023-12-02 18:05:27,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:27" (1/1) ... [2023-12-02 18:05:27,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:27" (1/1) ... [2023-12-02 18:05:27,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:27" (1/1) ... [2023-12-02 18:05:27,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:27" (1/1) ... [2023-12-02 18:05:27,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:27" (1/1) ... [2023-12-02 18:05:27,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:27" (1/1) ... [2023-12-02 18:05:27,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:05:27,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:05:27,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:05:27,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:05:27,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:27" (1/1) ... [2023-12-02 18:05:27,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:05:27,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:05:27,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:05:27,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:05:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:05:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 18:05:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 18:05:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 18:05:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 18:05:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 18:05:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 18:05:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 18:05:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-02 18:05:27,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-02 18:05:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 18:05:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 18:05:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 18:05:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:05:27,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:05:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 18:05:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 18:05:27,337 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 18:05:27,470 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:05:27,473 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:05:27,840 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:05:28,110 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:05:28,110 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 18:05:28,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:05:28 BoogieIcfgContainer [2023-12-02 18:05:28,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:05:28,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:05:28,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:05:28,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:05:28,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:05:26" (1/3) ... [2023-12-02 18:05:28,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba80deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:05:28, skipping insertion in model container [2023-12-02 18:05:28,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:27" (2/3) ... [2023-12-02 18:05:28,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba80deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:05:28, skipping insertion in model container [2023-12-02 18:05:28,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:05:28" (3/3) ... [2023-12-02 18:05:28,119 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2023-12-02 18:05:28,129 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 18:05:28,139 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:05:28,139 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 18:05:28,139 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 18:05:28,200 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-02 18:05:28,229 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 35 transitions, 91 flow [2023-12-02 18:05:28,282 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 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) [2023-12-02 18:05:28,301 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:05:28,308 INFO L357 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3fe518ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:05:28,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-02 18:05:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 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) [2023-12-02 18:05:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 18:05:28,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:05:28,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:05:28,330 INFO L420 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)] === [2023-12-02 18:05:28,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:05:28,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1820095507, now seen corresponding path program 1 times [2023-12-02 18:05:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:05:28,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890935068] [2023-12-02 18:05:28,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:05:28,349 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 [2023-12-02 18:05:28,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:05:28,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 18:05:28,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 18:05:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:05:28,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:05:28,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:05:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:05:28,723 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:05:28,724 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:05:28,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890935068] [2023-12-02 18:05:28,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890935068] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:05:28,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:05:28,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:05:28,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860949426] [2023-12-02 18:05:28,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:05:28,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:05:28,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:05:28,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:05:28,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:05:28,764 INFO L87 Difference]: Start difference. First operand has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 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) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:05:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:05:28,963 INFO L93 Difference]: Finished difference Result 579 states and 1878 transitions. [2023-12-02 18:05:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:05:28,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 18:05:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:05:28,984 INFO L225 Difference]: With dead ends: 579 [2023-12-02 18:05:28,984 INFO L226 Difference]: Without dead ends: 572 [2023-12-02 18:05:28,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:05:28,989 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:05:28,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:05:29,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2023-12-02 18:05:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 466. [2023-12-02 18:05:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 3.2451612903225806) internal successors, (1509), 465 states have internal predecessors, (1509), 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) [2023-12-02 18:05:29,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1509 transitions. [2023-12-02 18:05:29,069 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1509 transitions. Word has length 21 [2023-12-02 18:05:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:05:29,070 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 1509 transitions. [2023-12-02 18:05:29,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:05:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1509 transitions. [2023-12-02 18:05:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 18:05:29,075 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:05:29,075 INFO L195 NwaCegarLoop]: 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] [2023-12-02 18:05:29,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 18:05:29,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 18:05:29,279 INFO L420 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)] === [2023-12-02 18:05:29,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:05:29,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2036814814, now seen corresponding path program 1 times [2023-12-02 18:05:29,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:05:29,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105241019] [2023-12-02 18:05:29,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:05:29,281 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 [2023-12-02 18:05:29,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:05:29,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 18:05:29,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 18:05:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:05:29,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 18:05:29,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:05:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:05:29,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:05:29,650 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:05:29,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105241019] [2023-12-02 18:05:29,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105241019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:05:29,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:05:29,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 18:05:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870384341] [2023-12-02 18:05:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:05:29,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:05:29,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:05:29,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:05:29,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:05:29,654 INFO L87 Difference]: Start difference. First operand 466 states and 1509 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:05:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:05:30,103 INFO L93 Difference]: Finished difference Result 696 states and 2314 transitions. [2023-12-02 18:05:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:05:30,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-02 18:05:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:05:30,112 INFO L225 Difference]: With dead ends: 696 [2023-12-02 18:05:30,112 INFO L226 Difference]: Without dead ends: 696 [2023-12-02 18:05:30,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:05:30,114 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 76 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:05:30,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 3 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:05:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2023-12-02 18:05:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 512. [2023-12-02 18:05:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 3.275929549902153) internal successors, (1674), 511 states have internal predecessors, (1674), 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) [2023-12-02 18:05:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1674 transitions. [2023-12-02 18:05:30,148 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1674 transitions. Word has length 24 [2023-12-02 18:05:30,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:05:30,149 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 1674 transitions. [2023-12-02 18:05:30,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:05:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1674 transitions. [2023-12-02 18:05:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 18:05:30,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:05:30,153 INFO L195 NwaCegarLoop]: 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] [2023-12-02 18:05:30,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 18:05:30,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 18:05:30,355 INFO L420 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)] === [2023-12-02 18:05:30,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:05:30,356 INFO L85 PathProgramCache]: Analyzing trace with hash 533102170, now seen corresponding path program 2 times [2023-12-02 18:05:30,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:05:30,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972746195] [2023-12-02 18:05:30,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:05:30,357 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 [2023-12-02 18:05:30,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:05:30,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 18:05:30,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 18:05:30,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-02 18:05:30,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:05:30,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:05:30,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:05:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:05:30,492 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:05:30,492 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:05:30,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972746195] [2023-12-02 18:05:30,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972746195] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:05:30,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:05:30,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:05:30,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863653591] [2023-12-02 18:05:30,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:05:30,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:05:30,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:05:30,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:05:30,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:05:30,495 INFO L87 Difference]: Start difference. First operand 512 states and 1674 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:05:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:05:30,630 INFO L93 Difference]: Finished difference Result 513 states and 1675 transitions. [2023-12-02 18:05:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:05:30,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-02 18:05:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:05:30,634 INFO L225 Difference]: With dead ends: 513 [2023-12-02 18:05:30,651 INFO L226 Difference]: Without dead ends: 513 [2023-12-02 18:05:30,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:05:30,653 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:05:30,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:05:30,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2023-12-02 18:05:30,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2023-12-02 18:05:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 3.271484375) internal successors, (1675), 512 states have internal predecessors, (1675), 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) [2023-12-02 18:05:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1675 transitions. [2023-12-02 18:05:30,677 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1675 transitions. Word has length 24 [2023-12-02 18:05:30,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:05:30,677 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 1675 transitions. [2023-12-02 18:05:30,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:05:30,677 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1675 transitions. [2023-12-02 18:05:30,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 18:05:30,679 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:05:30,679 INFO L195 NwaCegarLoop]: 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] [2023-12-02 18:05:30,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 18:05:30,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 18:05:30,880 INFO L420 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)] === [2023-12-02 18:05:30,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:05:30,881 INFO L85 PathProgramCache]: Analyzing trace with hash 959188651, now seen corresponding path program 1 times [2023-12-02 18:05:30,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:05:30,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700380441] [2023-12-02 18:05:30,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:05:30,882 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 [2023-12-02 18:05:30,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:05:30,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 18:05:30,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 18:05:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:05:31,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 18:05:31,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:05:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:05:31,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:05:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:05:31,257 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:05:31,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700380441] [2023-12-02 18:05:31,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700380441] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 18:05:31,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:05:31,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-12-02 18:05:31,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567332188] [2023-12-02 18:05:31,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:05:31,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:05:31,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:05:31,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:05:31,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 18:05:31,260 INFO L87 Difference]: Start difference. First operand 513 states and 1675 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:05:31,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:05:31,484 INFO L93 Difference]: Finished difference Result 585 states and 1919 transitions. [2023-12-02 18:05:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:05:31,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-02 18:05:31,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:05:31,490 INFO L225 Difference]: With dead ends: 585 [2023-12-02 18:05:31,490 INFO L226 Difference]: Without dead ends: 585 [2023-12-02 18:05:31,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 18:05:31,492 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 34 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:05:31,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:05:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-12-02 18:05:31,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 511. [2023-12-02 18:05:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 3.2862745098039214) internal successors, (1676), 510 states have internal predecessors, (1676), 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) [2023-12-02 18:05:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1676 transitions. [2023-12-02 18:05:31,516 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 1676 transitions. Word has length 25 [2023-12-02 18:05:31,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:05:31,517 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 1676 transitions. [2023-12-02 18:05:31,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:05:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 1676 transitions. [2023-12-02 18:05:31,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 18:05:31,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:05:31,520 INFO L195 NwaCegarLoop]: 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, 1] [2023-12-02 18:05:31,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 18:05:31,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 18:05:31,721 INFO L420 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)] === [2023-12-02 18:05:31,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:05:31,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1845522776, now seen corresponding path program 1 times [2023-12-02 18:05:31,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:05:31,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306988679] [2023-12-02 18:05:31,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:05:31,722 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 [2023-12-02 18:05:31,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:05:31,723 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 18:05:31,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 18:05:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:05:31,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 18:05:31,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:05:31,971 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 250 treesize of output 242 [2023-12-02 18:05:32,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 64 [2023-12-02 18:05:32,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:05:32,908 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:05:32,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:05:32,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:05:32,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:05:32,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:05:32,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:05:32,919 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:05:32,921 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:05:32,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:05:32,924 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:05:32,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:05:32,942 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 207 treesize of output 81 [2023-12-02 18:05:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:05:33,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:05:33,688 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (bvmul (_ bv4 32) c_~M~0))) (let ((.cse2 (bvadd .cse7 (_ bv3 32) c_~A~0.offset)) (.cse3 (bvadd .cse7 (_ bv2 32) c_~A~0.offset)) (.cse4 (bvadd .cse7 c_~A~0.offset (_ bv1 32))) (.cse5 (bvadd .cse7 c_~A~0.offset))) (and (forall ((v_ArrVal_129 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base))) (concat (concat (concat (select .cse1 .cse2) (select .cse1 .cse3)) (select .cse1 .cse4)) (select .cse1 .cse5))))) (or (= .cse0 c_~max1~0) (not (bvslt c_~max2~0 .cse0))))) (or (forall ((v_ArrVal_129 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt c_~max2~0 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base))) (concat (concat (concat (select .cse6 .cse2) (select .cse6 .cse3)) (select .cse6 .cse4)) (select .cse6 .cse5))))) (= c_~max1~0 c_~max2~0))))) is different from false [2023-12-02 18:05:34,047 INFO L349 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2023-12-02 18:05:34,048 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 422 treesize of output 260 [2023-12-02 18:05:34,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:05:34,072 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 171 treesize of output 117 [2023-12-02 18:05:34,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:05:34,094 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 117 treesize of output 90 [2023-12-02 18:06:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:06:15,846 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:06:15,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306988679] [2023-12-02 18:06:15,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306988679] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:06:15,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [147011549] [2023-12-02 18:06:15,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:06:15,846 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:06:15,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:06:15,848 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:06:15,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-02 18:06:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:06:16,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 18:06:16,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:06:16,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2023-12-02 18:06:17,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:06:17,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2023-12-02 18:06:17,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:06:17,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2023-12-02 18:06:19,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:06:19,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 88 [2023-12-02 18:06:20,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:06:20,731 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:06:20,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:06:20,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:06:20,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:06:20,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:06:20,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:06:20,742 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:06:20,743 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:06:20,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:06:20,745 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:06:20,747 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 85 [2023-12-02 18:06:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:06:23,606 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:06:25,200 WARN L854 $PredicateComparison]: unable to prove that (or (bvslt c_thread2Thread1of1ForFork2_~i~1 c_~M~0) (let ((.cse7 (bvmul (_ bv4 32) c_~M~0))) (let ((.cse1 (bvadd .cse7 (_ bv3 32) c_~A~0.offset)) (.cse2 (bvadd .cse7 (_ bv2 32) c_~A~0.offset)) (.cse3 (bvadd .cse7 c_~A~0.offset (_ bv1 32))) (.cse4 (bvadd .cse7 c_~A~0.offset))) (and (or (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt c_~max2~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_161) c_~A~0.base))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4))))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse5 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_161) c_~A~0.base))) (concat (concat (concat (select .cse6 .cse1) (select .cse6 .cse2)) (select .cse6 .cse3)) (select .cse6 .cse4))))) (or (not (bvslt c_~max2~0 .cse5)) (= .cse5 c_~max1~0))))))) (not (bvslt c_~M~0 c_~N~0))) is different from false [2023-12-02 18:06:39,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:06:39,110 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 456 treesize of output 191 [2023-12-02 18:06:39,768 INFO L349 Elim1Store]: treesize reduction 498, result has 11.2 percent of original size [2023-12-02 18:06:39,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 1066 treesize of output 979 [2023-12-02 18:06:39,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 331 treesize of output 223 [2023-12-02 18:06:39,903 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:06:39,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:06:39,908 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:06:39,909 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:06:39,909 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:06:39,910 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:06:39,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:06:39,915 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:06:39,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:06:39,920 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:06:39,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:06:39,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 105 [2023-12-02 18:06:40,120 INFO L349 Elim1Store]: treesize reduction 156, result has 9.8 percent of original size [2023-12-02 18:06:40,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 185 treesize of output 119 [2023-12-02 18:06:56,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:06:56,420 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 672 treesize of output 247 [2023-12-02 18:06:57,102 INFO L349 Elim1Store]: treesize reduction 502, result has 10.5 percent of original size [2023-12-02 18:06:57,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 1060 treesize of output 969 [2023-12-02 18:06:57,306 INFO L349 Elim1Store]: treesize reduction 156, result has 9.8 percent of original size [2023-12-02 18:06:57,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 550 treesize of output 456 [2023-12-02 18:06:57,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 169 [2023-12-02 18:06:57,541 INFO L349 Elim1Store]: treesize reduction 156, result has 9.8 percent of original size [2023-12-02 18:06:57,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 228 treesize of output 189 [2023-12-02 18:07:24,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:07:24,691 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 697 treesize of output 272 [2023-12-02 18:07:25,395 INFO L349 Elim1Store]: treesize reduction 498, result has 11.2 percent of original size [2023-12-02 18:07:25,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 1824 treesize of output 1667 [2023-12-02 18:07:25,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 670 treesize of output 454 [2023-12-02 18:07:25,496 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:07:25,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:07:25,500 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:07:25,501 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:07:25,502 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:07:25,503 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:07:25,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:07:25,508 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:07:25,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:07:25,512 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:07:25,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:07:25,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 377 treesize of output 309 [2023-12-02 18:07:25,711 INFO L349 Elim1Store]: treesize reduction 156, result has 9.8 percent of original size [2023-12-02 18:07:25,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 389 treesize of output 269 [2023-12-02 18:07:56,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:07:56,269 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 910 treesize of output 325 [2023-12-02 18:07:56,977 INFO L349 Elim1Store]: treesize reduction 500, result has 10.9 percent of original size [2023-12-02 18:07:56,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 9913 treesize of output 8560 [2023-12-02 18:07:57,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 782 treesize of output 566 [2023-12-02 18:07:57,081 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:07:57,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:07:57,085 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:07:57,085 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:07:57,086 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:07:57,087 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:07:57,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:07:57,090 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:07:57,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:07:57,094 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:07:57,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:07:57,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 474 treesize of output 362 [2023-12-02 18:07:57,264 INFO L349 Elim1Store]: treesize reduction 156, result has 9.8 percent of original size [2023-12-02 18:07:57,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 507 treesize of output 331 [2023-12-02 18:08:59,660 WARN L293 SmtUtils]: Spent 49.67s on a formula simplification. DAG size of input: 1463 DAG size of output: 1461 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:08:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:08:59,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [147011549] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:08:59,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831613605] [2023-12-02 18:08:59,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:08:59,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:08:59,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:08:59,679 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:08:59,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b665b2-9005-4a63-bfab-2f289dc09d60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 18:08:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:08:59,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 18:08:59,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:08:59,895 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 60 treesize of output 58 [2023-12-02 18:09:02,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 64 [2023-12-02 18:09:03,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:09:03,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:09:03,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:09:03,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:09:03,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:09:03,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:09:03,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:09:03,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:09:03,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:09:03,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:09:03,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:09:03,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:09:03,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:09:03,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 207 treesize of output 109 [2023-12-02 18:09:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:09:21,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:09:25,986 WARN L854 $PredicateComparison]: unable to prove that (or (bvslt (bvadd c_thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) c_~N~0) (let ((.cse7 (bvmul (_ bv4 32) c_~M~0))) (let ((.cse2 (bvadd .cse7 (_ bv3 32) c_~A~0.offset)) (.cse3 (bvadd .cse7 (_ bv2 32) c_~A~0.offset)) (.cse4 (bvadd .cse7 c_~A~0.offset (_ bv1 32))) (.cse5 (bvadd .cse7 c_~A~0.offset))) (and (forall ((v_ArrVal_193 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (concat (concat (concat (select .cse1 .cse2) (select .cse1 .cse3)) (select .cse1 .cse4)) (select .cse1 .cse5))))) (or (not (bvslt c_~max2~0 .cse0)) (= .cse0 c_~max1~0)))) (or (forall ((v_ArrVal_193 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt c_~max2~0 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (concat (concat (concat (select .cse6 .cse2) (select .cse6 .cse3)) (select .cse6 .cse4)) (select .cse6 .cse5))))) (= c_~max1~0 c_~max2~0))))) (not (bvslt c_~M~0 c_~N~0))) is different from false [2023-12-02 18:09:26,518 INFO L349 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2023-12-02 18:09:26,519 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 422 treesize of output 260 [2023-12-02 18:09:26,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:09:26,550 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 171 treesize of output 144 [2023-12-02 18:09:26,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:09:26,576 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 144 treesize of output 90 [2023-12-02 18:10:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:10:08,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831613605] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:10:08,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 18:10:08,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 12, 13, 10, 11] total 56 [2023-12-02 18:10:08,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415840888] [2023-12-02 18:10:08,185 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 18:10:08,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-12-02 18:10:08,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:10:08,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-12-02 18:10:08,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2500, Unknown=31, NotChecked=318, Total=3192 [2023-12-02 18:10:08,188 INFO L87 Difference]: Start difference. First operand 511 states and 1676 transitions. Second operand has 57 states, 57 states have (on average 2.43859649122807) internal successors, (139), 56 states have internal predecessors, (139), 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) [2023-12-02 18:10:54,288 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0))) (and (or (bvslt c_thread1Thread1of1ForFork1_~i~0 c_~N~0) .cse0) (or (bvslt (_ bv0 32) c_~M~0) (let ((.cse13 (bvmul (_ bv4 32) c_~M~0))) (let ((.cse10 (let ((.cse14 (select |c_#memory_int| c_~A~0.base))) (concat (concat (concat (select .cse14 (bvadd (_ bv3 32) c_~A~0.offset)) (select .cse14 (bvadd (_ bv2 32) c_~A~0.offset))) (select .cse14 (bvadd c_~A~0.offset (_ bv1 32)))) (select .cse14 c_~A~0.offset)))) (.cse5 (bvadd .cse13 (_ bv3 32) c_~A~0.offset)) (.cse6 (bvadd .cse13 (_ bv2 32) c_~A~0.offset)) (.cse7 (bvadd .cse13 c_~A~0.offset (_ bv1 32))) (.cse8 (bvadd .cse13 c_~A~0.offset))) (let ((.cse2 (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt c_~max2~0 (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_161) c_~A~0.base))) (concat (concat (concat (select .cse12 .cse5) (select .cse12 .cse6)) (select .cse12 .cse7)) (select .cse12 .cse8)))))) (.cse1 (bvslt c_~max1~0 .cse10))) (and (or .cse1 (and (or .cse2 .cse0) (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse3 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_161) c_~A~0.base))) (concat (concat (concat (select .cse4 .cse5) (select .cse4 .cse6)) (select .cse4 .cse7)) (select .cse4 .cse8))))) (or (not (bvslt c_~max2~0 .cse3)) (= .cse3 c_~max1~0)))))) (or (and (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse9 (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_161) c_~A~0.base))) (concat (concat (concat (select .cse11 .cse5) (select .cse11 .cse6)) (select .cse11 .cse7)) (select .cse11 .cse8))))) (or (not (bvslt c_~max2~0 .cse9)) (= .cse9 .cse10)))) (or .cse2 (= .cse10 c_~max2~0))) (not .cse1)))))) (not (bvslt c_~M~0 c_~N~0))))) is different from false [2023-12-02 18:12:37,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 18:12:38,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 18:13:17,050 WARN L293 SmtUtils]: Spent 32.07s on a formula simplification. DAG size of input: 1138 DAG size of output: 819 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:14:09,097 WARN L293 SmtUtils]: Spent 17.46s on a formula simplification. DAG size of input: 615 DAG size of output: 514 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:14:14,711 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse142 (bvmul (_ bv4 32) c_~M~0)) (.cse136 (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) (let ((.cse24 (forall ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (let ((.cse348 (concat (concat (concat v_arrayElimCell_19 v_arrayElimCell_20) v_arrayElimCell_22) v_arrayElimCell_21))) (or (not (bvslt c_~max2~0 .cse348)) (= .cse348 c_~max1~0))))) (.cse339 (forall ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14)))) (.cse200 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)))) (.cse133 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)))) (.cse25 (not .cse136)) (.cse16 (bvadd .cse142 (_ bv3 32) c_~A~0.offset)) (.cse17 (bvadd .cse142 (_ bv2 32) c_~A~0.offset)) (.cse18 (bvadd .cse142 c_~A~0.offset (_ bv1 32))) (.cse20 (select |c_#memory_int| c_~A~0.base)) (.cse19 (bvadd .cse142 c_~A~0.offset))) (let ((.cse135 (concat (concat (concat (select .cse20 .cse16) (select .cse20 .cse17)) (select .cse20 .cse18)) (select .cse20 .cse19))) (.cse141 (let ((.cse347 (bvmul (_ bv4 32) c_thread3Thread1of1ForFork0_~i~2))) (concat (concat (concat (select .cse20 (bvadd .cse347 (_ bv3 32) c_~A~0.offset)) (select .cse20 (bvadd .cse347 (_ bv2 32) c_~A~0.offset))) (select .cse20 (bvadd .cse347 c_~A~0.offset (_ bv1 32)))) (select .cse20 (bvadd .cse347 c_~A~0.offset))))) (.cse12 (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt c_~max2~0 (let ((.cse346 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_161) c_~A~0.base))) (concat (concat (concat (select .cse346 .cse16) (select .cse346 .cse17)) (select .cse346 .cse18)) (select .cse346 .cse19)))))) (.cse1 (or .cse25 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (let ((.cse345 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse345 c_~max2~0) (not (bvslt c_~max1~0 .cse345))))))) (.cse23 (or .cse25 .cse133)) (.cse21 (bvmul c_thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (.cse199 (forall ((v_arrayElimCell_175 (_ BitVec 8)) (v_arrayElimCell_174 (_ BitVec 8)) (v_arrayElimCell_173 (_ BitVec 8)) (v_arrayElimCell_172 (_ BitVec 8))) (let ((.cse344 (concat (concat (concat v_arrayElimCell_172 v_arrayElimCell_173) v_arrayElimCell_175) v_arrayElimCell_174))) (or (= c_~max1~0 .cse344) (not (bvslt c_~max2~0 .cse344)))))) (.cse181 (or .cse25 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse343 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167))) (or (not (bvslt c_~max1~0 .cse343)) (= .cse343 c_~max2~0)))))) (.cse179 (and .cse136 (forall ((v_arrayElimCell_168 (_ BitVec 8)) (v_arrayElimCell_169 (_ BitVec 8)) (v_arrayElimCell_171 (_ BitVec 8)) (v_arrayElimCell_170 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_168 v_arrayElimCell_169) v_arrayElimCell_171) v_arrayElimCell_170))))) (.cse186 (or .cse200 .cse25)) (.cse143 (or .cse24 .cse25 .cse339)) (.cse160 (or .cse25 (forall ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (let ((.cse341 (concat (concat (concat v_arrayElimCell_19 v_arrayElimCell_20) v_arrayElimCell_22) v_arrayElimCell_21)) (.cse342 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse341 .cse342) (not (bvslt c_~max2~0 .cse341)) (not (bvslt c_~max1~0 .cse342))))))) (.cse144 (or (forall ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (let ((.cse340 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= c_~max2~0 .cse340) (not (bvslt c_~max1~0 .cse340))))) .cse25)) (.cse146 (or .cse25 .cse339)) (.cse0 (and .cse136 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_23 v_arrayElimCell_24) v_arrayElimCell_26) v_arrayElimCell_25))))) (.cse4 (= c_~max1~0 c_~max2~0))) (let ((.cse9 (let ((.cse296 (forall ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18)))) (.cse294 (forall ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse338 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18))) (or (= .cse338 c_~max2~0) (not (bvslt c_~max1~0 .cse338)))))) (.cse299 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_18))))) (let ((.cse293 (and (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))) .cse25)) (.cse305 (or .cse299 .cse25)) (.cse313 (or .cse25 .cse294)) (.cse282 (or (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse337 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_18))) (or (= .cse337 c_~max2~0) (not (bvslt c_~max1~0 .cse337))))) .cse25)) (.cse292 (or .cse25 .cse296))) (and (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse276 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_18)) (.cse277 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse276 .cse277) (not (bvslt c_~max1~0 .cse276)) (not (bvslt c_~max2~0 .cse277)))))) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse279 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (.cse278 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18))) (or (= .cse278 .cse279) (not (bvslt c_~max2~0 .cse279)) (not (bvslt c_~max1~0 .cse278)))))) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse280 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))) (or (not (bvslt c_~max2~0 .cse280)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_18)) (= .cse280 c_~max1~0))))) (or (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse281 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse281 c_~max1~0) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_18)) (not (bvslt c_~max2~0 .cse281))))) .cse136) (or (and .cse282 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse283 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_18))) (or (= .cse283 c_~max2~0) (not (bvslt c_~max1~0 .cse283)) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)))))) .cse0) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse284 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))) (or (= .cse284 c_~max1~0) (not (bvslt c_~max2~0 .cse284)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18)))))) (or (forall ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (let ((.cse287 (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13))) (let ((.cse286 (concat .cse287 v_arrayElimCell_18)) (.cse285 (concat (concat (concat v_arrayElimCell_19 v_arrayElimCell_20) v_arrayElimCell_22) v_arrayElimCell_21))) (or (not (bvslt c_~max2~0 .cse285)) (= .cse286 (concat .cse287 v_arrayElimCell_14)) (not (bvslt c_~max1~0 .cse286)) (= .cse286 .cse285))))) .cse25) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse288 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= c_~max1~0 .cse288) (not (bvslt c_~max2~0 .cse288)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18)))))) (or .cse24 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14) c_~max1~0) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_18)))) .cse25) (or .cse24 .cse25 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse289 (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13))) (or (= c_~max1~0 (concat .cse289 v_arrayElimCell_14)) (bvslt c_~max1~0 (concat .cse289 v_arrayElimCell_18)))))) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse291 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14)) (.cse290 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18))) (or (= .cse290 .cse291) (not (bvslt c_~max2~0 .cse291)) (not (bvslt c_~max1~0 .cse290)))))) (or (and .cse292 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (or (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18))))) .cse0 .cse4) (or .cse24 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (or (= c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18)))) .cse25) (or .cse293 .cse0 .cse294) (or (and (or .cse24 .cse25) (or .cse293 .cse0 .cse4) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse295 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))) (or (not (bvslt c_~max2~0 .cse295)) (= .cse295 c_~max1~0)))))) .cse296) (or (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse298 (concat v_arrayElimCell_16 v_arrayElimCell_12))) (let ((.cse297 (concat (concat .cse298 v_arrayElimCell_17) v_arrayElimCell_14))) (or (= .cse297 c_~max1~0) (bvslt c_~max1~0 (concat (concat .cse298 v_arrayElimCell_13) v_arrayElimCell_18)) (not (bvslt c_~max2~0 .cse297)))))) .cse136) (or .cse299 .cse24 .cse25) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse301 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14)) (.cse300 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18))) (or (= .cse300 .cse301) (not (bvslt c_~max2~0 .cse301)) (not (bvslt c_~max1~0 .cse300)))))) (or (and .cse282 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse302 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_18))) (or (= .cse302 c_~max2~0) (not (bvslt c_~max1~0 .cse302)) (forall ((v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))))))) .cse0) (or (forall ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (let ((.cse303 (concat (concat (concat v_arrayElimCell_19 v_arrayElimCell_20) v_arrayElimCell_22) v_arrayElimCell_21)) (.cse304 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18))) (or (not (bvslt c_~max2~0 .cse303)) (= .cse304 .cse303) (= .cse304 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (not (bvslt c_~max1~0 .cse304))))) .cse25) (or .cse0 (and (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_18)) (forall ((v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))))) .cse305) .cse4) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse307 (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13))) (let ((.cse306 (concat .cse307 v_arrayElimCell_14))) (or (= c_~max1~0 .cse306) (not (bvslt c_~max2~0 .cse306)) (bvslt c_~max1~0 (concat .cse307 v_arrayElimCell_18))))))) (or (and .cse305 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse308 (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13))) (or (bvslt c_~max2~0 (concat .cse308 v_arrayElimCell_14)) (bvslt c_~max1~0 (concat .cse308 v_arrayElimCell_18)))))) .cse0 .cse4) (or (and (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_18)) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)))) .cse305) .cse0 .cse4) (or (and .cse292 (forall ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (or (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18))))) .cse0 .cse4) (or .cse24 .cse25 .cse296) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse309 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (.cse310 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18))) (or (not (bvslt c_~max2~0 .cse309)) (= .cse310 .cse309) (not (bvslt c_~max1~0 .cse310)))))) (or (and .cse305 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse311 (concat v_arrayElimCell_16 v_arrayElimCell_12))) (or (forall ((v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat .cse311 v_arrayElimCell_17) v_arrayElimCell_14))) (bvslt c_~max1~0 (concat (concat .cse311 v_arrayElimCell_13) v_arrayElimCell_18)))))) .cse0 .cse4) (or .cse0 (and (forall ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse312 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18))) (or (= .cse312 c_~max2~0) (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))) (not (bvslt c_~max1~0 .cse312))))) .cse313)) (or .cse25 (forall ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (let ((.cse315 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_18)) (.cse314 (concat (concat (concat v_arrayElimCell_19 v_arrayElimCell_20) v_arrayElimCell_22) v_arrayElimCell_21))) (or (not (bvslt c_~max2~0 .cse314)) (not (bvslt c_~max1~0 .cse315)) (= .cse315 .cse314))))) (or .cse0 (and .cse282 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse316 (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13))) (let ((.cse317 (concat .cse316 v_arrayElimCell_18))) (or (bvslt c_~max2~0 (concat .cse316 v_arrayElimCell_14)) (= .cse317 c_~max2~0) (not (bvslt c_~max1~0 .cse317)))))))) (or (forall ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (let ((.cse319 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_18)) (.cse318 (concat (concat (concat v_arrayElimCell_19 v_arrayElimCell_20) v_arrayElimCell_22) v_arrayElimCell_21))) (or (not (bvslt c_~max2~0 .cse318)) (= .cse319 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (not (bvslt c_~max1~0 .cse319)) (= .cse319 .cse318)))) .cse25) (or (and (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse320 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18))) (or (= .cse320 c_~max2~0) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (not (bvslt c_~max1~0 .cse320))))) .cse313) .cse0) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse323 (concat v_arrayElimCell_16 v_arrayElimCell_12))) (let ((.cse322 (concat (concat .cse323 v_arrayElimCell_17) v_arrayElimCell_14)) (.cse321 (concat (concat .cse323 v_arrayElimCell_13) v_arrayElimCell_18))) (or (= .cse321 .cse322) (not (bvslt c_~max2~0 .cse322)) (not (bvslt c_~max1~0 .cse321))))))) (or (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse324 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse324 c_~max1~0) (not (bvslt c_~max2~0 .cse324)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18))))) .cse136) (or (and (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse325 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18))) (or (= .cse325 c_~max2~0) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (not (bvslt c_~max1~0 .cse325))))) .cse313) .cse0) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse328 (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13))) (let ((.cse327 (concat .cse328 v_arrayElimCell_14)) (.cse326 (concat .cse328 v_arrayElimCell_18))) (or (= .cse326 .cse327) (not (bvslt c_~max2~0 .cse327)) (not (bvslt c_~max1~0 .cse326))))))) (or .cse0 (and (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (let ((.cse329 (concat v_arrayElimCell_16 v_arrayElimCell_12))) (let ((.cse330 (concat (concat .cse329 v_arrayElimCell_13) v_arrayElimCell_18))) (or (forall ((v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat .cse329 v_arrayElimCell_17) v_arrayElimCell_14))) (= .cse330 c_~max2~0) (not (bvslt c_~max1~0 .cse330)))))) .cse282)) (or (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14) c_~max1~0) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18)))) .cse24 .cse25) (or (forall ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (let ((.cse331 (concat (concat (concat v_arrayElimCell_19 v_arrayElimCell_20) v_arrayElimCell_22) v_arrayElimCell_21)) (.cse332 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18))) (or (not (bvslt c_~max2~0 .cse331)) (= .cse332 .cse331) (not (bvslt c_~max1~0 .cse332))))) .cse25) (or (and .cse292 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18)) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))))) .cse0 .cse4) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse333 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14)) (.cse334 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_18))) (or (not (bvslt c_~max2~0 .cse333)) (= .cse333 .cse334) (not (bvslt c_~max1~0 .cse334)))))) (or (forall ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (let ((.cse335 (concat (concat (concat v_arrayElimCell_19 v_arrayElimCell_20) v_arrayElimCell_22) v_arrayElimCell_21)) (.cse336 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_18))) (or (not (bvslt c_~max2~0 .cse335)) (= .cse336 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (= .cse336 .cse335) (not (bvslt c_~max1~0 .cse336))))) .cse25))))) (.cse10 (bvslt (_ bv0 32) c_~M~0)) (.cse33 (bvadd (_ bv3 32) c_~A~0.offset)) (.cse34 (bvadd (_ bv2 32) c_~A~0.offset)) (.cse35 (bvadd c_~A~0.offset (_ bv1 32))) (.cse8 (and (or .cse0 .cse4 (and (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14)) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)))) .cse146)) .cse143 (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse266 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14)) (.cse267 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse266 .cse267) (not (bvslt c_~max2~0 .cse266)) (not (bvslt c_~max1~0 .cse267)))))) (or .cse0 (and (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (let ((.cse268 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14))) (or (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (= c_~max2~0 .cse268) (not (bvslt c_~max1~0 .cse268))))) .cse144)) (or (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (or (= c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14)))) .cse24 .cse25) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse269 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))) (or (= .cse269 c_~max1~0) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14)) (not (bvslt c_~max2~0 .cse269)))))) (or (forall ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (let ((.cse270 (concat (concat (concat v_arrayElimCell_19 v_arrayElimCell_20) v_arrayElimCell_22) v_arrayElimCell_21)) (.cse271 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse270 .cse271) (not (bvslt c_~max2~0 .cse270)) (not (bvslt c_~max1~0 .cse271)) (= (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14) .cse271)))) .cse25) .cse160 (or .cse0 (and (forall ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (let ((.cse272 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= c_~max2~0 .cse272) (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))) (not (bvslt c_~max1~0 .cse272))))) .cse144)) (or (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (let ((.cse273 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (.cse274 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14))) (or (not (bvslt c_~max2~0 .cse273)) (not (bvslt c_~max1~0 .cse274)) (= .cse273 .cse274)))) .cse136) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (let ((.cse275 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= c_~max1~0 .cse275) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14)) (not (bvslt c_~max2~0 .cse275)))))) (or .cse0 .cse4 (and (forall ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14)) (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))))) .cse146)))) (.cse58 (and (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse252 (concat v_arrayElimCell_165 v_arrayElimCell_161))) (let ((.cse251 (concat (concat .cse252 v_arrayElimCell_166) v_arrayElimCell_163)) (.cse250 (concat (concat .cse252 v_arrayElimCell_162) v_arrayElimCell_167))) (or (not (bvslt c_~max1~0 .cse250)) (not (bvslt c_~max2~0 .cse251)) (= .cse251 .cse250)))))) (or .cse179 (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse253 (concat v_arrayElimCell_165 v_arrayElimCell_161))) (let ((.cse254 (concat (concat .cse253 v_arrayElimCell_162) v_arrayElimCell_167))) (or (bvslt c_~max2~0 (concat (concat .cse253 v_arrayElimCell_166) v_arrayElimCell_167)) (not (bvslt c_~max1~0 .cse254)) (= .cse254 c_~max2~0))))) .cse181)) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse255 (concat v_arrayElimCell_165 v_arrayElimCell_161))) (let ((.cse256 (concat (concat .cse255 v_arrayElimCell_166) v_arrayElimCell_163))) (or (bvslt c_~max1~0 (concat (concat .cse255 v_arrayElimCell_162) v_arrayElimCell_167)) (= .cse256 c_~max1~0) (not (bvslt c_~max2~0 .cse256))))))) (or (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse258 (concat v_arrayElimCell_165 v_arrayElimCell_161))) (let ((.cse257 (concat (concat .cse258 v_arrayElimCell_166) v_arrayElimCell_167))) (or (= .cse257 c_~max1~0) (bvslt c_~max1~0 (concat (concat .cse258 v_arrayElimCell_162) v_arrayElimCell_167)) (not (bvslt c_~max2~0 .cse257)))))) .cse136) (or .cse179 (and .cse181 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse260 (concat v_arrayElimCell_165 v_arrayElimCell_161))) (let ((.cse259 (concat (concat .cse260 v_arrayElimCell_162) v_arrayElimCell_167))) (or (not (bvslt c_~max1~0 .cse259)) (= .cse259 c_~max2~0) (forall ((v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat .cse260 v_arrayElimCell_166) v_arrayElimCell_163))))))))) (or (and .cse186 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse261 (concat v_arrayElimCell_165 v_arrayElimCell_161))) (or (bvslt c_~max2~0 (concat (concat .cse261 v_arrayElimCell_166) v_arrayElimCell_167)) (bvslt c_~max1~0 (concat (concat .cse261 v_arrayElimCell_162) v_arrayElimCell_167)))))) .cse179 .cse4) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse264 (concat v_arrayElimCell_165 v_arrayElimCell_161))) (let ((.cse262 (concat (concat .cse264 v_arrayElimCell_162) v_arrayElimCell_167)) (.cse263 (concat (concat .cse264 v_arrayElimCell_166) v_arrayElimCell_167))) (or (not (bvslt c_~max1~0 .cse262)) (= .cse262 .cse263) (not (bvslt c_~max2~0 .cse263))))))) (or .cse179 (and .cse186 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse265 (concat v_arrayElimCell_165 v_arrayElimCell_161))) (or (bvslt c_~max1~0 (concat (concat .cse265 v_arrayElimCell_162) v_arrayElimCell_167)) (forall ((v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat .cse265 v_arrayElimCell_166) v_arrayElimCell_163))))))) .cse4))) (.cse52 (or .cse179 (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse249 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167))) (or (not (bvslt c_~max1~0 .cse249)) (bvslt c_~max2~0 .cse249) (= .cse249 c_~max2~0)))) .cse181))) (.cse54 (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse248 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167))) (or (bvslt c_~max1~0 .cse248) (= .cse248 c_~max1~0) (not (bvslt c_~max2~0 .cse248))))))) (.cse60 (let ((.cse246 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8))) (let ((.cse247 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (= .cse247 c_~max2~0) (not (bvslt c_~max1~0 .cse247)))))) (.cse215 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8))) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))))) (let ((.cse209 (or .cse25 .cse215)) (.cse213 (or .cse246 .cse25)) (.cse222 (and .cse25 (forall ((v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_163)))))) (and (or .cse179 (and .cse209 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (or (forall ((v_arrayElimCell_163 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_163))) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))))) .cse4) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse210 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_163)) (.cse211 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (not (bvslt c_~max2~0 .cse210)) (= .cse210 .cse211) (not (bvslt c_~max1~0 .cse211)))))) (or .cse179 (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse212 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_167)) (= .cse212 c_~max2~0) (not (bvslt c_~max1~0 .cse212))))) .cse213)) (or .cse179 (and .cse209 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (or (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))))) .cse4) (or .cse179 (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse214 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (= .cse214 c_~max2~0) (not (bvslt c_~max1~0 .cse214))))) .cse213)) (or .cse199 .cse25 .cse215) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse216 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167))) (or (not (bvslt c_~max2~0 .cse216)) (= .cse216 c_~max1~0) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167)))))) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse217 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (.cse218 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (not (bvslt c_~max2~0 .cse217)) (= .cse217 .cse218) (not (bvslt c_~max1~0 .cse218)))))) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse220 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167)) (.cse219 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_167))) (or (= .cse219 .cse220) (not (bvslt c_~max1~0 .cse220)) (not (bvslt c_~max2~0 .cse219)))))) (or (and (or .cse199 .cse25) (or (forall ((v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse221 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_163))) (or (not (bvslt c_~max2~0 .cse221)) (= .cse221 c_~max1~0)))) .cse136) (or .cse179 .cse222 .cse4)) .cse215) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse223 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_163)) (.cse224 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (= .cse223 .cse224) (not (bvslt c_~max2~0 .cse223)) (not (bvslt c_~max1~0 .cse224)))))) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse225 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_163))) (or (= .cse225 c_~max1~0) (not (bvslt c_~max2~0 .cse225)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167)))))) (or .cse179 (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse226 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (= .cse226 c_~max2~0) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (not (bvslt c_~max1~0 .cse226))))) .cse213)) (or .cse179 (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167)) (forall ((v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_163))))) .cse209) .cse4) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse227 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_163))) (or (= .cse227 c_~max1~0) (not (bvslt c_~max2~0 .cse227)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167)))))) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse228 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_167))) (or (= .cse228 c_~max1~0) (not (bvslt c_~max2~0 .cse228)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167)))))) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse229 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_163)) (.cse230 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (= .cse229 .cse230) (not (bvslt c_~max2~0 .cse229)) (not (bvslt c_~max1~0 .cse230)))))) (or (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_175 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_174 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_173 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_172 (_ BitVec 8))) (let ((.cse231 (concat (concat (concat v_arrayElimCell_172 v_arrayElimCell_173) v_arrayElimCell_175) v_arrayElimCell_174)) (.cse232 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (not (bvslt c_~max2~0 .cse231)) (= .cse232 .cse231) (not (bvslt c_~max1~0 .cse232))))) .cse25) (or (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse233 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (= .cse233 c_~max2~0) (not (bvslt c_~max1~0 .cse233)) (forall ((v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_163)))))) .cse213) .cse179) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse234 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (.cse235 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (= .cse234 .cse235) (not (bvslt c_~max2~0 .cse234)) (not (bvslt c_~max1~0 .cse235)))))) (or .cse179 (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (or (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_167)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167)))) .cse209) .cse4) (or .cse179 (and .cse213 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse236 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (= .cse236 c_~max2~0) (forall ((v_arrayElimCell_163 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_163))) (not (bvslt c_~max1~0 .cse236))))))) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse237 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_167))) (or (= .cse237 c_~max1~0) (not (bvslt c_~max2~0 .cse237)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167)))))) (or .cse179 (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (or (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167)))) .cse209) .cse4) (or (and .cse213 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse238 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (= .cse238 c_~max2~0) (forall ((v_arrayElimCell_163 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_163))) (not (bvslt c_~max1~0 .cse238)))))) .cse179) (or (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (or (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_167)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167)))) .cse209) .cse179 .cse4) (or .cse179 (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (or (forall ((v_arrayElimCell_163 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_163))) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167)))) .cse209) .cse4) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse239 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_163)) (.cse240 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (not (bvslt c_~max2~0 .cse239)) (not (bvslt c_~max1~0 .cse240)) (= .cse239 .cse240))))) (or (and .cse213 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse241 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (= .cse241 c_~max2~0) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_167)) (not (bvslt c_~max1~0 .cse241)))))) .cse179) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse242 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_163))) (or (= .cse242 c_~max1~0) (not (bvslt c_~max2~0 .cse242)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167)))))) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse243 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167))) (or (= .cse243 c_~max1~0) (not (bvslt c_~max2~0 .cse243)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167)))))) (or (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_164 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse244 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_167)) (.cse245 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_164) v_arrayElimCell_162) v_arrayElimCell_167))) (or (= .cse244 .cse245) (not (bvslt c_~max2~0 .cse244)) (not (bvslt c_~max1~0 .cse245))))) .cse136) (or .cse246 .cse179 .cse222))))) (.cse53 (and (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse203 (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162))) (let ((.cse202 (concat .cse203 v_arrayElimCell_167)) (.cse201 (concat .cse203 v_arrayElimCell_163))) (or (= .cse201 .cse202) (not (bvslt c_~max1~0 .cse202)) (not (bvslt c_~max2~0 .cse201))))))) (or .cse179 (and .cse181 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse205 (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162))) (let ((.cse204 (concat .cse205 v_arrayElimCell_167))) (or (not (bvslt c_~max1~0 .cse204)) (forall ((v_arrayElimCell_163 (_ BitVec 8))) (bvslt c_~max2~0 (concat .cse205 v_arrayElimCell_163))) (= .cse204 c_~max2~0))))))) (or .cse179 (and .cse186 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse206 (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162))) (or (bvslt c_~max1~0 (concat .cse206 v_arrayElimCell_167)) (forall ((v_arrayElimCell_163 (_ BitVec 8))) (bvslt c_~max2~0 (concat .cse206 v_arrayElimCell_163))))))) .cse4) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse207 (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162))) (let ((.cse208 (concat .cse207 v_arrayElimCell_163))) (or (bvslt c_~max1~0 (concat .cse207 v_arrayElimCell_167)) (= .cse208 c_~max1~0) (not (bvslt c_~max2~0 .cse208))))))))) (.cse55 (or .cse199 .cse200 .cse25)) (.cse57 (or .cse25 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_175 (_ BitVec 8)) (v_arrayElimCell_174 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_173 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_172 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse197 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (.cse198 (concat (concat (concat v_arrayElimCell_172 v_arrayElimCell_173) v_arrayElimCell_175) v_arrayElimCell_174))) (or (= .cse197 .cse198) (not (bvslt c_~max1~0 .cse197)) (not (bvslt c_~max2~0 .cse198))))))) (.cse59 (or .cse179 (and .cse186 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse196 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167))) (or (bvslt c_~max1~0 .cse196) (bvslt c_~max2~0 .cse196))))) .cse4)) (.cse28 (= .cse142 .cse21)) (.cse56 (and (or (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse177 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (.cse178 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_167))) (or (= .cse177 .cse178) (not (bvslt c_~max1~0 .cse177)) (not (bvslt c_~max2~0 .cse178))))) .cse136) (or .cse179 (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse180 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167))) (or (not (bvslt c_~max1~0 .cse180)) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_167)) (= .cse180 c_~max2~0)))) .cse181)) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse182 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_163))) (or (= .cse182 c_~max1~0) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (not (bvslt c_~max2~0 .cse182)))))) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse183 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167))) (or (not (bvslt c_~max2~0 .cse183)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (= .cse183 c_~max1~0))))) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse184 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (.cse185 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_163))) (or (not (bvslt c_~max1~0 .cse184)) (not (bvslt c_~max2~0 .cse185)) (= .cse184 .cse185))))) (or (and .cse186 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_167))))) .cse179 .cse4) (or .cse179 (and .cse186 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (forall ((v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_163)))))) .cse4) (or (and .cse186 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (or (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167))))) .cse179 .cse4) (or .cse179 (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse187 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167))) (or (not (bvslt c_~max1~0 .cse187)) (forall ((v_arrayElimCell_163 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_163))) (= .cse187 c_~max2~0)))) .cse181)) (or .cse179 (and .cse186 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (forall ((v_arrayElimCell_163 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_163)))))) .cse4) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse188 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (.cse189 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167))) (or (not (bvslt c_~max2~0 .cse188)) (not (bvslt c_~max1~0 .cse189)) (= .cse188 .cse189))))) (or .cse179 (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse190 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167))) (or (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (not (bvslt c_~max1~0 .cse190)) (= .cse190 c_~max2~0)))) .cse181)) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse191 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_163))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (not (bvslt c_~max2~0 .cse191)) (= .cse191 c_~max1~0))))) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse192 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (.cse193 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_163))) (or (not (bvslt c_~max1~0 .cse192)) (not (bvslt c_~max2~0 .cse193)) (= .cse192 .cse193))))) (or .cse136 (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse194 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_167))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167)) (= .cse194 c_~max1~0) (not (bvslt c_~max2~0 .cse194)))))) (or .cse179 (and (forall ((v_arrayElimCell_167 (_ BitVec 8)) (v_arrayElimCell_165 (_ BitVec 8)) (v_arrayElimCell_162 (_ BitVec 8)) (v_arrayElimCell_161 (_ BitVec 8))) (let ((.cse195 (concat (concat (concat v_arrayElimCell_165 v_arrayElimCell_161) v_arrayElimCell_162) v_arrayElimCell_167))) (or (not (bvslt c_~max1~0 .cse195)) (forall ((v_arrayElimCell_163 (_ BitVec 8)) (v_arrayElimCell_166 (_ BitVec 8)) (v_arrayElimCell_160 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_160 v_arrayElimCell_161) v_arrayElimCell_166) v_arrayElimCell_163))) (= .cse195 c_~max2~0)))) .cse181)))) (.cse61 (and (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse170 (concat v_arrayElimCell_16 v_arrayElimCell_12))) (let ((.cse169 (concat (concat .cse170 v_arrayElimCell_17) v_arrayElimCell_14))) (or (= .cse169 c_~max1~0) (bvslt c_~max1~0 (concat (concat .cse170 v_arrayElimCell_13) v_arrayElimCell_14)) (not (bvslt c_~max2~0 .cse169))))))) (or .cse0 (and .cse1 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (let ((.cse171 (concat v_arrayElimCell_16 v_arrayElimCell_12))) (let ((.cse172 (concat (concat .cse171 v_arrayElimCell_13) v_arrayElimCell_14))) (or (forall ((v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat .cse171 v_arrayElimCell_17) v_arrayElimCell_14))) (= .cse172 c_~max2~0) (not (bvslt c_~max1~0 .cse172)))))))) (or .cse0 .cse4 (and .cse23 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (let ((.cse173 (concat v_arrayElimCell_16 v_arrayElimCell_12))) (or (forall ((v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat .cse173 v_arrayElimCell_17) v_arrayElimCell_14))) (bvslt c_~max1~0 (concat (concat .cse173 v_arrayElimCell_13) v_arrayElimCell_14))))))) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse176 (concat v_arrayElimCell_16 v_arrayElimCell_12))) (let ((.cse174 (concat (concat .cse176 v_arrayElimCell_17) v_arrayElimCell_14)) (.cse175 (concat (concat .cse176 v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse174 .cse175) (not (bvslt c_~max2~0 .cse174)) (not (bvslt c_~max1~0 .cse175))))))))) (.cse66 (= c_~max1~0 (_ bv0 32))) (.cse75 (= (_ bv0 32) c_~max2~0)) (.cse5 (and (or .cse12 .cse4) (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse167 (let ((.cse168 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_161) c_~A~0.base))) (concat (concat (concat (select .cse168 .cse16) (select .cse168 .cse17)) (select .cse168 .cse18)) (select .cse168 .cse19))))) (or (not (bvslt c_~max2~0 .cse167)) (= .cse167 c_~max1~0)))))) (.cse6 (not (bvslt c_~M~0 c_~N~0))) (.cse27 (and (or (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (= (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14) c_~max1~0))) .cse24 .cse25) (or .cse24 .cse25 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14) c_~max1~0) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14))))) .cse143 (or (and .cse144 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (let ((.cse145 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= c_~max2~0 .cse145) (not (bvslt c_~max1~0 .cse145)) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)))))) .cse0) (or .cse0 (and (forall ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14)) (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))))) .cse146) .cse4) (or .cse25 (forall ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (let ((.cse147 (concat (concat (concat v_arrayElimCell_19 v_arrayElimCell_20) v_arrayElimCell_22) v_arrayElimCell_21)) (.cse148 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (not (bvslt c_~max2~0 .cse147)) (= (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14) .cse148) (not (bvslt c_~max1~0 .cse148)) (= .cse147 .cse148))))) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (let ((.cse149 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (.cse150 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse149 .cse150) (not (bvslt c_~max2~0 .cse149)) (not (bvslt c_~max1~0 .cse150)))))) (or (and .cse23 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))))) .cse0 .cse4) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse151 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14)) (.cse152 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse151 .cse152) (not (bvslt c_~max2~0 .cse151)) (not (bvslt c_~max1~0 .cse152)))))) (or (and (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14)) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)))) .cse146) .cse0 .cse4) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (let ((.cse154 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14)) (.cse153 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse153 .cse154) (not (bvslt c_~max1~0 .cse154)) (not (bvslt c_~max2~0 .cse153)))))) (or (and .cse1 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (let ((.cse155 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse155 c_~max2~0) (not (bvslt c_~max1~0 .cse155)) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)))))) .cse0) (or (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (let ((.cse156 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (= .cse156 c_~max1~0) (not (bvslt c_~max2~0 .cse156))))) .cse136) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse157 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14)) (.cse158 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14))) (or (not (bvslt c_~max2~0 .cse157)) (not (bvslt c_~max1~0 .cse158)) (= .cse157 .cse158))))) (or (and (forall ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (let ((.cse159 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= c_~max2~0 .cse159) (not (bvslt c_~max1~0 .cse159)) (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14)))))) .cse144) .cse0) (or (and (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (forall ((v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))))) .cse23) .cse0 .cse4) .cse160 (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse161 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14)) (not (bvslt c_~max2~0 .cse161)) (= .cse161 c_~max1~0))))) (or (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_17 (_ BitVec 8))) (let ((.cse162 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))) (or (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14)) (not (bvslt c_~max2~0 .cse162)) (= .cse162 c_~max1~0)))) .cse136) (or .cse0 (and (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (let ((.cse163 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse163 c_~max2~0) (forall ((v_arrayElimCell_17 (_ BitVec 8))) (bvslt c_~max2~0 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_17) v_arrayElimCell_14))) (not (bvslt c_~max1~0 .cse163))))) .cse1)) (or (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (let ((.cse164 (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse164 c_~max1~0) (bvslt c_~max1~0 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14)) (not (bvslt c_~max2~0 .cse164))))) .cse136) (or .cse25 (forall ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (let ((.cse165 (concat (concat (concat v_arrayElimCell_19 v_arrayElimCell_20) v_arrayElimCell_22) v_arrayElimCell_21)) (.cse166 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_15) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= .cse165 .cse166) (not (bvslt c_~max2~0 .cse165)) (= (concat (concat (concat v_arrayElimCell_11 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14) .cse166) (not (bvslt c_~max1~0 .cse166)))))))) (.cse7 (= .cse142 (_ bv0 32))) (.cse3 (bvslt c_~max2~0 .cse141)) (.cse134 (bvslt c_~max2~0 .cse135))) (and (or .cse0 (and .cse1 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (let ((.cse2 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (bvslt c_~max2~0 .cse2) (= .cse2 c_~max2~0) (not (bvslt c_~max1~0 .cse2))))))) (or .cse3 .cse4) (or (bvslt c_thread2Thread1of1ForFork2_~i~1 c_~M~0) .cse5 .cse6) (or .cse7 .cse8) (or .cse7 .cse9) (or .cse10 (let ((.cse13 (concat (concat (concat (select .cse20 (bvadd (_ bv3 32) c_~A~0.offset .cse21)) (select .cse20 (bvadd (_ bv2 32) c_~A~0.offset .cse21))) (select .cse20 (bvadd c_~A~0.offset (_ bv1 32) .cse21))) (select .cse20 (bvadd c_~A~0.offset .cse21))))) (let ((.cse11 (bvslt c_~max1~0 .cse13))) (and (or .cse5 .cse11) (or (not .cse11) (and (or .cse12 (= .cse13 c_~max2~0)) (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse14 (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_161) c_~A~0.base))) (concat (concat (concat (select .cse15 .cse16) (select .cse15 .cse17)) (select .cse15 .cse18)) (select .cse15 .cse19))))) (or (= .cse14 .cse13) (not (bvslt c_~max2~0 .cse14)))))))))) .cse6) (= c_thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (or (and (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (let ((.cse22 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (bvslt c_~max1~0 .cse22) (bvslt c_~max2~0 .cse22)))) .cse23) .cse0 .cse4) (or .cse24 .cse25 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (let ((.cse26 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= c_~max1~0 .cse26) (bvslt c_~max1~0 .cse26))))) (or .cse27 .cse28) (or .cse10 (let ((.cse31 (concat (concat (concat (select .cse20 .cse33) (select .cse20 .cse34)) (select .cse20 .cse35)) (select .cse20 c_~A~0.offset)))) (let ((.cse29 (bvslt c_~max1~0 .cse31))) (and (or .cse29 .cse5) (or (and (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse30 (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_161) c_~A~0.base))) (concat (concat (concat (select .cse32 .cse16) (select .cse32 .cse17)) (select .cse32 .cse18)) (select .cse32 .cse19))))) (or (not (bvslt c_~max2~0 .cse30)) (= .cse30 .cse31)))) (or .cse12 (= .cse31 c_~max2~0))) (not .cse29))))) .cse6) (or .cse28 .cse9) (or .cse10 (and (forall ((v_ArrVal_160 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160))) (let ((.cse36 (let ((.cse39 (select .cse38 c_~A~0.base))) (concat (concat (concat (select .cse39 .cse33) (select .cse39 .cse34)) (select .cse39 .cse35)) (select .cse39 c_~A~0.offset))))) (or (= c_~max2~0 .cse36) (not (bvslt c_~max1~0 .cse36)) (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt c_~max2~0 (let ((.cse37 (select (store .cse38 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_161) c_~A~0.base))) (concat (concat (concat (select .cse37 .cse16) (select .cse37 .cse17)) (select .cse37 .cse18)) (select .cse37 .cse19))))))))) (forall ((v_ArrVal_160 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160))) (or (bvslt c_~max1~0 (let ((.cse40 (select .cse41 c_~A~0.base))) (concat (concat (concat (select .cse40 .cse33) (select .cse40 .cse34)) (select .cse40 .cse35)) (select .cse40 c_~A~0.offset)))) (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse42 (let ((.cse43 (select (store .cse41 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_161) c_~A~0.base))) (concat (concat (concat (select .cse43 .cse16) (select .cse43 .cse17)) (select .cse43 .cse18)) (select .cse43 .cse19))))) (or (= .cse42 c_~max1~0) (not (bvslt c_~max2~0 .cse42)))))))) (or (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_160 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160))) (or (bvslt c_~max1~0 (let ((.cse44 (select .cse45 c_~A~0.base))) (concat (concat (concat (select .cse44 .cse33) (select .cse44 .cse34)) (select .cse44 .cse35)) (select .cse44 c_~A~0.offset)))) (bvslt c_~max2~0 (let ((.cse46 (select (store .cse45 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_161) c_~A~0.base))) (concat (concat (concat (select .cse46 .cse16) (select .cse46 .cse17)) (select .cse46 .cse18)) (select .cse46 .cse19))))))) .cse4) (forall ((v_ArrVal_160 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160))) (let ((.cse47 (let ((.cse51 (select .cse50 c_~A~0.base))) (concat (concat (concat (select .cse51 .cse33) (select .cse51 .cse34)) (select .cse51 .cse35)) (select .cse51 c_~A~0.offset))))) (or (not (bvslt c_~max1~0 .cse47)) (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse48 (let ((.cse49 (select (store .cse50 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_161) c_~A~0.base))) (concat (concat (concat (select .cse49 .cse16) (select .cse49 .cse17)) (select .cse49 .cse18)) (select .cse49 .cse19))))) (or (= .cse48 .cse47) (not (bvslt c_~max2~0 .cse48)))))))))) .cse6) (or (bvslt (_ bv1 32) c_~N~0) (and .cse52 (or .cse7 .cse53) .cse54 .cse55 (or .cse7 .cse56) .cse57 (or .cse7 .cse58) .cse59 (or .cse60 .cse7)) .cse6) (or .cse28 .cse61) (or .cse28 .cse8) (or (bvslt (bvadd c_thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) c_~N~0) (and (or .cse28 .cse58) .cse52 .cse54 (or .cse60 .cse28) (or .cse28 .cse53) .cse55 .cse57 .cse59 (or .cse28 .cse56)) .cse6) (or .cse7 .cse61) (let ((.cse110 (bvslt (_ bv0 32) c_~N~0)) (.cse62 (exists ((thread3Thread1of1ForFork0_~i~2 (_ BitVec 32))) (and (not (= (bvmul thread3Thread1of1ForFork0_~i~2 (_ bv4 32)) (_ bv0 32))) (bvsge thread3Thread1of1ForFork0_~i~2 (_ bv0 32)) (bvslt thread3Thread1of1ForFork0_~i~2 c_~N~0))))) (or (and .cse62 (let ((.cse70 (exists ((v_arrayElimCell_159 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (let ((.cse93 (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (and (= .cse93 c_~max2~0) (bvslt (_ bv0 32) .cse93))))) (.cse69 (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse92 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_157))) (and (= .cse92 c_~max1~0) (bvslt (_ bv0 32) .cse92)))))) (or (exists ((v_arrayElimCell_159 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (let ((.cse63 (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (and (= .cse63 c_~max2~0) (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse64 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_157))) (and (bvslt (_ bv0 32) .cse64) (= .cse64 c_~max1~0)))) (bvslt (_ bv0 32) .cse63)))) (and (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse65 (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse65) (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_157))) (= .cse65 c_~max2~0)))) .cse66) (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (let ((.cse67 (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse67) (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse68 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_157))) (and (= .cse68 c_~max1~0) (bvslt (_ bv0 32) .cse68)))) (= .cse67 c_~max2~0)))) (and .cse69 .cse70) (and (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse71 (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse71) (= .cse71 c_~max2~0) (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_157)))))) .cse66) (and .cse66 (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse72 (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse72) (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (= .cse72 c_~max2~0))))) (exists ((v_arrayElimCell_159 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (let ((.cse73 (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (and (= .cse73 c_~max2~0) (exists ((v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse74 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse74) (= .cse74 c_~max1~0)))) (bvslt (_ bv0 32) .cse73)))) (and .cse75 (or (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (and (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (exists ((v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse76 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse76) (= c_~max1~0 .cse76)))))) (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (and (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse77 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_157))) (and (bvslt (_ bv0 32) .cse77) (= .cse77 c_~max1~0)))))) (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (and (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (exists ((v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse78 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse78) (= .cse78 c_~max1~0)))))) (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (and (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse79 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_157))) (and (= .cse79 c_~max1~0) (bvslt (_ bv0 32) .cse79)))) (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))))))) (exists ((v_arrayElimCell_159 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (let ((.cse80 (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (and (= .cse80 c_~max2~0) (bvslt (_ bv0 32) .cse80) (exists ((v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse81 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse81) (= c_~max1~0 .cse81))))))) (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (let ((.cse82 (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse82) (exists ((v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse83 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse83) (= .cse83 c_~max1~0)))) (= .cse82 c_~max2~0)))) (and .cse66 .cse70) (and (or (exists ((v_arrayElimCell_159 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (and (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (exists ((v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse84 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse84) (= c_~max1~0 .cse84)))))) (exists ((v_arrayElimCell_159 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (and (exists ((v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse85 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse85) (= .cse85 c_~max1~0)))) (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))))) .cse69 (exists ((v_arrayElimCell_159 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (and (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse86 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_157))) (and (bvslt (_ bv0 32) .cse86) (= .cse86 c_~max1~0)))) (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158)))))) .cse75) (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (let ((.cse87 (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse87) (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse88 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_157))) (and (bvslt (_ bv0 32) .cse88) (= .cse88 c_~max1~0)))) (= .cse87 c_~max2~0)))) (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (let ((.cse89 (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse89) (exists ((v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse90 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse90) (= c_~max1~0 .cse90)))) (= .cse89 c_~max2~0)))) (and (exists ((v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_152 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse91 (concat (concat (concat v_arrayElimCell_152 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse91) (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_158))) (= .cse91 c_~max2~0)))) .cse66)))) (and .cse62 (or (and (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_159 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse94 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_157))) (and (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (bvslt (_ bv0 32) .cse94) (= .cse94 c_~max1~0)))) .cse75) (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse95 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse95) (exists ((v_arrayElimCell_159 (_ BitVec 8))) (let ((.cse96 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (and (= c_~max2~0 .cse96) (bvslt (_ bv0 32) .cse96)))) (= c_~max1~0 .cse95)))) (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse98 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_157))) (and (exists ((v_arrayElimCell_159 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8))) (let ((.cse97 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (and (= c_~max2~0 .cse97) (bvslt (_ bv0 32) .cse97)))) (bvslt (_ bv0 32) .cse98) (= .cse98 c_~max1~0)))) (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse99 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_157))) (and (= .cse99 c_~max1~0) (bvslt (_ bv0 32) .cse99) (exists ((v_arrayElimCell_159 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (let ((.cse100 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (and (= c_~max2~0 .cse100) (bvslt (_ bv0 32) .cse100))))))) (and (exists ((v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (and (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_158))) (exists ((v_arrayElimCell_159 (_ BitVec 8))) (let ((.cse101 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (and (= c_~max2~0 .cse101) (bvslt (_ bv0 32) .cse101)))))) .cse66) (and (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (and (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_157))) (exists ((v_arrayElimCell_159 (_ BitVec 8))) (let ((.cse102 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (and (= c_~max2~0 .cse102) (bvslt (_ bv0 32) .cse102)))))) .cse66) (and (exists ((v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_159 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse103 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_158))) (and (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (bvslt (_ bv0 32) .cse103) (= .cse103 c_~max1~0)))) .cse75) (and (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_159 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse104 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_157))) (and (= .cse104 c_~max1~0) (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (bvslt (_ bv0 32) .cse104)))) .cse75) (exists ((v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse105 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_156) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse105) (exists ((v_arrayElimCell_159 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8))) (let ((.cse106 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (and (= c_~max2~0 .cse106) (bvslt (_ bv0 32) .cse106)))) (= .cse105 c_~max1~0)))) (and (exists ((v_arrayElimCell_159 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse107 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (bvslt (_ bv0 32) .cse107) (= c_~max1~0 .cse107)))) .cse75) (and .cse66 (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (and (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (exists ((v_arrayElimCell_159 (_ BitVec 8))) (let ((.cse108 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (and (= c_~max2~0 .cse108) (bvslt (_ bv0 32) .cse108))))))) (and (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (and (exists ((v_arrayElimCell_159 (_ BitVec 8))) (let ((.cse109 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_159) v_arrayElimCell_155) v_arrayElimCell_158))) (and (= c_~max2~0 .cse109) (bvslt (_ bv0 32) .cse109)))) (not (bvslt (_ bv0 32) (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_157))))) .cse66))) (and .cse110 (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse111 (concat (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155) v_arrayElimCell_158))) (and (= .cse111 c_~max2~0) (bvslt (_ bv0 32) .cse111) (= c_~max1~0 .cse111))))) (and .cse75 (or (and .cse62 (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse112 (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155))) (let ((.cse113 (concat .cse112 v_arrayElimCell_157))) (and (not (bvslt (_ bv0 32) (concat .cse112 v_arrayElimCell_158))) (bvslt (_ bv0 32) .cse113) (= .cse113 c_~max1~0)))))) (and .cse62 (or (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse114 (concat v_arrayElimCell_154 v_arrayElimCell_153))) (and (not (bvslt (_ bv0 32) (concat (concat .cse114 v_arrayElimCell_155) v_arrayElimCell_158))) (exists ((v_arrayElimCell_156 (_ BitVec 8))) (let ((.cse115 (concat (concat .cse114 v_arrayElimCell_156) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse115) (= .cse115 c_~max1~0))))))) (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse116 (concat v_arrayElimCell_154 v_arrayElimCell_153))) (and (not (bvslt (_ bv0 32) (concat (concat .cse116 v_arrayElimCell_155) v_arrayElimCell_158))) (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_156 (_ BitVec 8))) (let ((.cse117 (concat (concat .cse116 v_arrayElimCell_156) v_arrayElimCell_157))) (and (= .cse117 c_~max1~0) (bvslt (_ bv0 32) .cse117))))))))) (and .cse66 .cse110))) (and .cse62 (or (and .cse66 (exists ((v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse118 (concat v_arrayElimCell_154 v_arrayElimCell_153))) (let ((.cse119 (concat (concat .cse118 v_arrayElimCell_155) v_arrayElimCell_158))) (and (not (bvslt (_ bv0 32) (concat (concat .cse118 v_arrayElimCell_156) v_arrayElimCell_158))) (= .cse119 c_~max2~0) (bvslt (_ bv0 32) .cse119)))))) (and .cse66 (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_156 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse120 (concat v_arrayElimCell_154 v_arrayElimCell_153))) (let ((.cse121 (concat (concat .cse120 v_arrayElimCell_155) v_arrayElimCell_158))) (and (not (bvslt (_ bv0 32) (concat (concat .cse120 v_arrayElimCell_156) v_arrayElimCell_157))) (= .cse121 c_~max2~0) (bvslt (_ bv0 32) .cse121)))))) (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse123 (concat v_arrayElimCell_154 v_arrayElimCell_153))) (let ((.cse124 (concat (concat .cse123 v_arrayElimCell_155) v_arrayElimCell_158))) (and (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_156 (_ BitVec 8))) (let ((.cse122 (concat (concat .cse123 v_arrayElimCell_156) v_arrayElimCell_157))) (and (= .cse122 c_~max1~0) (bvslt (_ bv0 32) .cse122)))) (= .cse124 c_~max2~0) (bvslt (_ bv0 32) .cse124))))) (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse127 (concat v_arrayElimCell_154 v_arrayElimCell_153))) (let ((.cse125 (concat (concat .cse127 v_arrayElimCell_155) v_arrayElimCell_158))) (and (= .cse125 c_~max2~0) (bvslt (_ bv0 32) .cse125) (exists ((v_arrayElimCell_156 (_ BitVec 8))) (let ((.cse126 (concat (concat .cse127 v_arrayElimCell_156) v_arrayElimCell_158))) (and (bvslt (_ bv0 32) .cse126) (= .cse126 c_~max1~0)))))))))) (and .cse62 (or (and (exists ((v_arrayElimCell_157 (_ BitVec 8)) (v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse129 (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155))) (let ((.cse128 (concat .cse129 v_arrayElimCell_158))) (and (= .cse128 c_~max2~0) (bvslt (_ bv0 32) .cse128) (not (bvslt (_ bv0 32) (concat .cse129 v_arrayElimCell_157))))))) .cse66) (exists ((v_arrayElimCell_158 (_ BitVec 8)) (v_arrayElimCell_153 (_ BitVec 8)) (v_arrayElimCell_155 (_ BitVec 8)) (v_arrayElimCell_154 (_ BitVec 8))) (let ((.cse131 (concat (concat v_arrayElimCell_154 v_arrayElimCell_153) v_arrayElimCell_155))) (let ((.cse132 (concat .cse131 v_arrayElimCell_158))) (and (exists ((v_arrayElimCell_157 (_ BitVec 8))) (let ((.cse130 (concat .cse131 v_arrayElimCell_157))) (and (bvslt (_ bv0 32) .cse130) (= .cse130 c_~max1~0)))) (= .cse132 c_~max2~0) (bvslt (_ bv0 32) .cse132))))))))) (or .cse24 .cse25 .cse133) (or (not .cse134) (= c_~max1~0 .cse135)) (or .cse136 (forall ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8))) (let ((.cse137 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (= c_~max1~0 .cse137) (bvslt c_~max1~0 .cse137) (not (bvslt c_~max2~0 .cse137)))))) (or (exists ((v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse138 (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_4) v_arrayElimCell_6) v_arrayElimCell_9))) (and (= .cse138 c_~max2~0) (= .cse138 c_~max1~0) (bvslt (_ bv0 32) .cse138)))) (and .cse66 .cse75)) (or .cse5 .cse6) (or .cse27 .cse7) (bvule c_~N~0 (_ bv1073741823 32)) (or .cse25 (forall ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (let ((.cse139 (concat (concat (concat v_arrayElimCell_19 v_arrayElimCell_20) v_arrayElimCell_22) v_arrayElimCell_21)) (.cse140 (concat (concat (concat v_arrayElimCell_16 v_arrayElimCell_12) v_arrayElimCell_13) v_arrayElimCell_14))) (or (not (bvslt c_~max2~0 .cse139)) (not (bvslt c_~max1~0 .cse140)) (= .cse139 .cse140))))) (or (not .cse3) (= .cse141 c_~max1~0)) (or .cse134 .cse4)))))) is different from false [2023-12-02 18:14:17,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 18:14:54,717 WARN L293 SmtUtils]: Spent 27.79s on a formula simplification. DAG size of input: 1122 DAG size of output: 804 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)