./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --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 6990ac65798f2c5a95ce01b01bd39640075d7bea37e69dff3da0d3d7c4b56ab2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 12:15:37,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 12:15:37,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 12:15:37,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 12:15:37,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 12:15:37,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 12:15:37,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 12:15:37,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 12:15:37,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 12:15:37,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 12:15:37,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 12:15:37,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 12:15:37,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 12:15:37,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 12:15:37,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 12:15:37,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 12:15:37,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 12:15:37,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 12:15:37,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 12:15:37,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 12:15:37,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 12:15:37,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 12:15:37,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 12:15:37,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 12:15:37,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 12:15:37,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 12:15:37,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 12:15:37,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 12:15:37,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 12:15:37,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 12:15:37,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 12:15:37,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 12:15:37,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 12:15:37,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 12:15:37,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 12:15:37,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 12:15:37,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 12:15:37,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 12:15:37,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 12:15:37,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 12:15:37,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 12:15:37,278 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 12:15:37,299 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 12:15:37,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 12:15:37,299 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 12:15:37,299 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 12:15:37,300 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 12:15:37,300 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 12:15:37,300 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 12:15:37,300 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 12:15:37,301 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 12:15:37,301 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 12:15:37,301 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 12:15:37,301 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 12:15:37,301 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 12:15:37,301 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 12:15:37,302 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 12:15:37,302 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 12:15:37,302 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 12:15:37,302 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 12:15:37,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 12:15:37,303 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 12:15:37,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 12:15:37,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 12:15:37,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 12:15:37,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 12:15:37,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 12:15:37,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 12:15:37,303 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 12:15:37,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 12:15:37,304 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 12:15:37,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 12:15:37,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 12:15:37,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 12:15:37,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:15:37,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 12:15:37,305 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 12:15:37,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 12:15:37,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 12:15:37,305 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 12:15:37,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 12:15:37,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 12:15:37,305 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 12:15:37,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/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_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 6990ac65798f2c5a95ce01b01bd39640075d7bea37e69dff3da0d3d7c4b56ab2 [2022-12-14 12:15:37,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 12:15:37,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 12:15:37,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 12:15:37,499 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 12:15:37,500 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 12:15:37,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2022-12-14 12:15:40,056 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 12:15:40,227 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 12:15:40,228 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2022-12-14 12:15:40,234 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/data/992cdc9cf/7bf2ab3e399c4103adaec4ff3bb62532/FLAGf0746fc35 [2022-12-14 12:15:40,633 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/data/992cdc9cf/7bf2ab3e399c4103adaec4ff3bb62532 [2022-12-14 12:15:40,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 12:15:40,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 12:15:40,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 12:15:40,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 12:15:40,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 12:15:40,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:15:40" (1/1) ... [2022-12-14 12:15:40,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747908ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:15:40, skipping insertion in model container [2022-12-14 12:15:40,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:15:40" (1/1) ... [2022-12-14 12:15:40,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 12:15:40,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 12:15:40,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 12:15:40,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 12:15:40,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 12:15:40,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 12:15:40,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 12:15:40,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 12:15:40,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 12:15:40,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 12:15:40,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 12:15:40,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 12:15:40,810 WARN L237 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_5ea381f2-6b08-47db-be8d-11030d23f79d/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c[3412,3425] [2022-12-14 12:15:40,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:15:40,828 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 12:15:40,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 12:15:40,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 12:15:40,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 12:15:40,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 12:15:40,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 12:15:40,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 12:15:40,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 12:15:40,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 12:15:40,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 12:15:40,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 12:15:40,849 WARN L237 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_5ea381f2-6b08-47db-be8d-11030d23f79d/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c[3412,3425] [2022-12-14 12:15:40,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:15:40,862 INFO L208 MainTranslator]: Completed translation [2022-12-14 12:15:40,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:15:40 WrapperNode [2022-12-14 12:15:40,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 12:15:40,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 12:15:40,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 12:15:40,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 12:15:40,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:15:40" (1/1) ... [2022-12-14 12:15:40,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:15:40" (1/1) ... [2022-12-14 12:15:40,896 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 245 [2022-12-14 12:15:40,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 12:15:40,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 12:15:40,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 12:15:40,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 12:15:40,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:15:40" (1/1) ... [2022-12-14 12:15:40,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:15:40" (1/1) ... [2022-12-14 12:15:40,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:15:40" (1/1) ... [2022-12-14 12:15:40,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:15:40" (1/1) ... [2022-12-14 12:15:40,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:15:40" (1/1) ... [2022-12-14 12:15:40,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:15:40" (1/1) ... [2022-12-14 12:15:40,920 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:15:40" (1/1) ... [2022-12-14 12:15:40,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:15:40" (1/1) ... [2022-12-14 12:15:40,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 12:15:40,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 12:15:40,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 12:15:40,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 12:15:40,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:15:40" (1/1) ... [2022-12-14 12:15:40,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:15:40,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:15:40,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 12:15:40,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 12:15:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 12:15:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 12:15:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 12:15:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 12:15:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 12:15:40,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 12:15:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 12:15:40,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 12:15:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-14 12:15:40,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-14 12:15:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 12:15:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 12:15:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 12:15:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 12:15:40,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 12:15:40,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 12:15:40,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 12:15:40,987 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 12:15:41,069 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 12:15:41,071 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 12:15:41,386 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 12:15:41,487 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 12:15:41,487 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-14 12:15:41,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:15:41 BoogieIcfgContainer [2022-12-14 12:15:41,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 12:15:41,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 12:15:41,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 12:15:41,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 12:15:41,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 12:15:40" (1/3) ... [2022-12-14 12:15:41,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c91110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:15:41, skipping insertion in model container [2022-12-14 12:15:41,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:15:40" (2/3) ... [2022-12-14 12:15:41,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c91110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:15:41, skipping insertion in model container [2022-12-14 12:15:41,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:15:41" (3/3) ... [2022-12-14 12:15:41,499 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2022-12-14 12:15:41,505 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 12:15:41,522 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 12:15:41,522 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 12:15:41,523 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 12:15:41,585 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-14 12:15:41,618 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 12:15:41,631 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 211 transitions, 446 flow [2022-12-14 12:15:41,634 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 211 transitions, 446 flow [2022-12-14 12:15:41,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 211 transitions, 446 flow [2022-12-14 12:15:41,711 INFO L130 PetriNetUnfolder]: 18/208 cut-off events. [2022-12-14 12:15:41,711 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-14 12:15:41,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 208 events. 18/208 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 109 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 170. Up to 3 conditions per place. [2022-12-14 12:15:41,718 INFO L119 LiptonReduction]: Number of co-enabled transitions 1456 [2022-12-14 12:15:47,751 INFO L134 LiptonReduction]: Checked pairs total: 2300 [2022-12-14 12:15:47,751 INFO L136 LiptonReduction]: Total number of compositions: 220 [2022-12-14 12:15:47,759 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 32 transitions, 88 flow [2022-12-14 12:15:47,783 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 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) [2022-12-14 12:15:47,801 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 12:15:47,806 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=LoopsAndPotentialCycles, 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;@1f7ca54a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 12:15:47,807 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-14 12:15:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 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) [2022-12-14 12:15:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 12:15:47,817 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:15:47,817 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] [2022-12-14 12:15:47,818 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)] === [2022-12-14 12:15:47,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:15:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1490749994, now seen corresponding path program 1 times [2022-12-14 12:15:47,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:15:47,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867350111] [2022-12-14 12:15:47,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:15:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:15:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:15:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:15:48,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:15:48,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867350111] [2022-12-14 12:15:48,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867350111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:15:48,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:15:48,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 12:15:48,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056033810] [2022-12-14 12:15:48,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:15:48,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 12:15:48,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:15:48,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 12:15:48,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 12:15:48,060 INFO L87 Difference]: Start difference. First operand has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 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 2 states, 2 states have (on average 10.5) 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) [2022-12-14 12:15:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:15:48,107 INFO L93 Difference]: Finished difference Result 138 states and 428 transitions. [2022-12-14 12:15:48,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 12:15:48,109 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) 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 [2022-12-14 12:15:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:15:48,118 INFO L225 Difference]: With dead ends: 138 [2022-12-14 12:15:48,118 INFO L226 Difference]: Without dead ends: 138 [2022-12-14 12:15:48,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 12:15:48,122 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:15:48,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:15:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-12-14 12:15:48,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-12-14 12:15:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.124087591240876) internal successors, (428), 137 states have internal predecessors, (428), 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) [2022-12-14 12:15:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 428 transitions. [2022-12-14 12:15:48,154 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 428 transitions. Word has length 21 [2022-12-14 12:15:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:15:48,154 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 428 transitions. [2022-12-14 12:15:48,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) 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) [2022-12-14 12:15:48,154 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 428 transitions. [2022-12-14 12:15:48,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 12:15:48,155 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:15:48,155 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] [2022-12-14 12:15:48,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 12:15:48,155 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)] === [2022-12-14 12:15:48,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:15:48,156 INFO L85 PathProgramCache]: Analyzing trace with hash 479635260, now seen corresponding path program 1 times [2022-12-14 12:15:48,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:15:48,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212051832] [2022-12-14 12:15:48,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:15:48,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:15:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:15:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:15:48,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:15:48,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212051832] [2022-12-14 12:15:48,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212051832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:15:48,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:15:48,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 12:15:48,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398007488] [2022-12-14 12:15:48,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:15:48,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 12:15:48,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:15:48,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 12:15:48,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 12:15:48,378 INFO L87 Difference]: Start difference. First operand 138 states and 428 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:15:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:15:48,439 INFO L93 Difference]: Finished difference Result 177 states and 515 transitions. [2022-12-14 12:15:48,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 12:15:48,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 12:15:48,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:15:48,440 INFO L225 Difference]: With dead ends: 177 [2022-12-14 12:15:48,440 INFO L226 Difference]: Without dead ends: 139 [2022-12-14 12:15:48,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 12:15:48,441 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:15:48,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 9 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:15:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-14 12:15:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-12-14 12:15:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.108695652173913) internal successors, (429), 138 states have internal predecessors, (429), 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) [2022-12-14 12:15:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 429 transitions. [2022-12-14 12:15:48,450 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 429 transitions. Word has length 22 [2022-12-14 12:15:48,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:15:48,451 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 429 transitions. [2022-12-14 12:15:48,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:15:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 429 transitions. [2022-12-14 12:15:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 12:15:48,452 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:15:48,452 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] [2022-12-14 12:15:48,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 12:15:48,453 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)] === [2022-12-14 12:15:48,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:15:48,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1070876960, now seen corresponding path program 1 times [2022-12-14 12:15:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:15:48,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804934246] [2022-12-14 12:15:48,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:15:48,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:15:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:15:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:15:48,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:15:48,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804934246] [2022-12-14 12:15:48,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804934246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:15:48,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:15:48,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 12:15:48,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445648699] [2022-12-14 12:15:48,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:15:48,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 12:15:48,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:15:48,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 12:15:48,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 12:15:48,580 INFO L87 Difference]: Start difference. First operand 139 states and 429 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:15:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:15:48,654 INFO L93 Difference]: Finished difference Result 213 states and 614 transitions. [2022-12-14 12:15:48,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 12:15:48,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 12:15:48,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:15:48,656 INFO L225 Difference]: With dead ends: 213 [2022-12-14 12:15:48,657 INFO L226 Difference]: Without dead ends: 140 [2022-12-14 12:15:48,657 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 [2022-12-14 12:15:48,658 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:15:48,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 9 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:15:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-12-14 12:15:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-12-14 12:15:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.093525179856115) internal successors, (430), 139 states have internal predecessors, (430), 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) [2022-12-14 12:15:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 430 transitions. [2022-12-14 12:15:48,669 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 430 transitions. Word has length 23 [2022-12-14 12:15:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:15:48,669 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 430 transitions. [2022-12-14 12:15:48,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:15:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 430 transitions. [2022-12-14 12:15:48,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:15:48,671 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:15:48,671 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] [2022-12-14 12:15:48,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 12:15:48,671 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)] === [2022-12-14 12:15:48,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:15:48,672 INFO L85 PathProgramCache]: Analyzing trace with hash 527863590, now seen corresponding path program 1 times [2022-12-14 12:15:48,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:15:48,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483258245] [2022-12-14 12:15:48,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:15:48,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:15:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:15:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 12:15:49,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:15:49,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483258245] [2022-12-14 12:15:49,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483258245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:15:49,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:15:49,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 12:15:49,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952272588] [2022-12-14 12:15:49,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:15:49,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:15:49,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:15:49,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:15:49,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:15:49,063 INFO L87 Difference]: Start difference. First operand 140 states and 430 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 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) [2022-12-14 12:15:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:15:49,193 INFO L93 Difference]: Finished difference Result 309 states and 965 transitions. [2022-12-14 12:15:49,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 12:15:49,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 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 [2022-12-14 12:15:49,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:15:49,195 INFO L225 Difference]: With dead ends: 309 [2022-12-14 12:15:49,195 INFO L226 Difference]: Without dead ends: 290 [2022-12-14 12:15:49,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:15:49,196 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 38 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:15:49,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 23 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:15:49,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-12-14 12:15:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 236. [2022-12-14 12:15:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 3.1404255319148935) internal successors, (738), 235 states have internal predecessors, (738), 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) [2022-12-14 12:15:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 738 transitions. [2022-12-14 12:15:49,212 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 738 transitions. Word has length 24 [2022-12-14 12:15:49,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:15:49,212 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 738 transitions. [2022-12-14 12:15:49,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 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) [2022-12-14 12:15:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 738 transitions. [2022-12-14 12:15:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:15:49,214 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:15:49,214 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] [2022-12-14 12:15:49,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 12:15:49,214 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)] === [2022-12-14 12:15:49,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:15:49,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1886843464, now seen corresponding path program 1 times [2022-12-14 12:15:49,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:15:49,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031805994] [2022-12-14 12:15:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:15:49,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:15:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:15:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:15:49,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:15:49,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031805994] [2022-12-14 12:15:49,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031805994] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:15:49,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394144927] [2022-12-14 12:15:49,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:15:49,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:15:49,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:15:49,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:15:49,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 12:15:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:15:49,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 12:15:49,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:15:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:15:49,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:15:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:15:49,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394144927] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:15:49,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [812242451] [2022-12-14 12:15:49,655 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:15:49,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:15:49,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-14 12:15:49,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175828580] [2022-12-14 12:15:49,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:15:49,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 12:15:49,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:15:49,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 12:15:49,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-14 12:15:49,658 INFO L87 Difference]: Start difference. First operand 236 states and 738 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 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) [2022-12-14 12:15:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:15:49,796 INFO L93 Difference]: Finished difference Result 470 states and 1408 transitions. [2022-12-14 12:15:49,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 12:15:49,796 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 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) Word has length 25 [2022-12-14 12:15:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:15:49,800 INFO L225 Difference]: With dead ends: 470 [2022-12-14 12:15:49,800 INFO L226 Difference]: Without dead ends: 368 [2022-12-14 12:15:49,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-14 12:15:49,801 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:15:49,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 42 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:15:49,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-12-14 12:15:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 284. [2022-12-14 12:15:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.067137809187279) internal successors, (868), 283 states have internal predecessors, (868), 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) [2022-12-14 12:15:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 868 transitions. [2022-12-14 12:15:49,811 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 868 transitions. Word has length 25 [2022-12-14 12:15:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:15:49,812 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 868 transitions. [2022-12-14 12:15:49,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 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) [2022-12-14 12:15:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 868 transitions. [2022-12-14 12:15:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:15:49,813 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:15:49,813 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] [2022-12-14 12:15:49,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 12:15:50,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:15:50,014 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)] === [2022-12-14 12:15:50,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:15:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1863500302, now seen corresponding path program 1 times [2022-12-14 12:15:50,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:15:50,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133202519] [2022-12-14 12:15:50,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:15:50,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:15:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:15:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 12:15:50,206 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:15:50,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133202519] [2022-12-14 12:15:50,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133202519] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:15:50,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371564858] [2022-12-14 12:15:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:15:50,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:15:50,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:15:50,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:15:50,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 12:15:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:15:50,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 12:15:50,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:15:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:15:50,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:15:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:15:50,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371564858] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:15:50,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [128701892] [2022-12-14 12:15:50,600 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:15:50,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:15:50,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 15 [2022-12-14 12:15:50,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932829670] [2022-12-14 12:15:50,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:15:50,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 12:15:50,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:15:50,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 12:15:50,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-12-14 12:15:50,602 INFO L87 Difference]: Start difference. First operand 284 states and 868 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 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) [2022-12-14 12:15:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:15:50,840 INFO L93 Difference]: Finished difference Result 890 states and 2679 transitions. [2022-12-14 12:15:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 12:15:50,841 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 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 [2022-12-14 12:15:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:15:50,845 INFO L225 Difference]: With dead ends: 890 [2022-12-14 12:15:50,845 INFO L226 Difference]: Without dead ends: 745 [2022-12-14 12:15:50,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-12-14 12:15:50,846 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 134 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:15:50,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 35 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:15:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-12-14 12:15:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 599. [2022-12-14 12:15:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 3.209030100334448) internal successors, (1919), 598 states have internal predecessors, (1919), 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) [2022-12-14 12:15:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1919 transitions. [2022-12-14 12:15:50,872 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1919 transitions. Word has length 25 [2022-12-14 12:15:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:15:50,872 INFO L495 AbstractCegarLoop]: Abstraction has 599 states and 1919 transitions. [2022-12-14 12:15:50,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 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) [2022-12-14 12:15:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1919 transitions. [2022-12-14 12:15:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 12:15:50,875 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:15:50,875 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] [2022-12-14 12:15:50,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 12:15:51,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:15:51,076 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)] === [2022-12-14 12:15:51,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:15:51,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1866239660, now seen corresponding path program 2 times [2022-12-14 12:15:51,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:15:51,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111318264] [2022-12-14 12:15:51,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:15:51,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:15:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:15:51,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:15:51,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:15:51,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111318264] [2022-12-14 12:15:51,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111318264] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:15:51,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375499079] [2022-12-14 12:15:51,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:15:51,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:15:51,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:15:51,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:15:51,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 12:15:51,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 12:15:51,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:15:51,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 12:15:51,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:15:52,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:15:52,125 INFO L350 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 18 treesize of output 20 [2022-12-14 12:15:52,159 INFO L350 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 23 treesize of output 7 [2022-12-14 12:15:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:15:52,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:15:52,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:15:52,292 INFO L350 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 45 treesize of output 41 [2022-12-14 12:15:52,296 INFO L350 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 24 treesize of output 18 [2022-12-14 12:15:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:15:52,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375499079] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:15:52,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [504930905] [2022-12-14 12:15:52,498 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:15:52,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:15:52,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-12-14 12:15:52,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616890031] [2022-12-14 12:15:52,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:15:52,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 12:15:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:15:52,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 12:15:52,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=504, Unknown=2, NotChecked=0, Total=600 [2022-12-14 12:15:52,500 INFO L87 Difference]: Start difference. First operand 599 states and 1919 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:15:54,415 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_255 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_255) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) (not (= |c_thread2Thread1of1ForFork2_~j~0#1| 0))) is different from false [2022-12-14 12:15:56,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:15:56,615 INFO L93 Difference]: Finished difference Result 3812 states and 12350 transitions. [2022-12-14 12:15:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-14 12:15:56,615 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 12:15:56,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:15:56,628 INFO L225 Difference]: With dead ends: 3812 [2022-12-14 12:15:56,628 INFO L226 Difference]: Without dead ends: 3812 [2022-12-14 12:15:56,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=932, Invalid=4316, Unknown=12, NotChecked=142, Total=5402 [2022-12-14 12:15:56,629 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 314 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 94 mSolverCounterUnsat, 65 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 65 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 12:15:56,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 258 Invalid, 2241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2071 Invalid, 65 Unknown, 11 Unchecked, 1.6s Time] [2022-12-14 12:15:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2022-12-14 12:15:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 2016. [2022-12-14 12:15:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 2015 states have (on average 3.6531017369727046) internal successors, (7361), 2015 states have internal predecessors, (7361), 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) [2022-12-14 12:15:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 7361 transitions. [2022-12-14 12:15:56,693 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 7361 transitions. Word has length 26 [2022-12-14 12:15:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:15:56,693 INFO L495 AbstractCegarLoop]: Abstraction has 2016 states and 7361 transitions. [2022-12-14 12:15:56,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:15:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 7361 transitions. [2022-12-14 12:15:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 12:15:56,698 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:15:56,698 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] [2022-12-14 12:15:56,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 12:15:56,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:15:56,899 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)] === [2022-12-14 12:15:56,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:15:56,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1575233090, now seen corresponding path program 3 times [2022-12-14 12:15:56,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:15:56,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516646967] [2022-12-14 12:15:56,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:15:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:15:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:15:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:15:57,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:15:57,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516646967] [2022-12-14 12:15:57,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516646967] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:15:57,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634927129] [2022-12-14 12:15:57,585 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:15:57,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:15:57,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:15:57,586 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:15:57,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 12:15:57,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:15:57,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:15:57,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 12:15:57,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:15:57,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:15:57,793 INFO L350 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 18 treesize of output 20 [2022-12-14 12:15:57,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:15:57,824 INFO L350 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 18 treesize of output 20 [2022-12-14 12:15:57,844 INFO L350 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 23 treesize of output 7 [2022-12-14 12:15:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 12:15:57,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:15:57,915 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_313 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_313) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-12-14 12:15:57,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:15:57,931 INFO L350 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 167 treesize of output 155 [2022-12-14 12:15:57,935 INFO L350 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 138 treesize of output 114 [2022-12-14 12:15:57,939 INFO L350 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 114 treesize of output 102 [2022-12-14 12:15:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-12-14 12:15:58,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634927129] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:15:58,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [408023824] [2022-12-14 12:15:58,030 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:15:58,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:15:58,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2022-12-14 12:15:58,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324673611] [2022-12-14 12:15:58,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:15:58,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 12:15:58,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:15:58,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 12:15:58,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=4, NotChecked=36, Total=420 [2022-12-14 12:15:58,032 INFO L87 Difference]: Start difference. First operand 2016 states and 7361 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:15:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:15:58,552 INFO L93 Difference]: Finished difference Result 2207 states and 7686 transitions. [2022-12-14 12:15:58,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 12:15:58,552 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 12:15:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:15:58,560 INFO L225 Difference]: With dead ends: 2207 [2022-12-14 12:15:58,560 INFO L226 Difference]: Without dead ends: 2207 [2022-12-14 12:15:58,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=4, NotChecked=50, Total=756 [2022-12-14 12:15:58,560 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 116 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:15:58,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 50 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 370 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2022-12-14 12:15:58,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2022-12-14 12:15:58,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 1564. [2022-12-14 12:15:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1563 states have (on average 3.597568777991043) internal successors, (5623), 1563 states have internal predecessors, (5623), 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) [2022-12-14 12:15:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 5623 transitions. [2022-12-14 12:15:58,597 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 5623 transitions. Word has length 26 [2022-12-14 12:15:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:15:58,597 INFO L495 AbstractCegarLoop]: Abstraction has 1564 states and 5623 transitions. [2022-12-14 12:15:58,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:15:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 5623 transitions. [2022-12-14 12:15:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 12:15:58,601 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:15:58,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:15:58,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 12:15:58,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 12:15:58,801 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)] === [2022-12-14 12:15:58,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:15:58,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1029606206, now seen corresponding path program 1 times [2022-12-14 12:15:58,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:15:58,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152764952] [2022-12-14 12:15:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:15:58,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:15:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:15:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 12:15:58,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:15:58,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152764952] [2022-12-14 12:15:58,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152764952] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:15:58,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039659038] [2022-12-14 12:15:58,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:15:58,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:15:58,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:15:58,935 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:15:58,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 12:15:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:15:59,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 12:15:59,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:15:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 12:15:59,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:15:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 12:15:59,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039659038] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:15:59,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1953618065] [2022-12-14 12:15:59,108 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:15:59,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:15:59,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-14 12:15:59,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721185993] [2022-12-14 12:15:59,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:15:59,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 12:15:59,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:15:59,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 12:15:59,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-14 12:15:59,110 INFO L87 Difference]: Start difference. First operand 1564 states and 5623 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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) [2022-12-14 12:15:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:15:59,231 INFO L93 Difference]: Finished difference Result 1649 states and 5635 transitions. [2022-12-14 12:15:59,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 12:15:59,232 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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 [2022-12-14 12:15:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:15:59,237 INFO L225 Difference]: With dead ends: 1649 [2022-12-14 12:15:59,237 INFO L226 Difference]: Without dead ends: 1079 [2022-12-14 12:15:59,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-14 12:15:59,238 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:15:59,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 33 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:15:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2022-12-14 12:15:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2022-12-14 12:15:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 3.6298701298701297) internal successors, (3913), 1078 states have internal predecessors, (3913), 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) [2022-12-14 12:15:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 3913 transitions. [2022-12-14 12:15:59,274 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 3913 transitions. Word has length 28 [2022-12-14 12:15:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:15:59,275 INFO L495 AbstractCegarLoop]: Abstraction has 1079 states and 3913 transitions. [2022-12-14 12:15:59,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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) [2022-12-14 12:15:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 3913 transitions. [2022-12-14 12:15:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 12:15:59,277 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:15:59,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:15:59,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 12:15:59,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-14 12:15:59,478 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)] === [2022-12-14 12:15:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:15:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1166628074, now seen corresponding path program 1 times [2022-12-14 12:15:59,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:15:59,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672099272] [2022-12-14 12:15:59,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:15:59,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:15:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:15:59,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 12:15:59,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:15:59,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672099272] [2022-12-14 12:15:59,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672099272] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:15:59,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662474129] [2022-12-14 12:15:59,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:15:59,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:15:59,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:15:59,671 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:15:59,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 12:15:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:15:59,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 12:15:59,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:15:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 12:15:59,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:15:59,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662474129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:15:59,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 12:15:59,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-14 12:15:59,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036713635] [2022-12-14 12:15:59,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:15:59,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 12:15:59,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:15:59,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 12:15:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:15:59,785 INFO L87 Difference]: Start difference. First operand 1079 states and 3913 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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) [2022-12-14 12:15:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:15:59,849 INFO L93 Difference]: Finished difference Result 1468 states and 5322 transitions. [2022-12-14 12:15:59,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 12:15:59,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 [2022-12-14 12:15:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:15:59,862 INFO L225 Difference]: With dead ends: 1468 [2022-12-14 12:15:59,862 INFO L226 Difference]: Without dead ends: 1372 [2022-12-14 12:15:59,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:15:59,863 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 30 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:15:59,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:15:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-12-14 12:15:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1296. [2022-12-14 12:15:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1295 states have (on average 3.789189189189189) internal successors, (4907), 1295 states have internal predecessors, (4907), 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) [2022-12-14 12:15:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 4907 transitions. [2022-12-14 12:15:59,901 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 4907 transitions. Word has length 28 [2022-12-14 12:15:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:15:59,901 INFO L495 AbstractCegarLoop]: Abstraction has 1296 states and 4907 transitions. [2022-12-14 12:15:59,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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) [2022-12-14 12:15:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 4907 transitions. [2022-12-14 12:15:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 12:15:59,906 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:15:59,906 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] [2022-12-14 12:15:59,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 12:16:00,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:16:00,107 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)] === [2022-12-14 12:16:00,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:16:00,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1537206132, now seen corresponding path program 2 times [2022-12-14 12:16:00,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:16:00,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227984173] [2022-12-14 12:16:00,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:16:00,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:16:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:16:00,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 12:16:00,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:16:00,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227984173] [2022-12-14 12:16:00,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227984173] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:16:00,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494869902] [2022-12-14 12:16:00,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:16:00,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:16:00,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:16:00,819 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:16:00,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 12:16:00,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 12:16:00,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:16:00,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 12:16:00,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:16:01,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:16:01,193 INFO L350 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 19 treesize of output 21 [2022-12-14 12:16:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 12:16:01,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:16:01,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:16:01,410 INFO L350 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 44 treesize of output 40 [2022-12-14 12:16:01,413 INFO L350 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 24 treesize of output 18 [2022-12-14 12:16:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 12:16:01,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494869902] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:16:01,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [3929633] [2022-12-14 12:16:01,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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:16:01,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:16:01,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-12-14 12:16:01,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245535373] [2022-12-14 12:16:01,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:16:01,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 12:16:01,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:16:01,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 12:16:01,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2022-12-14 12:16:01,721 INFO L87 Difference]: Start difference. First operand 1296 states and 4907 transitions. Second operand has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:16:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:16:04,206 INFO L93 Difference]: Finished difference Result 6123 states and 22453 transitions. [2022-12-14 12:16:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 12:16:04,206 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 12:16:04,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:16:04,228 INFO L225 Difference]: With dead ends: 6123 [2022-12-14 12:16:04,228 INFO L226 Difference]: Without dead ends: 6104 [2022-12-14 12:16:04,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=442, Invalid=2312, Unknown=2, NotChecked=0, Total=2756 [2022-12-14 12:16:04,229 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 510 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 91 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 12:16:04,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 84 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1126 Invalid, 17 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 12:16:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6104 states. [2022-12-14 12:16:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6104 to 3627. [2022-12-14 12:16:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3627 states, 3626 states have (on average 3.7542746828461113) internal successors, (13613), 3626 states have internal predecessors, (13613), 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) [2022-12-14 12:16:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3627 states to 3627 states and 13613 transitions. [2022-12-14 12:16:04,361 INFO L78 Accepts]: Start accepts. Automaton has 3627 states and 13613 transitions. Word has length 29 [2022-12-14 12:16:04,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:16:04,362 INFO L495 AbstractCegarLoop]: Abstraction has 3627 states and 13613 transitions. [2022-12-14 12:16:04,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:16:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 13613 transitions. [2022-12-14 12:16:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 12:16:04,371 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:16:04,372 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] [2022-12-14 12:16:04,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 12:16:04,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:16:04,572 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)] === [2022-12-14 12:16:04,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:16:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2024118936, now seen corresponding path program 1 times [2022-12-14 12:16:04,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:16:04,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483508572] [2022-12-14 12:16:04,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:16:04,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:16:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:16:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:16:07,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:16:07,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483508572] [2022-12-14 12:16:07,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483508572] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:16:07,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515119567] [2022-12-14 12:16:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:16:07,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:16:07,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:16:07,683 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:16:07,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 12:16:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:16:07,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-14 12:16:07,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:16:08,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:16:08,267 INFO L350 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 18 treesize of output 20 [2022-12-14 12:16:08,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:16:08,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:16:08,579 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 12:16:08,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2022-12-14 12:16:10,683 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-14 12:16:10,684 INFO L350 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 44 treesize of output 10 [2022-12-14 12:16:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 12:16:10,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:16:10,871 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_548 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_548) c_~q2~0.base) .cse0)) (+ c_~N~0 1))) (forall ((v_ArrVal_548 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_548) c_~q2~0.base) .cse0)))))) is different from false [2022-12-14 12:16:11,234 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~q2_front~0 4)) (.cse2 (* c_~q2_back~0 4)) (.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_547 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_547))) (let ((.cse0 (select (select .cse1 c_~q1~0.base) .cse4))) (or (= .cse0 0) (forall ((~q2~0.offset Int)) (or (not (= .cse0 (select (select .cse1 c_~q2~0.base) (+ ~q2~0.offset .cse2)))) (forall ((v_ArrVal_548 (Array Int Int))) (< (+ c_~t~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_548) c_~q2~0.base) (+ ~q2~0.offset .cse3))) (+ c_~N~0 1))))))))) (forall ((v_ArrVal_547 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_547))) (let ((.cse6 (select (select .cse5 c_~q1~0.base) .cse4))) (or (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_548 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_548) c_~q2~0.base) (+ ~q2~0.offset .cse3))))) (not (= .cse6 (select (select .cse5 c_~q2~0.base) (+ ~q2~0.offset .cse2)))))) (= .cse6 0))))))) is different from false [2022-12-14 12:16:11,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:16:11,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 522 treesize of output 646 [2022-12-14 12:16:11,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:16:11,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 405 treesize of output 414 [2022-12-14 12:16:11,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:16:11,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 369 treesize of output 372 [2022-12-14 12:16:11,643 INFO L350 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 327 treesize of output 303 [2022-12-14 12:16:11,662 INFO L350 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 303 treesize of output 291 [2022-12-14 12:17:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2022-12-14 12:17:04,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515119567] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:17:04,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [468268349] [2022-12-14 12:17:04,407 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:17:04,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:17:04,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 11] total 40 [2022-12-14 12:17:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878116055] [2022-12-14 12:17:04,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:17:04,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 12:17:04,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:17:04,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 12:17:04,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1455, Unknown=3, NotChecked=154, Total=1722 [2022-12-14 12:17:04,409 INFO L87 Difference]: Start difference. First operand 3627 states and 13613 transitions. Second operand has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 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) [2022-12-14 12:17:13,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 12:17:16,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 12:17:23,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 12:17:28,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 12:17:30,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 12:17:31,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:17:31,636 INFO L93 Difference]: Finished difference Result 4225 states and 15160 transitions. [2022-12-14 12:17:31,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 12:17:31,636 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 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 30 [2022-12-14 12:17:31,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:17:31,647 INFO L225 Difference]: With dead ends: 4225 [2022-12-14 12:17:31,647 INFO L226 Difference]: Without dead ends: 4175 [2022-12-14 12:17:31,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=330, Invalid=3579, Unknown=5, NotChecked=246, Total=4160 [2022-12-14 12:17:31,648 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 315 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 2874 mSolverCounterSat, 55 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 3197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2874 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-12-14 12:17:31,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 318 Invalid, 3197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2874 Invalid, 5 Unknown, 263 Unchecked, 12.6s Time] [2022-12-14 12:17:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2022-12-14 12:17:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 3793. [2022-12-14 12:17:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3793 states, 3792 states have (on average 3.6980485232067513) internal successors, (14023), 3792 states have internal predecessors, (14023), 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) [2022-12-14 12:17:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3793 states to 3793 states and 14023 transitions. [2022-12-14 12:17:31,721 INFO L78 Accepts]: Start accepts. Automaton has 3793 states and 14023 transitions. Word has length 30 [2022-12-14 12:17:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:17:31,721 INFO L495 AbstractCegarLoop]: Abstraction has 3793 states and 14023 transitions. [2022-12-14 12:17:31,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 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) [2022-12-14 12:17:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3793 states and 14023 transitions. [2022-12-14 12:17:31,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 12:17:31,727 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:17:31,727 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] [2022-12-14 12:17:31,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 12:17:31,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 12:17:31,929 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)] === [2022-12-14 12:17:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:17:31,929 INFO L85 PathProgramCache]: Analyzing trace with hash -749435568, now seen corresponding path program 2 times [2022-12-14 12:17:31,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:17:31,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89292751] [2022-12-14 12:17:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:17:31,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:17:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:17:33,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:17:33,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:17:33,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89292751] [2022-12-14 12:17:33,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89292751] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:17:33,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764039697] [2022-12-14 12:17:33,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:17:33,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:17:33,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:17:33,961 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:17:33,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 12:17:34,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 12:17:34,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:17:34,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-14 12:17:34,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:17:34,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:17:34,601 INFO L350 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 18 treesize of output 20 [2022-12-14 12:17:35,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:17:35,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:17:35,072 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 12:17:35,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2022-12-14 12:17:35,192 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-14 12:17:35,193 INFO L350 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 42 treesize of output 10 [2022-12-14 12:17:35,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 12:17:35,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:17:35,392 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse1))) (or (< (+ c_~t~0 .cse0) (+ c_~N~0 1)) (= .cse0 0)))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse1))) (or (<= c_~N~0 (+ c_~t~0 .cse2)) (= .cse2 0)))))) is different from false [2022-12-14 12:17:36,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:17:36,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 676 treesize of output 792 [2022-12-14 12:17:36,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:17:36,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 551 treesize of output 548 [2022-12-14 12:17:36,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:17:36,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 503 treesize of output 512 [2022-12-14 12:17:36,298 INFO L350 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 467 treesize of output 419 [2022-12-14 12:17:36,319 INFO L350 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 419 treesize of output 395 [2022-12-14 12:17:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-12-14 12:17:50,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764039697] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:17:50,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [796159423] [2022-12-14 12:17:50,920 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:17:50,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:17:50,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 43 [2022-12-14 12:17:50,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706150734] [2022-12-14 12:17:50,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:17:50,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-14 12:17:50,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:17:50,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-14 12:17:50,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1731, Unknown=4, NotChecked=84, Total=1980 [2022-12-14 12:17:50,922 INFO L87 Difference]: Start difference. First operand 3793 states and 14023 transitions. Second operand has 45 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 44 states have internal predecessors, (86), 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) [2022-12-14 12:17:53,406 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~q2_front~0 4)) (.cse48 (* c_~q1_front~0 4))) (let ((.cse46 (* c_~q1_back~0 4)) (.cse36 (+ .cse48 c_~q1~0.offset)) (.cse21 (* c_~q2_back~0 4)) (.cse29 (+ c_~q2~0.offset .cse19))) (let ((.cse26 (< 0 (+ c_~q2~0.offset .cse19 1))) (.cse45 (= .cse29 0)) (.cse31 (+ .cse21 c_~q2~0.offset)) (.cse42 (+ c_~q1_front~0 c_~n1~0)) (.cse43 (<= .cse36 0)) (.cse44 (< 0 (+ .cse48 c_~q1~0.offset 1))) (.cse47 (+ c_~q1_back~0 2)) (.cse30 (+ c_~t~0 1)) (.cse49 (+ .cse46 c_~q1~0.offset))) (let ((.cse0 (not (= .cse36 0))) (.cse1 (or (<= c_~n1~0 2) (<= .cse49 0))) (.cse2 (not (= .cse49 0))) (.cse14 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~q2~0.base))) (.cse10 (< c_~t~0 1)) (.cse11 (= .cse46 .cse48)) (.cse12 (< 0 .cse30)) (.cse13 (= .cse21 .cse19)) (.cse8 (< c_~n1~0 .cse47)) (.cse9 (< c_~q1_back~0 0)) (.cse20 (select |c_#memory_int| c_~q2~0.base)) (.cse5 (or (<= c_~q1_back~0 c_~q1_front~0) .cse44)) (.cse6 (or (<= .cse42 .cse47) .cse43)) (.cse24 (+ c_~N~0 1)) (.cse15 (not (<= 0 c_~q1_back~0))) (.cse16 (not (< c_~q1_back~0 c_~n1~0))) (.cse17 (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0)) (.cse7 (not (= .cse31 0))) (.cse25 (<= (* 4 c_~n1~0) (+ .cse46 3 c_~q1~0.offset))) (.cse34 (not .cse45)) (.cse27 (<= |c_thread1Thread1of1ForFork1_~i~0#1| 1)) (.cse22 (select (select |c_#memory_int| c_~q1~0.base) .cse36)) (.cse28 (<= 1 c_~N~0)) (.cse3 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q1~0.base))) (.cse4 (or .cse45 (and (<= (+ c_~q2_front~0 c_~n2~0) (+ c_~q2_back~0 2)) .cse26)))) (and (or (and (or .cse0 (and .cse1 (or .cse2 (and .cse3 .cse4)))) .cse5 .cse6) .cse7) (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (or .cse8 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse9 (and (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse10 .cse11 .cse12 (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t3~0#1.base| 1)) .cse13)) (or .cse0 (and .cse1 (or .cse2 (and (<= c_~q2_back~0 c_~q2_front~0) (<= (+ c_~q2_front~0 c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (+ c_~q2_back~0 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse3)))) .cse14 (or .cse15 .cse16 .cse17 (and (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse19)))) (or (<= c_~N~0 (+ c_~t~0 .cse18)) (= .cse18 0)))) (not (= (select .cse20 (+ ~q2~0.offset .cse21)) .cse22)))) (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse19)))) (or (= .cse23 0) (< (+ c_~t~0 .cse23) .cse24)))) (not (= (select .cse20 (+ ~q2~0.offset .cse21)) .cse22)))))) (or .cse25 (and .cse26 .cse27 .cse28 (= (select .cse20 .cse29) 1) (<= .cse29 0)) (<= (* c_~n2~0 4) (+ .cse21 3 c_~q2~0.offset))) (or .cse8 .cse9 (and .cse10 .cse11 .cse14 .cse12 .cse3 .cse13)) (or .cse8 .cse9 (and (< |c_thread1Thread1of1ForFork1_~i~0#1| .cse30) .cse11 .cse14 .cse3 (< c_~t~0 (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1)) .cse13)) (or (<= c_~n2~0 2) (<= .cse31 0)) (or (and .cse10 .cse11 .cse12 .cse3 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse13) .cse8 .cse9) (or (and (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse32 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse19)))) (or (= .cse32 0) (< (+ c_~t~0 .cse32) .cse24)))) (not (= |c_thread2Thread1of1ForFork2_~j~0#1| (select .cse20 (+ ~q2~0.offset .cse21)))))) (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse19)))) (or (<= c_~N~0 (+ c_~t~0 .cse33)) (= .cse33 0)))) (not (= |c_thread2Thread1of1ForFork2_~j~0#1| (select .cse20 (+ ~q2~0.offset .cse21))))))) .cse15 .cse16 .cse17) .cse5 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (or (and (or (and (= |c_thread2Thread1of1ForFork2_~j~0#1| 1) .cse27 .cse28) .cse34) .cse4) .cse25 .cse7) (<= (+ c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse15 .cse16 .cse17 (and (forall ((v_ArrVal_609 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse35 c_~q2~0.base) (+ ~q2~0.offset .cse21)) (select (select .cse35 c_~q1~0.base) .cse36))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse37 (select (select (store .cse35 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse19)))) (or (<= c_~N~0 (+ c_~t~0 .cse37)) (= .cse37 0))))))) (forall ((v_ArrVal_609 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse38 c_~q2~0.base) (+ ~q2~0.offset .cse21)) (select (select .cse38 c_~q1~0.base) .cse36))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse39 (select (select (store .cse38 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse19)))) (or (< (+ c_~t~0 .cse39) .cse24) (= .cse39 0))))))))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= c_~t~0 0) .cse6 (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse40 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse29))) (or (< (+ c_~t~0 .cse40) .cse24) (= .cse40 0)))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse29))) (or (<= c_~N~0 (+ c_~t~0 .cse41)) (= .cse41 0))))) .cse15 .cse16 .cse17) (or .cse7 (and (or .cse25 (and (or .cse34 (and .cse27 (= .cse22 1) .cse28)) .cse3 .cse4)) (or (<= .cse42 (+ c_~q1_back~0 1)) .cse43) .cse44))))))) is different from false [2022-12-14 12:18:02,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:18:06,053 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_~q2_front~0 4)) (.cse40 (* c_~q1_front~0 4))) (let ((.cse38 (* c_~q1_back~0 4)) (.cse27 (+ .cse40 c_~q1~0.offset)) (.cse16 (* c_~q2_back~0 4)) (.cse23 (+ c_~q2~0.offset .cse14))) (let ((.cse21 (< 0 (+ c_~q2~0.offset .cse14 1))) (.cse37 (= .cse23 0)) (.cse24 (+ .cse16 c_~q2~0.offset)) (.cse34 (+ c_~q1_front~0 c_~n1~0)) (.cse35 (<= .cse27 0)) (.cse36 (< 0 (+ .cse40 c_~q1~0.offset 1))) (.cse9 (<= c_~n1~0 2)) (.cse39 (+ .cse38 c_~q1~0.offset))) (let ((.cse0 (not (= .cse27 0))) (.cse1 (or .cse9 (<= .cse39 0))) (.cse2 (not (= .cse39 0))) (.cse15 (select |c_#memory_int| c_~q2~0.base)) (.cse5 (or (<= c_~q1_back~0 c_~q1_front~0) .cse36)) (.cse6 (or (<= .cse34 (+ c_~q1_back~0 2)) .cse35)) (.cse19 (+ c_~N~0 1)) (.cse10 (not (<= 0 c_~q1_back~0))) (.cse11 (not (< c_~q1_back~0 c_~n1~0))) (.cse12 (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0)) (.cse7 (not (= .cse24 0))) (.cse20 (<= (* 4 c_~n1~0) (+ .cse38 3 c_~q1~0.offset))) (.cse25 (not .cse37)) (.cse8 (<= |c_thread1Thread1of1ForFork1_~i~0#1| 1)) (.cse17 (select (select |c_#memory_int| c_~q1~0.base) .cse27)) (.cse22 (<= 1 c_~N~0)) (.cse3 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q1~0.base))) (.cse4 (or .cse37 (and (<= (+ c_~q2_front~0 c_~n2~0) (+ c_~q2_back~0 2)) .cse21)))) (and (or (and (or .cse0 (and .cse1 (or .cse2 (and .cse3 .cse4)))) .cse5 .cse6) .cse7) (= c_~q2~0.offset 0) .cse8 (= c_~q1~0.offset 0) (or .cse0 (and .cse1 (or .cse2 (and (<= c_~q2_back~0 c_~q2_front~0) (<= (+ c_~q2_front~0 c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (+ c_~q2_back~0 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse3)))) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~q2~0.base)) .cse9 (or .cse10 .cse11 .cse12 (and (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse14)))) (or (<= c_~N~0 (+ c_~t~0 .cse13)) (= .cse13 0)))) (not (= (select .cse15 (+ ~q2~0.offset .cse16)) .cse17)))) (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse14)))) (or (= .cse18 0) (< (+ c_~t~0 .cse18) .cse19)))) (not (= (select .cse15 (+ ~q2~0.offset .cse16)) .cse17)))))) (or .cse20 (and .cse21 .cse8 .cse22 (= (select .cse15 .cse23) 1) (<= .cse23 0)) (<= (* c_~n2~0 4) (+ .cse16 3 c_~q2~0.offset))) (or (<= c_~n2~0 2) (<= .cse24 0)) (<= (+ 2 c_~q2~0.base) |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse5 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (or (and (or (and (= |c_thread2Thread1of1ForFork2_~j~0#1| 1) .cse8 .cse22) .cse25) .cse4) .cse20 .cse7) (= c_~q2_front~0 c_~q2_back~0) (<= (+ c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (< 0 c_~N~0) (or .cse10 .cse11 .cse12 (and (forall ((v_ArrVal_609 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse26 c_~q2~0.base) (+ ~q2~0.offset .cse16)) (select (select .cse26 c_~q1~0.base) .cse27))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse28 (select (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse14)))) (or (<= c_~N~0 (+ c_~t~0 .cse28)) (= .cse28 0))))))) (forall ((v_ArrVal_609 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse29 c_~q2~0.base) (+ ~q2~0.offset .cse16)) (select (select .cse29 c_~q1~0.base) .cse27))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse30 (select (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse14)))) (or (< (+ c_~t~0 .cse30) .cse19) (= .cse30 0))))))))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_front~0_109 Int)) (let ((.cse31 (select (select |c_#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_109 4) ~q1~0.offset)))) (and (<= (+ v_~q1_front~0_109 1) c_~q1_back~0) (< v_~q1_front~0_109 c_~n1~0) (<= (+ ~q1~0.base 2) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= .cse31 |c_thread2Thread1of1ForFork2_~j~0#1|) (= .cse31 1) (<= 0 v_~q1_front~0_109)))) (= c_~t~0 0) .cse6 (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse32 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse23))) (or (< (+ c_~t~0 .cse32) .cse19) (= .cse32 0)))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse23))) (or (<= c_~N~0 (+ c_~t~0 .cse33)) (= .cse33 0))))) .cse10 .cse11 .cse12) (or .cse7 (and (or .cse20 (and (or .cse25 (and .cse8 (= .cse17 1) .cse22)) .cse3 .cse4)) (or (<= .cse34 (+ c_~q1_back~0 1)) .cse35) .cse36))))))) is different from false [2022-12-14 12:18:06,410 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q2_front~0 4))) (let ((.cse9 (+ c_~N~0 1)) (.cse18 (+ c_~q2~0.offset .cse4))) (let ((.cse6 (* c_~q2_back~0 4)) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse11 (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse19 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse18))) (or (< (+ c_~t~0 .cse19) .cse9) (= .cse19 0))))) (.cse12 (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse18))) (or (<= c_~N~0 (+ c_~t~0 .cse17)) (= .cse17 0))))) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse1 (not (< c_~q1_back~0 c_~n1~0))) (.cse2 (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0))) (and (or .cse0 .cse1 .cse2 (let ((.cse5 (select |c_#memory_int| c_~q2~0.base)) (.cse7 (select (select |c_#memory_int| c_~q1~0.base) .cse10))) (and (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (<= c_~N~0 (+ c_~t~0 .cse3)) (= .cse3 0)))) (not (= (select .cse5 (+ ~q2~0.offset .cse6)) .cse7)))) (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (= .cse8 0) (< (+ c_~t~0 .cse8) .cse9)))) (not (= (select .cse5 (+ ~q2~0.offset .cse6)) .cse7))))))) .cse11 .cse12 (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_609 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse13 c_~q2~0.base) (+ ~q2~0.offset .cse6)) (select (select .cse13 c_~q1~0.base) .cse10))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse14 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (<= c_~N~0 (+ c_~t~0 .cse14)) (= .cse14 0))))))) (forall ((v_ArrVal_609 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse15 c_~q2~0.base) (+ ~q2~0.offset .cse6)) (select (select .cse15 c_~q1~0.base) .cse10))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse16 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (< (+ c_~t~0 .cse16) .cse9) (= .cse16 0))))))))) (or (and .cse11 .cse12) .cse0 .cse1 .cse2))))) is different from false [2022-12-14 12:18:10,292 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~q2_back~0 4)) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse9 (+ c_~N~0 1)) (.cse4 (* c_~q2_front~0 4)) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse1 (not (< c_~q1_back~0 c_~n1~0))) (.cse2 (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0))) (and (<= |c_thread1Thread1of1ForFork1_~i~0#1| 1) (<= c_~n1~0 2) (or .cse0 .cse1 .cse2 (let ((.cse5 (select |c_#memory_int| c_~q2~0.base)) (.cse7 (select (select |c_#memory_int| c_~q1~0.base) .cse10))) (and (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (<= c_~N~0 (+ c_~t~0 .cse3)) (= .cse3 0)))) (not (= (select .cse5 (+ ~q2~0.offset .cse6)) .cse7)))) (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (= .cse8 0) (< (+ c_~t~0 .cse8) .cse9)))) (not (= (select .cse5 (+ ~q2~0.offset .cse6)) .cse7))))))) (<= (+ 2 c_~q2~0.base) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= c_~q2_front~0 c_~q2_back~0) (< 0 c_~N~0) (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_609 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse11 c_~q2~0.base) (+ ~q2~0.offset .cse6)) (select (select .cse11 c_~q1~0.base) .cse10))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse12 (select (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (<= c_~N~0 (+ c_~t~0 .cse12)) (= .cse12 0))))))) (forall ((v_ArrVal_609 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse13 c_~q2~0.base) (+ ~q2~0.offset .cse6)) (select (select .cse13 c_~q1~0.base) .cse10))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse14 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (< (+ c_~t~0 .cse14) .cse9) (= .cse14 0))))))))) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_front~0_109 Int)) (let ((.cse15 (select (select |c_#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_109 4) ~q1~0.offset)))) (and (<= (+ v_~q1_front~0_109 1) c_~q1_back~0) (< v_~q1_front~0_109 c_~n1~0) (<= (+ ~q1~0.base 2) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= .cse15 |c_thread2Thread1of1ForFork2_~j~0#1|) (= .cse15 1) (<= 0 v_~q1_front~0_109)))) (= c_~t~0 0) (or (let ((.cse17 (+ c_~q2~0.offset .cse4))) (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse17))) (or (< (+ c_~t~0 .cse16) .cse9) (= .cse16 0)))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse17))) (or (<= c_~N~0 (+ c_~t~0 .cse18)) (= .cse18 0)))))) .cse0 .cse1 .cse2))) is different from false [2022-12-14 12:18:10,402 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (let ((.cse0 (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse3))) (or (< (+ c_~t~0 .cse4) (+ c_~N~0 1)) (= .cse4 0))))) (.cse1 (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse3))) (or (<= c_~N~0 (+ c_~t~0 .cse2)) (= .cse2 0)))))) (and .cse0 .cse1 (or (and .cse0 .cse1) (not (<= 0 c_~q1_back~0)) (not (< c_~q1_back~0 c_~n1~0)) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0))))) is different from false [2022-12-14 12:18:13,589 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| c_~q2~0.base)) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse1 (not (< c_~q1_back~0 c_~n1~0))) (.cse2 (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0)) (.cse6 (* c_~q2_back~0 4)) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse9 (+ c_~N~0 1)) (.cse4 (* c_~q2_front~0 4))) (and (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~q2~0.base)) (or .cse0 .cse1 .cse2 (let ((.cse7 (select (select |c_#memory_int| c_~q1~0.base) .cse10))) (and (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (<= c_~N~0 (+ c_~t~0 .cse3)) (= .cse3 0)))) (not (= (select .cse5 (+ ~q2~0.offset .cse6)) .cse7)))) (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (= .cse8 0) (< (+ c_~t~0 .cse8) .cse9)))) (not (= (select .cse5 (+ ~q2~0.offset .cse6)) .cse7))))))) (or (<= (* 4 c_~n1~0) (+ (* c_~q1_back~0 4) 3 c_~q1~0.offset)) (let ((.cse11 (+ c_~q2~0.offset .cse4))) (and (< 0 (+ c_~q2~0.offset .cse4 1)) (<= |c_thread1Thread1of1ForFork1_~i~0#1| 1) (<= 1 c_~N~0) (= (select .cse5 .cse11) 1) (<= .cse11 0))) (<= (* c_~n2~0 4) (+ .cse6 3 c_~q2~0.offset))) (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_609 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse12 c_~q2~0.base) (+ ~q2~0.offset .cse6)) (select (select .cse12 c_~q1~0.base) .cse10))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse13 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (<= c_~N~0 (+ c_~t~0 .cse13)) (= .cse13 0))))))) (forall ((v_ArrVal_609 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse14 c_~q2~0.base) (+ ~q2~0.offset .cse6)) (select (select .cse14 c_~q1~0.base) .cse10))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse15 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (< (+ c_~t~0 .cse15) .cse9) (= .cse15 0))))))))) (= c_~t~0 0))) is different from false [2022-12-14 12:18:18,592 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~q2_front~0 4))) (let ((.cse2 (+ c_~q2~0.offset .cse5)) (.cse1 (+ c_~N~0 1))) (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse2))) (or (< (+ c_~t~0 .cse0) .cse1) (= .cse0 0)))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse2))) (or (<= c_~N~0 (+ c_~t~0 .cse3)) (= .cse3 0)))) (or (let ((.cse6 (select |c_#memory_int| c_~q2~0.base)) (.cse7 (* c_~q2_back~0 4))) (and (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse5)))) (or (= .cse4 0) (< (+ c_~t~0 .cse4) .cse1)))) (not (= |c_thread2Thread1of1ForFork2_~j~0#1| (select .cse6 (+ ~q2~0.offset .cse7)))))) (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse5)))) (or (<= c_~N~0 (+ c_~t~0 .cse8)) (= .cse8 0)))) (not (= |c_thread2Thread1of1ForFork2_~j~0#1| (select .cse6 (+ ~q2~0.offset .cse7)))))))) (not (<= 0 c_~q1_back~0)) (not (< c_~q1_back~0 c_~n1~0)) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0))))) is different from false [2022-12-14 12:18:19,582 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q2_front~0 4))) (let ((.cse3 (+ c_~N~0 1)) (.cse12 (+ c_~q2~0.offset .cse4))) (let ((.cse0 (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse12))) (or (< (+ c_~t~0 .cse13) .cse3) (= .cse13 0))))) (.cse1 (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse12))) (or (<= c_~N~0 (+ c_~t~0 .cse11)) (= .cse11 0))))) (.cse8 (not (<= 0 c_~q1_back~0))) (.cse9 (not (< c_~q1_back~0 c_~n1~0))) (.cse10 (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0))) (and .cse0 .cse1 (or (let ((.cse5 (select |c_#memory_int| c_~q2~0.base)) (.cse6 (* c_~q2_back~0 4))) (and (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (= .cse2 0) (< (+ c_~t~0 .cse2) .cse3)))) (not (= |c_thread2Thread1of1ForFork2_~j~0#1| (select .cse5 (+ ~q2~0.offset .cse6)))))) (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (<= c_~N~0 (+ c_~t~0 .cse7)) (= .cse7 0)))) (not (= |c_thread2Thread1of1ForFork2_~j~0#1| (select .cse5 (+ ~q2~0.offset .cse6)))))))) .cse8 .cse9 .cse10) (or (and .cse0 .cse1) .cse8 .cse9 .cse10))))) is different from false [2022-12-14 12:18:25,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 12:18:32,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:18:35,471 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q2_front~0 4))) (let ((.cse5 (select |c_#memory_int| c_~q2~0.base)) (.cse25 (+ c_~q2~0.offset .cse4))) (let ((.cse6 (* c_~q2_back~0 4)) (.cse17 (select .cse5 .cse25))) (let ((.cse11 (< 0 (+ c_~q2~0.offset .cse4 1))) (.cse12 (<= 1 c_~N~0)) (.cse13 (= .cse17 1)) (.cse14 (<= .cse25 0)) (.cse15 (<= (* c_~n2~0 4) (+ .cse6 3 c_~q2~0.offset))) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse9 (+ c_~N~0 1)) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse1 (not (< c_~q1_back~0 c_~n1~0))) (.cse2 (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0))) (and (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~q2~0.base)) (or .cse0 .cse1 .cse2 (let ((.cse7 (select (select |c_#memory_int| c_~q1~0.base) .cse10))) (and (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (<= c_~N~0 (+ c_~t~0 .cse3)) (= .cse3 0)))) (not (= (select .cse5 (+ ~q2~0.offset .cse6)) .cse7)))) (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (= .cse8 0) (< (+ c_~t~0 .cse8) .cse9)))) (not (= (select .cse5 (+ ~q2~0.offset .cse6)) .cse7))))))) (or (<= (* 4 c_~n1~0) (+ (* c_~q1_back~0 4) 3 c_~q1~0.offset)) (and .cse11 (<= |c_thread1Thread1of1ForFork1_~i~0#1| 1) .cse12 .cse13 .cse14) .cse15) (or (let ((.cse16 (+ c_~t~0 .cse17))) (and (<= c_~N~0 .cse16) (< .cse16 .cse9))) (= .cse17 0)) (or (and (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (= .cse18 0) (< (+ c_~t~0 .cse18) .cse9)))) (not (= |c_thread2Thread1of1ForFork2_~j~0#1| (select .cse5 (+ ~q2~0.offset .cse6)))))) (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse19 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (<= c_~N~0 (+ c_~t~0 .cse19)) (= .cse19 0)))) (not (= |c_thread2Thread1of1ForFork2_~j~0#1| (select .cse5 (+ ~q2~0.offset .cse6))))))) .cse0 .cse1 .cse2) (or (and .cse11 .cse12 (<= c_~N~0 1) .cse13 .cse14) .cse15) (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_609 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse20 c_~q2~0.base) (+ ~q2~0.offset .cse6)) (select (select .cse20 c_~q1~0.base) .cse10))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse21 (select (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (<= c_~N~0 (+ c_~t~0 .cse21)) (= .cse21 0))))))) (forall ((v_ArrVal_609 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse22 c_~q2~0.base) (+ ~q2~0.offset .cse6)) (select (select .cse22 c_~q1~0.base) .cse10))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse23 (select (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (< (+ c_~t~0 .cse23) .cse9) (= .cse23 0))))))))) (= c_~t~0 0) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse25))) (or (< (+ c_~t~0 .cse24) .cse9) (= .cse24 0)))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse25))) (or (<= c_~N~0 (+ c_~t~0 .cse26)) (= .cse26 0))))) .cse0 .cse1 .cse2)))))) is different from false [2022-12-14 12:18:39,311 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q2_front~0 4))) (let ((.cse5 (select |c_#memory_int| c_~q2~0.base)) (.cse23 (+ c_~q2~0.offset .cse4))) (let ((.cse6 (* c_~q2_back~0 4)) (.cse17 (select .cse5 .cse23))) (let ((.cse11 (< 0 (+ c_~q2~0.offset .cse4 1))) (.cse12 (<= 1 c_~N~0)) (.cse13 (= .cse17 1)) (.cse14 (<= .cse23 0)) (.cse15 (<= (* c_~n2~0 4) (+ .cse6 3 c_~q2~0.offset))) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse9 (+ c_~N~0 1)) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse1 (not (< c_~q1_back~0 c_~n1~0))) (.cse2 (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0))) (and (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~q2~0.base)) (or .cse0 .cse1 .cse2 (let ((.cse7 (select (select |c_#memory_int| c_~q1~0.base) .cse10))) (and (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (<= c_~N~0 (+ c_~t~0 .cse3)) (= .cse3 0)))) (not (= (select .cse5 (+ ~q2~0.offset .cse6)) .cse7)))) (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (= .cse8 0) (< (+ c_~t~0 .cse8) .cse9)))) (not (= (select .cse5 (+ ~q2~0.offset .cse6)) .cse7))))))) (or (<= (* 4 c_~n1~0) (+ (* c_~q1_back~0 4) 3 c_~q1~0.offset)) (and .cse11 (<= |c_thread1Thread1of1ForFork1_~i~0#1| 1) .cse12 .cse13 .cse14) .cse15) (or (let ((.cse16 (+ c_~t~0 .cse17))) (and (<= c_~N~0 .cse16) (< .cse16 .cse9))) (= .cse17 0)) (or (and .cse11 .cse12 (<= c_~N~0 1) .cse13 .cse14) .cse15) (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_609 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse18 c_~q2~0.base) (+ ~q2~0.offset .cse6)) (select (select .cse18 c_~q1~0.base) .cse10))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse19 (select (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (<= c_~N~0 (+ c_~t~0 .cse19)) (= .cse19 0))))))) (forall ((v_ArrVal_609 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse20 c_~q2~0.base) (+ ~q2~0.offset .cse6)) (select (select .cse20 c_~q1~0.base) .cse10))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse21 (select (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) (+ ~q2~0.offset .cse4)))) (or (< (+ c_~t~0 .cse21) .cse9) (= .cse21 0))))))))) (= c_~t~0 0) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse23))) (or (< (+ c_~t~0 .cse22) .cse9) (= .cse22 0)))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~q2~0.base) .cse23))) (or (<= c_~N~0 (+ c_~t~0 .cse24)) (= .cse24 0))))) .cse0 .cse1 .cse2)))))) is different from false [2022-12-14 12:18:40,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:18:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:18:44,579 INFO L93 Difference]: Finished difference Result 8263 states and 27166 transitions. [2022-12-14 12:18:44,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-12-14 12:18:44,579 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 44 states have internal predecessors, (86), 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 30 [2022-12-14 12:18:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:18:44,596 INFO L225 Difference]: With dead ends: 8263 [2022-12-14 12:18:44,596 INFO L226 Difference]: Without dead ends: 8118 [2022-12-14 12:18:44,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 121 ConstructedPredicates, 11 IntricatePredicates, 4 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=1502, Invalid=10876, Unknown=98, NotChecked=2530, Total=15006 [2022-12-14 12:18:44,599 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 674 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 4959 mSolverCounterSat, 254 mSolverCounterUnsat, 256 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 7094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 4959 IncrementalHoareTripleChecker+Invalid, 256 IncrementalHoareTripleChecker+Unknown, 1625 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2022-12-14 12:18:44,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 679 Invalid, 7094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 4959 Invalid, 256 Unknown, 1625 Unchecked, 16.8s Time] [2022-12-14 12:18:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8118 states. [2022-12-14 12:18:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8118 to 4554. [2022-12-14 12:18:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4554 states, 4553 states have (on average 3.617614759499231) internal successors, (16471), 4553 states have internal predecessors, (16471), 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) [2022-12-14 12:18:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 16471 transitions. [2022-12-14 12:18:44,707 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 16471 transitions. Word has length 30 [2022-12-14 12:18:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:18:44,708 INFO L495 AbstractCegarLoop]: Abstraction has 4554 states and 16471 transitions. [2022-12-14 12:18:44,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 44 states have internal predecessors, (86), 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) [2022-12-14 12:18:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 16471 transitions. [2022-12-14 12:18:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 12:18:44,715 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:18:44,715 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] [2022-12-14 12:18:44,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 12:18:44,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 12:18:44,917 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)] === [2022-12-14 12:18:44,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:18:44,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1881441410, now seen corresponding path program 3 times [2022-12-14 12:18:44,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:18:44,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272475276] [2022-12-14 12:18:44,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:18:44,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:18:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:18:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:18:46,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:18:46,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272475276] [2022-12-14 12:18:46,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272475276] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:18:46,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61517945] [2022-12-14 12:18:46,873 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:18:46,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:18:46,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:18:46,874 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:18:46,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 12:18:46,980 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:18:46,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:18:46,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 92 conjunts are in the unsatisfiable core [2022-12-14 12:18:46,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:18:47,022 INFO L321 Elim1Store]: treesize reduction 79, result has 27.5 percent of original size [2022-12-14 12:18:47,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 110 [2022-12-14 12:18:47,213 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-14 12:18:47,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:18:47,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 12:18:48,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 41 [2022-12-14 12:18:48,244 INFO L350 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 0 case distinctions, treesize of input 42 treesize of output 10 [2022-12-14 12:18:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:18:48,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:18:48,864 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (let ((.cse0 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_679) c_~q2~0.base) .cse0)) (+ c_~N~0 1))) (forall ((v_ArrVal_679 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_679) c_~q2~0.base) .cse0)))))) (< c_~q1_back~0 0) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (= |c_thread2Thread1of1ForFork2_~j~0#1| 0) (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)) |c_thread2Thread1of1ForFork2_~j~0#1|)) (<= c_~n2~0 (+ c_~q2_back~0 1))) is different from false [2022-12-14 12:18:49,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:18:49,279 INFO L350 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 522 treesize of output 510 [2022-12-14 12:18:49,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:18:49,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 405 treesize of output 408 [2022-12-14 12:18:49,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:18:49,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 363 treesize of output 372 [2022-12-14 12:18:49,366 INFO L350 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 327 treesize of output 315 [2022-12-14 12:18:49,379 INFO L350 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 315 treesize of output 291 [2022-12-14 12:19:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 12:19:00,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61517945] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:19:00,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [388404692] [2022-12-14 12:19:00,340 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:19:00,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:19:00,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 49 [2022-12-14 12:19:00,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859245211] [2022-12-14 12:19:00,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:19:00,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-14 12:19:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:19:00,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-14 12:19:00,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2178, Unknown=5, NotChecked=96, Total=2550 [2022-12-14 12:19:00,342 INFO L87 Difference]: Start difference. First operand 4554 states and 16471 transitions. Second operand has 51 states, 50 states have (on average 1.76) internal successors, (88), 50 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:19:25,263 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~q2_back~0 4)) (.cse31 (* c_~q2_front~0 4)) (.cse32 (* c_~q1_back~0 4)) (.cse30 (* c_~q1_front~0 4))) (let ((.cse21 (+ .cse30 c_~q1~0.offset)) (.cse12 (<= c_~n1~0 2)) (.cse24 (+ .cse32 c_~q1~0.offset)) (.cse15 (<= c_~n2~0 2)) (.cse6 (+ c_~q2~0.offset .cse31)) (.cse20 (+ .cse10 c_~q2~0.offset))) (let ((.cse0 (not (<= 0 c_~q1_back~0))) (.cse1 (not (< c_~q2_back~0 c_~n2~0))) (.cse2 (not (< c_~q1_back~0 c_~n1~0))) (.cse7 (not (<= 0 c_~q2_back~0))) (.cse9 (<= (* 4 c_~n1~0) (+ .cse32 3 c_~q1~0.offset))) (.cse8 (<= |c_thread1Thread1of1ForFork1_~i~0#1| 1)) (.cse3 (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0)) (.cse5 (+ c_~N~0 1)) (.cse13 (or (= .cse6 0) (not (= .cse20 0)) (and (<= (+ c_~q2_front~0 c_~n2~0) (+ c_~q2_back~0 2)) (< 0 (+ c_~q2~0.offset .cse31 1))))) (.cse11 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~q2~0.base))) (.cse14 (or .cse15 (<= .cse20 0))) (.cse16 (or (<= c_~q1_back~0 c_~q1_front~0) (< 0 (+ .cse30 c_~q1~0.offset 1)))) (.cse28 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q1~0.base))) (.cse27 (not (= .cse24 0))) (.cse26 (or .cse12 (<= .cse24 0))) (.cse25 (not (= .cse21 0))) (.cse29 (or (<= (+ c_~q1_front~0 c_~n1~0) (+ c_~q1_back~0 2)) (<= .cse21 0)))) (and (= c_~q2~0.offset 0) (or .cse0 .cse1 .cse2 .cse3 (let ((.cse4 (+ c_~t~0 (select (select |c_#memory_int| c_~q2~0.base) .cse6)))) (and (<= c_~N~0 .cse4) (< .cse4 .cse5))) .cse7) (or .cse0 .cse1 (and (forall ((v_ArrVal_679 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_679) c_~q2~0.base) .cse6)) .cse5)) (forall ((v_ArrVal_679 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_679) c_~q2~0.base) .cse6))))) .cse2 .cse3 .cse7) .cse8 (= c_~q1~0.offset 0) (or (and (<= |c_thread1Thread1of1ForFork1_~i~0#1| c_~t~0) (<= c_~t~0 c_~N~0)) .cse9 (<= (* c_~n2~0 4) (+ .cse10 3 c_~q2~0.offset))) .cse11 .cse12 (or .cse9 (and (= |c_thread2Thread1of1ForFork2_~j~0#1| 1) .cse8 .cse13 .cse11 (<= 1 c_~N~0) .cse14)) .cse15 .cse16 (exists ((~q1_front~0 Int) (~q1~0.base Int)) (let ((.cse17 (select (select |c_#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))))) (and (= |c_thread2Thread1of1ForFork2_~j~0#1| .cse17) (< ~q1_front~0 (+ c_~n1~0 1)) (<= ~q1_front~0 c_~q1_back~0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| ~q1~0.base)) (<= 1 ~q1_front~0) (not (= ~q1~0.base c_~q2~0.base)) (= .cse17 1)))) (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (< c_~q1_back~0 0) .cse3 (and (forall ((v_ArrVal_678 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_678))) (let ((.cse18 (select (select .cse19 c_~q1~0.base) .cse21))) (or (= .cse18 0) (forall ((v_ArrVal_679 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_679) c_~q2~0.base) .cse6)))) (not (= .cse18 (select (select .cse19 c_~q2~0.base) .cse20))))))) (forall ((v_ArrVal_678 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_678))) (let ((.cse22 (select (select .cse23 c_~q1~0.base) .cse21))) (or (= .cse22 0) (not (= .cse22 (select (select .cse23 c_~q2~0.base) .cse20))) (forall ((v_ArrVal_679 (Array Int Int))) (< (+ c_~t~0 (select (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_679) c_~q2~0.base) .cse6)) .cse5))))))) (<= c_~n2~0 (+ c_~q2_back~0 1))) (= c_~q2_front~0 c_~q2_back~0) (or (not (= (select (select |c_#memory_int| c_~q1~0.base) .cse24) 1)) (and (or .cse25 (and .cse26 (or .cse27 (and .cse13 .cse11 .cse28 .cse14)))) .cse16 .cse29)) (or (and (or (and (<= c_~q2_back~0 c_~q2_front~0) (<= (+ c_~q2_front~0 c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (+ c_~q2_back~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) .cse28 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse27) .cse26) .cse25) (< 0 c_~N~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= c_~t~0 0) .cse29)))) is different from false [2022-12-14 12:19:37,832 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 88 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 12:20:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:20:41,816 INFO L93 Difference]: Finished difference Result 10708 states and 35240 transitions. [2022-12-14 12:20:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-12-14 12:20:41,816 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.76) internal successors, (88), 50 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 12:20:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:20:41,836 INFO L225 Difference]: With dead ends: 10708 [2022-12-14 12:20:41,836 INFO L226 Difference]: Without dead ends: 10540 [2022-12-14 12:20:41,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 28 SyntacticMatches, 21 SemanticMatches, 189 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 14165 ImplicationChecksByTransitivity, 94.7s TimeCoverageRelationStatistics Valid=5606, Invalid=29585, Unknown=349, NotChecked=750, Total=36290 [2022-12-14 12:20:41,841 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1113 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 6043 mSolverCounterSat, 631 mSolverCounterUnsat, 215 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 7105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 631 IncrementalHoareTripleChecker+Valid, 6043 IncrementalHoareTripleChecker+Invalid, 215 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-12-14 12:20:41,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 743 Invalid, 7105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [631 Valid, 6043 Invalid, 215 Unknown, 216 Unchecked, 9.5s Time] [2022-12-14 12:20:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2022-12-14 12:20:41,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 4981. [2022-12-14 12:20:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4981 states, 4980 states have (on average 3.7104417670682732) internal successors, (18478), 4980 states have internal predecessors, (18478), 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) [2022-12-14 12:20:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4981 states to 4981 states and 18478 transitions. [2022-12-14 12:20:41,978 INFO L78 Accepts]: Start accepts. Automaton has 4981 states and 18478 transitions. Word has length 30 [2022-12-14 12:20:41,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:20:41,979 INFO L495 AbstractCegarLoop]: Abstraction has 4981 states and 18478 transitions. [2022-12-14 12:20:41,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.76) internal successors, (88), 50 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:20:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4981 states and 18478 transitions. [2022-12-14 12:20:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 12:20:41,987 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:20:41,988 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] [2022-12-14 12:20:41,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 12:20:42,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:20:42,189 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)] === [2022-12-14 12:20:42,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:20:42,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1943070884, now seen corresponding path program 4 times [2022-12-14 12:20:42,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:20:42,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616120307] [2022-12-14 12:20:42,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:20:42,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:20:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:20:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:20:44,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:20:44,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616120307] [2022-12-14 12:20:44,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616120307] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:20:44,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367550001] [2022-12-14 12:20:44,123 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:20:44,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:20:44,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:20:44,124 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:20:44,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 12:20:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:20:44,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 12:20:44,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:20:44,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:20:44,914 INFO L350 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 18 treesize of output 20 [2022-12-14 12:20:45,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:20:45,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:20:45,456 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 12:20:45,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2022-12-14 12:20:45,589 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-14 12:20:45,589 INFO L350 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 42 treesize of output 10 [2022-12-14 12:20:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:20:45,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:20:45,769 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_741 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_741) c_~q2~0.base) .cse1))) (or (< (+ .cse0 c_~t~0) (+ c_~N~0 1)) (= .cse0 0)))) (forall ((v_ArrVal_741 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_741) c_~q2~0.base) .cse1))) (or (<= c_~N~0 (+ .cse2 c_~t~0)) (= .cse2 0)))))) is different from false [2022-12-14 12:20:45,787 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_741 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_741) c_~q2~0.base) .cse1))) (or (< (+ .cse0 c_~t~0) (+ c_~N~0 1)) (= .cse0 0)))) (forall ((v_ArrVal_741 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_741) c_~q2~0.base) .cse1))) (or (<= c_~N~0 (+ .cse2 c_~t~0)) (= .cse2 0)))))) (not (< c_~q2_back~0 c_~n2~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-12-14 12:20:46,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:20:46,607 INFO L350 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 676 treesize of output 656 [2022-12-14 12:20:46,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:20:46,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 551 treesize of output 548 [2022-12-14 12:20:46,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:20:46,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 503 treesize of output 512 [2022-12-14 12:20:46,710 INFO L350 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 467 treesize of output 443 [2022-12-14 12:20:46,726 INFO L350 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 443 treesize of output 395 [2022-12-14 12:20:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 12:20:51,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367550001] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:20:51,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [601173764] [2022-12-14 12:20:51,142 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:20:51,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:20:51,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 49 [2022-12-14 12:20:51,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045662388] [2022-12-14 12:20:51,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:20:51,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-14 12:20:51,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:20:51,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-14 12:20:51,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2127, Unknown=4, NotChecked=190, Total=2550 [2022-12-14 12:20:51,144 INFO L87 Difference]: Start difference. First operand 4981 states and 18478 transitions. Second operand has 51 states, 50 states have (on average 1.76) internal successors, (88), 50 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:21:12,337 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 79 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 12:21:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:21:28,966 INFO L93 Difference]: Finished difference Result 10395 states and 35071 transitions. [2022-12-14 12:21:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-12-14 12:21:28,966 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.76) internal successors, (88), 50 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 12:21:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:21:28,984 INFO L225 Difference]: With dead ends: 10395 [2022-12-14 12:21:28,984 INFO L226 Difference]: Without dead ends: 10254 [2022-12-14 12:21:28,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 119 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=1990, Invalid=12023, Unknown=37, NotChecked=470, Total=14520 [2022-12-14 12:21:28,986 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 821 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 4057 mSolverCounterSat, 414 mSolverCounterUnsat, 112 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 5205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 4057 IncrementalHoareTripleChecker+Invalid, 112 IncrementalHoareTripleChecker+Unknown, 622 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-12-14 12:21:28,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 507 Invalid, 5205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 4057 Invalid, 112 Unknown, 622 Unchecked, 5.9s Time] [2022-12-14 12:21:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10254 states. [2022-12-14 12:21:29,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10254 to 5525. [2022-12-14 12:21:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5525 states, 5524 states have (on average 3.7022085445329473) internal successors, (20451), 5524 states have internal predecessors, (20451), 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) [2022-12-14 12:21:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5525 states to 5525 states and 20451 transitions. [2022-12-14 12:21:29,128 INFO L78 Accepts]: Start accepts. Automaton has 5525 states and 20451 transitions. Word has length 30 [2022-12-14 12:21:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:21:29,128 INFO L495 AbstractCegarLoop]: Abstraction has 5525 states and 20451 transitions. [2022-12-14 12:21:29,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.76) internal successors, (88), 50 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:21:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 5525 states and 20451 transitions. [2022-12-14 12:21:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 12:21:29,137 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:21:29,137 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 12:21:29,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 12:21:29,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 12:21:29,338 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)] === [2022-12-14 12:21:29,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:21:29,339 INFO L85 PathProgramCache]: Analyzing trace with hash 33655280, now seen corresponding path program 5 times [2022-12-14 12:21:29,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:21:29,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663880034] [2022-12-14 12:21:29,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:21:29,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:21:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:21:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:21:32,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:21:32,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663880034] [2022-12-14 12:21:32,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663880034] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:21:32,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241303270] [2022-12-14 12:21:32,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:21:32,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:21:32,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:21:32,156 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:21:32,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 12:21:32,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 12:21:32,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:21:32,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-14 12:21:32,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:21:32,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:21:32,589 INFO L321 Elim1Store]: treesize reduction 63, result has 32.3 percent of original size [2022-12-14 12:21:32,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 35 [2022-12-14 12:21:32,683 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 12:21:32,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:21:33,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:21:33,266 INFO L350 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 18 treesize of output 20 [2022-12-14 12:21:33,507 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 12:21:33,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-14 12:21:33,512 INFO L350 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 27 treesize of output 15 [2022-12-14 12:21:33,698 INFO L350 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 23 treesize of output 7 [2022-12-14 12:21:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:21:33,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:21:34,248 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_811 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_811) c_~q2~0.base) .cse0)) (+ c_~N~0 1))) (forall ((v_ArrVal_811 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_811) c_~q2~0.base) .cse0)))))) (not (< c_~q2_back~0 c_~n2~0)) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (< c_~n2~0 (+ c_~q2_front~0 2)) (= |c_thread2Thread1of1ForFork2_~j~0#1| 0) (not (<= 0 c_~q2_back~0)) (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)) |c_thread2Thread1of1ForFork2_~j~0#1|))) is different from false [2022-12-14 12:21:34,276 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (or (not (= .cse0 (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_811 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_811) c_~q2~0.base) .cse1)) (+ c_~N~0 1))) (forall ((v_ArrVal_811 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_811) c_~q2~0.base) .cse1)))))) (not (< c_~q2_back~0 c_~n2~0)) (= .cse0 0) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (< c_~n2~0 (+ c_~q2_front~0 2)) (not (<= 0 c_~q2_back~0)))) is different from false [2022-12-14 12:21:34,363 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~q2_back~0 c_~n2~0)) (let ((.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse3 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse4 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (and (forall ((v_ArrVal_810 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_810))) (let ((.cse0 (select (select .cse1 c_~q2~0.base) .cse4))) (or (= .cse0 0) (forall ((v_ArrVal_811 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_811) c_~q2~0.base) .cse2)))) (not (= (select (select .cse1 c_~q1~0.base) .cse3) .cse0)))))) (forall ((v_ArrVal_810 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_810))) (let ((.cse5 (select (select .cse6 c_~q2~0.base) .cse4))) (or (= .cse5 0) (forall ((v_ArrVal_811 (Array Int Int))) (< (+ c_~t~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_811) c_~q2~0.base) .cse2)) (+ c_~N~0 1))) (not (= (select (select .cse6 c_~q1~0.base) .cse3) .cse5)))))))) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (< c_~n2~0 (+ c_~q2_front~0 2)) (not (<= 0 c_~q2_back~0))) is different from false [2022-12-14 12:21:34,433 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:21:34,433 INFO L350 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 530 treesize of output 518 [2022-12-14 12:21:34,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:21:34,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 413 treesize of output 422 [2022-12-14 12:21:34,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:21:34,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 377 treesize of output 380 [2022-12-14 12:21:34,531 INFO L350 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 335 treesize of output 311 [2022-12-14 12:21:34,545 INFO L350 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 311 treesize of output 299 [2022-12-14 12:21:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2022-12-14 12:21:43,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241303270] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:21:43,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1042258271] [2022-12-14 12:21:43,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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:21:43,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:21:43,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 46 [2022-12-14 12:21:43,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951772696] [2022-12-14 12:21:43,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:21:43,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-12-14 12:21:43,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:21:43,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-12-14 12:21:43,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1832, Unknown=4, NotChecked=264, Total=2256 [2022-12-14 12:21:43,358 INFO L87 Difference]: Start difference. First operand 5525 states and 20451 transitions. Second operand has 48 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 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) [2022-12-14 12:22:11,598 WARN L233 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 69 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 12:22:27,214 WARN L233 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 102 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 12:22:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:22:31,416 INFO L93 Difference]: Finished difference Result 10570 states and 36726 transitions. [2022-12-14 12:22:31,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-12-14 12:22:31,416 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 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 [2022-12-14 12:22:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:22:31,434 INFO L225 Difference]: With dead ends: 10570 [2022-12-14 12:22:31,434 INFO L226 Difference]: Without dead ends: 9839 [2022-12-14 12:22:31,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 125 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 4149 ImplicationChecksByTransitivity, 44.7s TimeCoverageRelationStatistics Valid=1659, Invalid=13600, Unknown=5, NotChecked=738, Total=16002 [2022-12-14 12:22:31,436 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 983 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 4585 mSolverCounterSat, 365 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 6453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 4585 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1498 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-12-14 12:22:31,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 416 Invalid, 6453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 4585 Invalid, 5 Unknown, 1498 Unchecked, 5.7s Time] [2022-12-14 12:22:31,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9839 states. [2022-12-14 12:22:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9839 to 6220. [2022-12-14 12:22:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6220 states, 6219 states have (on average 3.625502492362116) internal successors, (22547), 6219 states have internal predecessors, (22547), 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) [2022-12-14 12:22:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 22547 transitions. [2022-12-14 12:22:31,591 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 22547 transitions. Word has length 31 [2022-12-14 12:22:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:22:31,591 INFO L495 AbstractCegarLoop]: Abstraction has 6220 states and 22547 transitions. [2022-12-14 12:22:31,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 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) [2022-12-14 12:22:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 22547 transitions. [2022-12-14 12:22:31,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 12:22:31,601 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:22:31,601 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 12:22:31,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 12:22:31,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 12:22:31,802 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)] === [2022-12-14 12:22:31,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:22:31,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1255280028, now seen corresponding path program 6 times [2022-12-14 12:22:31,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:22:31,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822266816] [2022-12-14 12:22:31,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:22:31,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:22:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:22:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:22:35,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:22:35,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822266816] [2022-12-14 12:22:35,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822266816] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:22:35,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766937248] [2022-12-14 12:22:35,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:22:35,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:22:35,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:22:35,253 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:22:35,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 12:22:35,407 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:22:35,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:22:35,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 12:22:35,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:35,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:22:35,811 INFO L350 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 18 treesize of output 20 [2022-12-14 12:22:36,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:22:36,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:22:36,304 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 12:22:36,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2022-12-14 12:22:36,505 INFO L321 Elim1Store]: treesize reduction 53, result has 5.4 percent of original size [2022-12-14 12:22:36,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 17 [2022-12-14 12:22:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 12:22:36,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:36,724 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_877 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_877) c_~q2~0.base) .cse1))) (or (< (+ c_~t~0 .cse0) (+ c_~N~0 1)) (= 0 .cse0)))) (forall ((v_ArrVal_877 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_877) c_~q2~0.base) .cse1))) (or (= 0 .cse2) (<= c_~N~0 (+ c_~t~0 .cse2))))))) is different from false [2022-12-14 12:22:37,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:22:37,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 734 treesize of output 834 [2022-12-14 12:22:37,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:22:37,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 593 treesize of output 584 [2022-12-14 12:22:37,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:22:37,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 539 treesize of output 542 [2022-12-14 12:22:37,723 INFO L350 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 497 treesize of output 449 [2022-12-14 12:22:37,745 INFO L350 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 449 treesize of output 425 [2022-12-14 12:23:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-12-14 12:23:13,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766937248] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:23:13,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [332717998] [2022-12-14 12:23:13,317 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:23:13,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:23:13,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 40 [2022-12-14 12:23:13,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363874208] [2022-12-14 12:23:13,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:23:13,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 12:23:13,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:23:13,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 12:23:13,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1505, Unknown=2, NotChecked=78, Total=1722 [2022-12-14 12:23:13,319 INFO L87 Difference]: Start difference. First operand 6220 states and 22547 transitions. Second operand has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 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) [2022-12-14 12:23:18,820 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~q1_front~0 0)) (.cse10 (+ c_~N~0 1)) (.cse6 (* c_~q2_front~0 4)) (.cse7 (* c_~q2_back~0 4)) (.cse1 (<= c_~q1_back~0 c_~q1_front~0)) (.cse2 (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0)) (.cse8 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (<= |c_thread1Thread1of1ForFork1_~i~0#1| 1) (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_876 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_876))) (let ((.cse3 (select (select .cse5 c_~q1~0.base) .cse8))) (or (= .cse3 0) (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_877 (Array Int Int))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_877) c_~q2~0.base) (+ ~q2~0.offset .cse6)))) (or (= .cse4 0) (<= c_~N~0 (+ c_~t~0 .cse4))))) (not (= (select (select .cse5 c_~q2~0.base) (+ ~q2~0.offset .cse7)) .cse3)))))))) (forall ((v_ArrVal_876 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_876))) (let ((.cse12 (select (select .cse11 c_~q1~0.base) .cse8))) (or (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_877 (Array Int Int))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_877) c_~q2~0.base) (+ ~q2~0.offset .cse6)))) (or (< (+ c_~t~0 .cse9) .cse10) (= .cse9 0)))) (not (= (select (select .cse11 c_~q2~0.base) (+ ~q2~0.offset .cse7)) .cse12)))) (= .cse12 0))))))) (exists ((~q1~0.offset Int) (~q1_front~0 Int) (~q1~0.base Int) (v_~q1_back~0_207 Int)) (let ((.cse14 (select |c_#memory_int| ~q1~0.base)) (.cse13 (+ v_~q1_back~0_207 1))) (and (<= ~q1_front~0 .cse13) (<= (+ ~q1~0.base 2) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_thread2Thread1of1ForFork2_~j~0#1| (select .cse14 (+ ~q1~0.offset (- 4) (* ~q1_front~0 4)))) (= (select .cse14 (+ (* v_~q1_back~0_207 4) ~q1~0.offset)) 1) (<= 1 ~q1_front~0) (<= .cse13 ~q1_front~0)))) (<= c_~N~0 1) (<= (+ 2 c_~q2~0.base) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= c_~q2_front~0 c_~q2_back~0) (let ((.cse17 (select (select |c_#memory_int| c_~q1~0.base) .cse8))) (or .cse0 (let ((.cse16 (select |c_#memory_int| c_~q2~0.base))) (and (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_877 (Array Int Int))) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_877) c_~q2~0.base) (+ ~q2~0.offset .cse6)))) (or (<= c_~N~0 (+ c_~t~0 .cse15)) (= .cse15 0)))) (not (= (select .cse16 (+ ~q2~0.offset .cse7)) .cse17)))) (forall ((~q2~0.offset Int)) (or (forall ((v_ArrVal_877 (Array Int Int))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_877) c_~q2~0.base) (+ ~q2~0.offset .cse6)))) (or (< (+ c_~t~0 .cse18) .cse10) (= .cse18 0)))) (not (= (select .cse16 (+ ~q2~0.offset .cse7)) .cse17)))))) .cse1 .cse2 (= .cse17 0))) (< 0 c_~N~0) (= c_~t~0 0))) is different from false [2022-12-14 12:23:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:23:21,809 INFO L93 Difference]: Finished difference Result 6821 states and 23892 transitions. [2022-12-14 12:23:21,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 12:23:21,810 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 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 [2022-12-14 12:23:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:23:21,822 INFO L225 Difference]: With dead ends: 6821 [2022-12-14 12:23:21,822 INFO L226 Difference]: Without dead ends: 6731 [2022-12-14 12:23:21,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=452, Invalid=4104, Unknown=8, NotChecked=266, Total=4830 [2022-12-14 12:23:21,822 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 336 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 66 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-14 12:23:21,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 275 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2297 Invalid, 14 Unknown, 153 Unchecked, 3.3s Time] [2022-12-14 12:23:21,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6731 states. [2022-12-14 12:23:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6731 to 6207. [2022-12-14 12:23:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6207 states, 6206 states have (on average 3.633419271672575) internal successors, (22549), 6206 states have internal predecessors, (22549), 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) [2022-12-14 12:23:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 22549 transitions. [2022-12-14 12:23:21,953 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 22549 transitions. Word has length 31 [2022-12-14 12:23:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:23:21,953 INFO L495 AbstractCegarLoop]: Abstraction has 6207 states and 22549 transitions. [2022-12-14 12:23:21,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 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) [2022-12-14 12:23:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 22549 transitions. [2022-12-14 12:23:21,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 12:23:21,965 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:23:21,965 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 12:23:21,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 12:23:22,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 12:23:22,166 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)] === [2022-12-14 12:23:22,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:23:22,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1413722010, now seen corresponding path program 7 times [2022-12-14 12:23:22,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:23:22,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234621783] [2022-12-14 12:23:22,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:23:22,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:23:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:23:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:23:24,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:23:24,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234621783] [2022-12-14 12:23:24,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234621783] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:23:24,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778345828] [2022-12-14 12:23:24,089 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:23:24,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:23:24,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:23:24,090 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:23:24,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 12:23:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:23:24,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-14 12:23:24,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:23:24,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:23:24,472 INFO L350 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 18 treesize of output 20 [2022-12-14 12:23:24,549 INFO L350 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 25 treesize of output 7 [2022-12-14 12:23:24,730 INFO L350 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 23 treesize of output 7 [2022-12-14 12:23:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 12:23:24,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:23:24,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:23:24,994 INFO L350 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 53 treesize of output 33 [2022-12-14 12:23:25,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:23:25,312 INFO L350 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 181 treesize of output 145 [2022-12-14 12:23:25,319 INFO L350 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 128 treesize of output 116 [2022-12-14 12:23:25,323 INFO L350 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 116 treesize of output 104 [2022-12-14 12:23:25,327 INFO L350 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 104 treesize of output 98 [2022-12-14 12:23:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 12:23:25,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778345828] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:23:25,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1096990158] [2022-12-14 12:23:25,648 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:23:25,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:23:25,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 9] total 36 [2022-12-14 12:23:25,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657394750] [2022-12-14 12:23:25,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:23:25,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 12:23:25,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:23:25,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 12:23:25,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1299, Unknown=2, NotChecked=0, Total=1406 [2022-12-14 12:23:25,650 INFO L87 Difference]: Start difference. First operand 6207 states and 22549 transitions. Second operand has 38 states, 37 states have (on average 2.3513513513513513) internal successors, (87), 37 states have internal predecessors, (87), 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) [2022-12-14 12:23:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:23:29,091 INFO L93 Difference]: Finished difference Result 6852 states and 24059 transitions. [2022-12-14 12:23:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 12:23:29,092 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.3513513513513513) internal successors, (87), 37 states have internal predecessors, (87), 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 [2022-12-14 12:23:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:23:29,103 INFO L225 Difference]: With dead ends: 6852 [2022-12-14 12:23:29,104 INFO L226 Difference]: Without dead ends: 6810 [2022-12-14 12:23:29,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=286, Invalid=3252, Unknown=2, NotChecked=0, Total=3540 [2022-12-14 12:23:29,104 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 232 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 12:23:29,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 319 Invalid, 2651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-14 12:23:29,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6810 states. [2022-12-14 12:23:29,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6810 to 6222. [2022-12-14 12:23:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6222 states, 6221 states have (on average 3.6360713711621924) internal successors, (22620), 6221 states have internal predecessors, (22620), 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) [2022-12-14 12:23:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 22620 transitions. [2022-12-14 12:23:29,208 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 22620 transitions. Word has length 31 [2022-12-14 12:23:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:23:29,209 INFO L495 AbstractCegarLoop]: Abstraction has 6222 states and 22620 transitions. [2022-12-14 12:23:29,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.3513513513513513) internal successors, (87), 37 states have internal predecessors, (87), 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) [2022-12-14 12:23:29,209 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 22620 transitions. [2022-12-14 12:23:29,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 12:23:29,228 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:23:29,229 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 12:23:29,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 12:23:29,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 12:23:29,429 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)] === [2022-12-14 12:23:29,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:23:29,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1954199440, now seen corresponding path program 8 times [2022-12-14 12:23:29,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:23:29,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745052114] [2022-12-14 12:23:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:23:29,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:23:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:23:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:23:31,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:23:31,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745052114] [2022-12-14 12:23:31,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745052114] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:23:31,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430986687] [2022-12-14 12:23:31,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:23:31,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:23:31,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:23:31,146 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:23:31,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 12:23:31,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 12:23:31,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:23:31,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 12:23:31,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:23:31,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:23:31,615 INFO L350 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 18 treesize of output 20 [2022-12-14 12:23:31,669 INFO L350 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 23 treesize of output 7 [2022-12-14 12:23:31,766 INFO L350 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 25 treesize of output 7 [2022-12-14 12:23:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 12:23:31,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:23:31,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:23:31,979 INFO L350 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 42 treesize of output 30 [2022-12-14 12:23:32,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:23:32,191 INFO L350 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 93 treesize of output 81 [2022-12-14 12:23:32,196 INFO L350 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 64 treesize of output 58 [2022-12-14 12:23:32,199 INFO L350 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 58 treesize of output 52 [2022-12-14 12:23:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 12:23:32,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430986687] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:23:32,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1741835962] [2022-12-14 12:23:32,432 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:23:32,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:23:32,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 9] total 36 [2022-12-14 12:23:32,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968815506] [2022-12-14 12:23:32,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:23:32,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 12:23:32,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:23:32,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 12:23:32,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1298, Unknown=3, NotChecked=0, Total=1406 [2022-12-14 12:23:32,434 INFO L87 Difference]: Start difference. First operand 6222 states and 22620 transitions. Second operand has 38 states, 37 states have (on average 2.324324324324324) internal successors, (86), 37 states have internal predecessors, (86), 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) [2022-12-14 12:23:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:23:34,454 INFO L93 Difference]: Finished difference Result 6854 states and 24113 transitions. [2022-12-14 12:23:34,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 12:23:34,454 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.324324324324324) internal successors, (86), 37 states have internal predecessors, (86), 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 [2022-12-14 12:23:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:23:34,467 INFO L225 Difference]: With dead ends: 6854 [2022-12-14 12:23:34,467 INFO L226 Difference]: Without dead ends: 6812 [2022-12-14 12:23:34,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=245, Invalid=2722, Unknown=3, NotChecked=0, Total=2970 [2022-12-14 12:23:34,467 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 277 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:23:34,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 190 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 12:23:34,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6812 states. [2022-12-14 12:23:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6812 to 6219. [2022-12-14 12:23:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6219 states, 6218 states have (on average 3.636378256674172) internal successors, (22611), 6218 states have internal predecessors, (22611), 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) [2022-12-14 12:23:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 22611 transitions. [2022-12-14 12:23:34,594 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 22611 transitions. Word has length 31 [2022-12-14 12:23:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:23:34,595 INFO L495 AbstractCegarLoop]: Abstraction has 6219 states and 22611 transitions. [2022-12-14 12:23:34,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.324324324324324) internal successors, (86), 37 states have internal predecessors, (86), 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) [2022-12-14 12:23:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 22611 transitions. [2022-12-14 12:23:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 12:23:34,604 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:23:34,604 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 12:23:34,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-14 12:23:34,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:23:34,806 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)] === [2022-12-14 12:23:34,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:23:34,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1208572700, now seen corresponding path program 9 times [2022-12-14 12:23:34,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:23:34,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919460010] [2022-12-14 12:23:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:23:34,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:23:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:23:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:23:37,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:23:37,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919460010] [2022-12-14 12:23:37,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919460010] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:23:37,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525619738] [2022-12-14 12:23:37,159 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:23:37,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:23:37,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:23:37,160 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:23:37,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 12:23:37,299 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:23:37,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:23:37,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-14 12:23:37,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:23:37,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:23:37,313 INFO L350 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 39 treesize of output 37 [2022-12-14 12:23:37,775 INFO L350 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 18 treesize of output 20 [2022-12-14 12:23:37,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:23:37,866 INFO L350 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 18 treesize of output 20 [2022-12-14 12:23:38,294 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-14 12:23:38,294 INFO L350 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 54 treesize of output 14 [2022-12-14 12:23:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:23:38,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:23:39,530 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-14 12:23:39,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1286 treesize of output 1306 [2022-12-14 12:23:39,604 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:23:39,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1097 treesize of output 1010 [2022-12-14 12:23:39,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:23:39,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 965 treesize of output 944 [2022-12-14 12:23:39,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:23:39,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 899 treesize of output 812 [2022-12-14 12:23:39,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:23:39,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 767 treesize of output 746 [2022-12-14 12:27:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:27:44,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525619738] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:27:44,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [307223388] [2022-12-14 12:27:44,594 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 12:27:44,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:27:44,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 14] total 47 [2022-12-14 12:27:44,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986543659] [2022-12-14 12:27:44,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:27:44,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-14 12:27:44,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:27:44,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-14 12:27:44,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2146, Unknown=5, NotChecked=0, Total=2352 [2022-12-14 12:27:44,596 INFO L87 Difference]: Start difference. First operand 6219 states and 22611 transitions. Second operand has 49 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 48 states have internal predecessors, (89), 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) [2022-12-14 12:27:56,085 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse39 (* c_~q2_back~0 4))) (let ((.cse18 (< c_~q2_back~0 0)) (.cse19 (< c_~n2~0 (+ c_~q2_back~0 2))) (.cse10 (+ c_~N~0 1)) (.cse8 (+ .cse39 c_~q2~0.offset)) (.cse13 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse20 (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0)) (.cse5 (<= (* c_~n2~0 4) (+ .cse39 3 c_~q2~0.offset))) (.cse0 (<= 1 c_~N~0)) (.cse2 (<= 0 c_~q2_front~0)) (.cse3 (<= .cse11 0)) (.cse4 (= c_~t~0 0)) (.cse1 (= (select (select |c_#memory_int| c_~q2~0.base) .cse11) 1))) (and (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (or (and .cse0 (<= c_~N~0 1) .cse1 .cse2 .cse3 .cse4) .cse5) (or (and (forall ((v_ArrVal_1076 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1075) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1076))) (let ((.cse9 (select (select .cse12 c_~q1~0.base) .cse13))) (or (forall ((~q2~0.base Int)) (let ((.cse7 (select .cse12 ~q2~0.base))) (let ((.cse6 (select .cse7 .cse11))) (or (= .cse6 0) (not (= (select .cse7 .cse8) .cse9)) (< (+ c_~t~0 .cse6) .cse10))))) (= .cse9 0))))) (forall ((v_ArrVal_1076 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1075) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1076))) (let ((.cse14 (select (select .cse17 c_~q1~0.base) .cse13))) (or (= .cse14 0) (forall ((~q2~0.base Int)) (let ((.cse16 (select .cse17 ~q2~0.base))) (let ((.cse15 (select .cse16 .cse11))) (or (= .cse15 0) (not (= (select .cse16 .cse8) .cse14)) (<= c_~N~0 (+ c_~t~0 .cse15))))))))))) .cse18 .cse19 .cse20) (let ((.cse23 (select (select |c_#memory_int| c_~q1~0.base) .cse13))) (or .cse18 .cse19 (and (forall ((~q2~0.base Int)) (let ((.cse22 (select |c_#memory_int| ~q2~0.base))) (let ((.cse21 (select .cse22 .cse11))) (or (< (+ c_~t~0 .cse21) .cse10) (= .cse21 0) (not (= (select .cse22 .cse8) .cse23)))))) (forall ((~q2~0.base Int)) (let ((.cse25 (select |c_#memory_int| ~q2~0.base))) (let ((.cse24 (select .cse25 .cse11))) (or (<= c_~N~0 (+ c_~t~0 .cse24)) (= .cse24 0) (not (= (select .cse25 .cse8) .cse23))))))) .cse20 (= .cse23 0))) (or .cse18 .cse19 .cse20 (= |c_thread2Thread1of1ForFork2_~j~0#1| 0) (and (forall ((~q2~0.base Int)) (let ((.cse27 (select |c_#memory_int| ~q2~0.base))) (let ((.cse26 (select .cse27 .cse11))) (or (<= c_~N~0 (+ c_~t~0 .cse26)) (not (= (select .cse27 .cse8) |c_thread2Thread1of1ForFork2_~j~0#1|)) (= .cse26 0))))) (forall ((~q2~0.base Int)) (let ((.cse29 (select |c_#memory_int| ~q2~0.base))) (let ((.cse28 (select .cse29 .cse11))) (or (< (+ c_~t~0 .cse28) .cse10) (not (= (select .cse29 .cse8) |c_thread2Thread1of1ForFork2_~j~0#1|)) (= .cse28 0))))))) (or .cse18 .cse19 (and (forall ((v_ArrVal_1076 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1076))) (let ((.cse32 (select (select .cse33 c_~q1~0.base) .cse13))) (or (forall ((~q2~0.base Int)) (let ((.cse31 (select .cse33 ~q2~0.base))) (let ((.cse30 (select .cse31 .cse11))) (or (= .cse30 0) (not (= (select .cse31 .cse8) .cse32)) (<= c_~N~0 (+ c_~t~0 .cse30)))))) (= 0 .cse32))))) (forall ((v_ArrVal_1076 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1076))) (let ((.cse36 (select (select .cse37 c_~q1~0.base) .cse13))) (or (forall ((~q2~0.base Int)) (let ((.cse35 (select .cse37 ~q2~0.base))) (let ((.cse34 (select .cse35 .cse11))) (or (= .cse34 0) (< (+ c_~t~0 .cse34) .cse10) (not (= (select .cse35 .cse8) .cse36)))))) (= 0 .cse36)))))) .cse20) (or .cse5 (let ((.cse38 (* c_~q1_back~0 4))) (and (<= |c_thread1Thread1of1ForFork1_~i~0#1| 1) (or (<= 5 (+ .cse38 c_~q1~0.offset)) .cse1) .cse0 .cse2 .cse3 .cse4 (or (<= (* 4 c_~n1~0) (+ .cse38 3 c_~q1~0.offset)) .cse1))))))) is different from false [2022-12-14 12:28:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:05,695 INFO L93 Difference]: Finished difference Result 11649 states and 39033 transitions. [2022-12-14 12:28:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-12-14 12:28:05,695 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 48 states have internal predecessors, (89), 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 [2022-12-14 12:28:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:05,715 INFO L225 Difference]: With dead ends: 11649 [2022-12-14 12:28:05,715 INFO L226 Difference]: Without dead ends: 11563 [2022-12-14 12:28:05,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2512 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=1273, Invalid=10147, Unknown=140, NotChecked=212, Total=11772 [2022-12-14 12:28:05,716 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 542 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 4943 mSolverCounterSat, 308 mSolverCounterUnsat, 113 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 5372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 4943 IncrementalHoareTripleChecker+Invalid, 113 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-12-14 12:28:05,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 513 Invalid, 5372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 4943 Invalid, 113 Unknown, 8 Unchecked, 7.6s Time] [2022-12-14 12:28:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11563 states. [2022-12-14 12:28:05,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11563 to 6334. [2022-12-14 12:28:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6334 states, 6333 states have (on average 3.6432970156324016) internal successors, (23073), 6333 states have internal predecessors, (23073), 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) [2022-12-14 12:28:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6334 states to 6334 states and 23073 transitions. [2022-12-14 12:28:05,855 INFO L78 Accepts]: Start accepts. Automaton has 6334 states and 23073 transitions. Word has length 31 [2022-12-14 12:28:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:05,855 INFO L495 AbstractCegarLoop]: Abstraction has 6334 states and 23073 transitions. [2022-12-14 12:28:05,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 48 states have internal predecessors, (89), 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) [2022-12-14 12:28:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 6334 states and 23073 transitions. [2022-12-14 12:28:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 12:28:05,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:05,866 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 12:28:05,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 12:28:06,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:28:06,068 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)] === [2022-12-14 12:28:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:06,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2099066226, now seen corresponding path program 10 times [2022-12-14 12:28:06,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:06,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553057956] [2022-12-14 12:28:06,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:06,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:08,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:08,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553057956] [2022-12-14 12:28:08,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553057956] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:28:08,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466385751] [2022-12-14 12:28:08,242 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:28:08,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:28:08,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:28:08,243 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:28:08,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea381f2-6b08-47db-be8d-11030d23f79d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 12:28:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:08,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 12:28:08,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:28:08,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:08,824 INFO L350 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 18 treesize of output 20 [2022-12-14 12:28:08,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:08,895 INFO L350 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 18 treesize of output 20 [2022-12-14 12:28:09,145 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-14 12:28:09,145 INFO L350 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 42 treesize of output 10 [2022-12-14 12:28:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 12:28:09,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:28:10,540 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-14 12:28:10,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2392 treesize of output 2260 [2022-12-14 12:28:10,628 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:28:10,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2051 treesize of output 1970 [2022-12-14 12:28:10,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:28:10,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1925 treesize of output 1718 [2022-12-14 12:28:10,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:28:10,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1673 treesize of output 1598 [2022-12-14 12:28:10,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:28:10,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1553 treesize of output 1358