./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/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_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/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_f86644e9-8db9-4f09-9795-43b4da12aa60/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 3ea4ca0f63ee44295abb2f56a10a45cd5c3c9aada41df664ec74c618092ddbca --- 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 14:35:42,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:35:42,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:35:42,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:35:42,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:35:42,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:35:42,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:35:42,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:35:42,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:35:42,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:35:42,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:35:42,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:35:42,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:35:42,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:35:42,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:35:42,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:35:42,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:35:42,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:35:42,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:35:42,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:35:42,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:35:42,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:35:42,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:35:42,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:35:42,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:35:42,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:35:42,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:35:42,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:35:42,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:35:42,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:35:42,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:35:42,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:35:42,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:35:42,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:35:42,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:35:42,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:35:42,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:35:42,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:35:42,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:35:42,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:35:42,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:35:42,290 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 14:35:42,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:35:42,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:35:42,305 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:35:42,306 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:35:42,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:35:42,306 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:35:42,306 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:35:42,306 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:35:42,307 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:35:42,307 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 14:35:42,307 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:35:42,307 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:35:42,307 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 14:35:42,307 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 14:35:42,307 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:35:42,307 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 14:35:42,308 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 14:35:42,308 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 14:35:42,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:35:42,308 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:35:42,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:35:42,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:35:42,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:35:42,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 14:35:42,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:35:42,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 14:35:42,309 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:35:42,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 14:35:42,309 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:35:42,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 14:35:42,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:35:42,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:35:42,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:35:42,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:35:42,310 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 14:35:42,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:35:42,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 14:35:42,310 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 14:35:42,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 14:35:42,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 14:35:42,310 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:35:42,310 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_f86644e9-8db9-4f09-9795-43b4da12aa60/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_f86644e9-8db9-4f09-9795-43b4da12aa60/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 -> 3ea4ca0f63ee44295abb2f56a10a45cd5c3c9aada41df664ec74c618092ddbca [2022-12-14 14:35:42,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:35:42,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:35:42,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:35:42,517 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:35:42,517 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:35:42,518 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c [2022-12-14 14:35:45,103 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:35:45,268 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:35:45,269 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c [2022-12-14 14:35:45,273 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/data/5bbc33328/1db3de9b6c5c42a3b51ab2ef94dff599/FLAG44fa61396 [2022-12-14 14:35:45,672 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/data/5bbc33328/1db3de9b6c5c42a3b51ab2ef94dff599 [2022-12-14 14:35:45,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:35:45,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:35:45,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:35:45,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:35:45,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:35:45,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:35:45" (1/1) ... [2022-12-14 14:35:45,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3816d21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:35:45, skipping insertion in model container [2022-12-14 14:35:45,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:35:45" (1/1) ... [2022-12-14 14:35:45,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:35:45,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:35:45,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,843 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_f86644e9-8db9-4f09-9795-43b4da12aa60/sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2022-12-14 14:35:45,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:35:45,858 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:35:45,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:35:45,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:35:45,884 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_f86644e9-8db9-4f09-9795-43b4da12aa60/sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2022-12-14 14:35:45,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:35:45,898 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:35:45,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:35:45 WrapperNode [2022-12-14 14:35:45,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:35:45,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:35:45,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:35:45,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:35:45,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:35:45" (1/1) ... [2022-12-14 14:35:45,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:35:45" (1/1) ... [2022-12-14 14:35:45,933 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-12-14 14:35:45,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:35:45,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:35:45,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:35:45,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:35:45,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:35:45" (1/1) ... [2022-12-14 14:35:45,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:35:45" (1/1) ... [2022-12-14 14:35:45,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:35:45" (1/1) ... [2022-12-14 14:35:45,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:35:45" (1/1) ... [2022-12-14 14:35:45,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:35:45" (1/1) ... [2022-12-14 14:35:45,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:35:45" (1/1) ... [2022-12-14 14:35:45,958 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:35:45" (1/1) ... [2022-12-14 14:35:45,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:35:45" (1/1) ... [2022-12-14 14:35:45,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:35:45,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:35:45,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:35:45,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:35:45,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:35:45" (1/1) ... [2022-12-14 14:35:45,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:35:45,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:45,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:35:45,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:35:46,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 14:35:46,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 14:35:46,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 14:35:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 14:35:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 14:35:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 14:35:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 14:35:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 14:35:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-14 14:35:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-14 14:35:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-14 14:35:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-14 14:35:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 14:35:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 14:35:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 14:35:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 14:35:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:35:46,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:35:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 14:35:46,029 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 14:35:46,118 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:35:46,120 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:35:46,328 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:35:46,398 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:35:46,399 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 14:35:46,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:35:46 BoogieIcfgContainer [2022-12-14 14:35:46,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:35:46,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:35:46,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:35:46,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:35:46,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:35:45" (1/3) ... [2022-12-14 14:35:46,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6471141c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:35:46, skipping insertion in model container [2022-12-14 14:35:46,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:35:45" (2/3) ... [2022-12-14 14:35:46,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6471141c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:35:46, skipping insertion in model container [2022-12-14 14:35:46,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:35:46" (3/3) ... [2022-12-14 14:35:46,413 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2022-12-14 14:35:46,420 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 14:35:46,428 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:35:46,428 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 14:35:46,428 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 14:35:46,483 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-14 14:35:46,508 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 14:35:46,519 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 172 transitions, 376 flow [2022-12-14 14:35:46,521 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 172 transitions, 376 flow [2022-12-14 14:35:46,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 172 transitions, 376 flow [2022-12-14 14:35:46,577 INFO L130 PetriNetUnfolder]: 12/168 cut-off events. [2022-12-14 14:35:46,578 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-14 14:35:46,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 168 events. 12/168 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-14 14:35:46,584 INFO L119 LiptonReduction]: Number of co-enabled transitions 2280 [2022-12-14 14:35:52,473 INFO L134 LiptonReduction]: Checked pairs total: 3659 [2022-12-14 14:35:52,473 INFO L136 LiptonReduction]: Total number of compositions: 156 [2022-12-14 14:35:52,478 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 104 flow [2022-12-14 14:35:52,510 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 397 states, 396 states have (on average 3.7222222222222223) internal successors, (1474), 396 states have internal predecessors, (1474), 0 states have call successors, (0), 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 14:35:52,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:35:52,527 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;@4ad21275, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:35:52,527 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-14 14:35:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 397 states, 396 states have (on average 3.7222222222222223) internal successors, (1474), 396 states have internal predecessors, (1474), 0 states have call successors, (0), 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 14:35:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:35:52,538 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:52,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:52,539 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 2 more)] === [2022-12-14 14:35:52,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:52,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1249578081, now seen corresponding path program 1 times [2022-12-14 14:35:52,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:52,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48240351] [2022-12-14 14:35:52,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:52,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:52,806 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 14:35:52,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:52,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48240351] [2022-12-14 14:35:52,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48240351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:35:52,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:35:52,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:35:52,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032886612] [2022-12-14 14:35:52,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:52,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:35:52,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:52,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:35:52,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:35:52,832 INFO L87 Difference]: Start difference. First operand has 397 states, 396 states have (on average 3.7222222222222223) internal successors, (1474), 396 states have internal predecessors, (1474), 0 states have call successors, (0), 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 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 14:35:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:52,921 INFO L93 Difference]: Finished difference Result 479 states and 1790 transitions. [2022-12-14 14:35:52,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:35:52,923 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 27 [2022-12-14 14:35:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:52,933 INFO L225 Difference]: With dead ends: 479 [2022-12-14 14:35:52,933 INFO L226 Difference]: Without dead ends: 479 [2022-12-14 14:35:52,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:35:52,936 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 39 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:52,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:35:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-12-14 14:35:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2022-12-14 14:35:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 3.7447698744769875) internal successors, (1790), 478 states have internal predecessors, (1790), 0 states have call successors, (0), 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 14:35:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1790 transitions. [2022-12-14 14:35:52,986 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1790 transitions. Word has length 27 [2022-12-14 14:35:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:52,986 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 1790 transitions. [2022-12-14 14:35:52,987 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 14:35:52,987 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1790 transitions. [2022-12-14 14:35:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 14:35:52,990 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:52,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:52,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 14:35:52,990 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 2 more)] === [2022-12-14 14:35:52,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:52,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1358235559, now seen corresponding path program 1 times [2022-12-14 14:35:52,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:52,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993967299] [2022-12-14 14:35:52,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:52,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:53,086 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 14:35:53,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:53,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993967299] [2022-12-14 14:35:53,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993967299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:35:53,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:35:53,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:35:53,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072213570] [2022-12-14 14:35:53,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:53,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:35:53,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:53,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:35:53,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:35:53,089 INFO L87 Difference]: Start difference. First operand 479 states and 1790 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:53,168 INFO L93 Difference]: Finished difference Result 591 states and 2222 transitions. [2022-12-14 14:35:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:35:53,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 14:35:53,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:53,171 INFO L225 Difference]: With dead ends: 591 [2022-12-14 14:35:53,171 INFO L226 Difference]: Without dead ends: 591 [2022-12-14 14:35:53,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:35:53,172 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 36 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:53,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:35:53,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-12-14 14:35:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2022-12-14 14:35:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 3.766101694915254) internal successors, (2222), 590 states have internal predecessors, (2222), 0 states have call successors, (0), 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 14:35:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 2222 transitions. [2022-12-14 14:35:53,192 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 2222 transitions. Word has length 28 [2022-12-14 14:35:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:53,193 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 2222 transitions. [2022-12-14 14:35:53,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 2222 transitions. [2022-12-14 14:35:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 14:35:53,195 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:53,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:53,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 14:35:53,195 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 2 more)] === [2022-12-14 14:35:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1023418825, now seen corresponding path program 1 times [2022-12-14 14:35:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:53,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716358645] [2022-12-14 14:35:53,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:53,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:53,275 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 14:35:53,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:53,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716358645] [2022-12-14 14:35:53,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716358645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:35:53,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:35:53,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:35:53,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458118854] [2022-12-14 14:35:53,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:53,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:35:53,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:53,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:35:53,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:35:53,277 INFO L87 Difference]: Start difference. First operand 591 states and 2222 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 14:35:53,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:53,352 INFO L93 Difference]: Finished difference Result 765 states and 2902 transitions. [2022-12-14 14:35:53,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:35:53,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 14:35:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:53,357 INFO L225 Difference]: With dead ends: 765 [2022-12-14 14:35:53,357 INFO L226 Difference]: Without dead ends: 765 [2022-12-14 14:35:53,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:35:53,359 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:53,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:35:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-12-14 14:35:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2022-12-14 14:35:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 3.798429319371728) internal successors, (2902), 764 states have internal predecessors, (2902), 0 states have call successors, (0), 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 14:35:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 2902 transitions. [2022-12-14 14:35:53,380 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 2902 transitions. Word has length 29 [2022-12-14 14:35:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:53,380 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 2902 transitions. [2022-12-14 14:35:53,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 14:35:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 2902 transitions. [2022-12-14 14:35:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 14:35:53,382 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:53,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:53,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 14:35:53,382 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 2 more)] === [2022-12-14 14:35:53,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash -45797621, now seen corresponding path program 1 times [2022-12-14 14:35:53,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:53,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672657384] [2022-12-14 14:35:53,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:53,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:53,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 14:35:53,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:53,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672657384] [2022-12-14 14:35:53,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672657384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:35:53,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:35:53,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:35:53,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570065255] [2022-12-14 14:35:53,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:53,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:35:53,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:53,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:35:53,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:35:53,464 INFO L87 Difference]: Start difference. First operand 765 states and 2902 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 14:35:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:53,516 INFO L93 Difference]: Finished difference Result 766 states and 2903 transitions. [2022-12-14 14:35:53,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:35:53,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 14:35:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:53,521 INFO L225 Difference]: With dead ends: 766 [2022-12-14 14:35:53,521 INFO L226 Difference]: Without dead ends: 766 [2022-12-14 14:35:53,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:35:53,522 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:53,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:35:53,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-12-14 14:35:53,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2022-12-14 14:35:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 3.794771241830065) internal successors, (2903), 765 states have internal predecessors, (2903), 0 states have call successors, (0), 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 14:35:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 2903 transitions. [2022-12-14 14:35:53,541 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 2903 transitions. Word has length 30 [2022-12-14 14:35:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:53,541 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 2903 transitions. [2022-12-14 14:35:53,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 14:35:53,541 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 2903 transitions. [2022-12-14 14:35:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:35:53,543 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:53,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:53,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 14:35:53,544 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 2 more)] === [2022-12-14 14:35:53,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash -617803488, now seen corresponding path program 1 times [2022-12-14 14:35:53,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:53,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200697570] [2022-12-14 14:35:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:53,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 14:35:53,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:53,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200697570] [2022-12-14 14:35:53,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200697570] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:53,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287096992] [2022-12-14 14:35:53,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:53,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:53,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:53,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:53,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 14:35:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:53,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 14:35:53,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:54,147 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 15 treesize of output 7 [2022-12-14 14:35:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:35:54,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:35:54,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287096992] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:54,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:35:54,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 8] total 17 [2022-12-14 14:35:54,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266885178] [2022-12-14 14:35:54,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:54,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 14:35:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:54,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 14:35:54,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-12-14 14:35:54,523 INFO L87 Difference]: Start difference. First operand 766 states and 2903 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:35:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:55,082 INFO L93 Difference]: Finished difference Result 2506 states and 9226 transitions. [2022-12-14 14:35:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 14:35:55,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:35:55,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:55,093 INFO L225 Difference]: With dead ends: 2506 [2022-12-14 14:35:55,093 INFO L226 Difference]: Without dead ends: 1727 [2022-12-14 14:35:55,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-12-14 14:35:55,094 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 76 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:55,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 19 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:35:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2022-12-14 14:35:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 936. [2022-12-14 14:35:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 935 states have (on average 3.7614973262032088) internal successors, (3517), 935 states have internal predecessors, (3517), 0 states have call successors, (0), 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 14:35:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 3517 transitions. [2022-12-14 14:35:55,141 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 3517 transitions. Word has length 31 [2022-12-14 14:35:55,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:55,141 INFO L495 AbstractCegarLoop]: Abstraction has 936 states and 3517 transitions. [2022-12-14 14:35:55,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:35:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 3517 transitions. [2022-12-14 14:35:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:35:55,144 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:55,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:55,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 14:35:55,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:55,345 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 2 more)] === [2022-12-14 14:35:55,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash 162805366, now seen corresponding path program 2 times [2022-12-14 14:35:55,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:55,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020741471] [2022-12-14 14:35:55,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:55,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:35:55,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:55,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020741471] [2022-12-14 14:35:55,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020741471] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:55,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767072941] [2022-12-14 14:35:55,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:35:55,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:55,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:55,699 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:55,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 14:35:55,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:35:55,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:35:55,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 14:35:55,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:55,848 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 15 treesize of output 7 [2022-12-14 14:35:55,867 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 46 treesize of output 22 [2022-12-14 14:35:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:35:55,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:55,974 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 50 treesize of output 26 [2022-12-14 14:35:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:35:56,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767072941] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:35:56,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [747999762] [2022-12-14 14:35:56,100 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 14:35:56,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:35:56,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-14 14:35:56,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245439993] [2022-12-14 14:35:56,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:35:56,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 14:35:56,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:56,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 14:35:56,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:35:56,102 INFO L87 Difference]: Start difference. First operand 936 states and 3517 transitions. Second operand has 16 states, 15 states have (on average 5.2) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 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 14:35:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:57,012 INFO L93 Difference]: Finished difference Result 5217 states and 19434 transitions. [2022-12-14 14:35:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 14:35:57,012 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.2) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 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 14:35:57,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:57,026 INFO L225 Difference]: With dead ends: 5217 [2022-12-14 14:35:57,027 INFO L226 Difference]: Without dead ends: 2333 [2022-12-14 14:35:57,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=424, Invalid=908, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 14:35:57,028 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 256 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:57,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 52 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 14:35:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2022-12-14 14:35:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 1135. [2022-12-14 14:35:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 3.7160493827160495) internal successors, (4214), 1134 states have internal predecessors, (4214), 0 states have call successors, (0), 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 14:35:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 4214 transitions. [2022-12-14 14:35:57,078 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 4214 transitions. Word has length 31 [2022-12-14 14:35:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:57,079 INFO L495 AbstractCegarLoop]: Abstraction has 1135 states and 4214 transitions. [2022-12-14 14:35:57,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.2) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 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 14:35:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 4214 transitions. [2022-12-14 14:35:57,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:35:57,081 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:57,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:57,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 14:35:57,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:57,282 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 2 more)] === [2022-12-14 14:35:57,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1851144864, now seen corresponding path program 3 times [2022-12-14 14:35:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:57,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847685441] [2022-12-14 14:35:57,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:35:57,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:57,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847685441] [2022-12-14 14:35:57,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847685441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:35:57,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:35:57,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:35:57,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442557906] [2022-12-14 14:35:57,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:57,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:35:57,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:57,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:35:57,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:35:57,476 INFO L87 Difference]: Start difference. First operand 1135 states and 4214 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:35:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:57,570 INFO L93 Difference]: Finished difference Result 1306 states and 4773 transitions. [2022-12-14 14:35:57,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:35:57,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:35:57,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:57,577 INFO L225 Difference]: With dead ends: 1306 [2022-12-14 14:35:57,577 INFO L226 Difference]: Without dead ends: 1015 [2022-12-14 14:35:57,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:35:57,578 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:57,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 5 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:35:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2022-12-14 14:35:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1015. [2022-12-14 14:35:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 3.619329388560158) internal successors, (3670), 1014 states have internal predecessors, (3670), 0 states have call successors, (0), 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 14:35:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 3670 transitions. [2022-12-14 14:35:57,604 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 3670 transitions. Word has length 31 [2022-12-14 14:35:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:57,604 INFO L495 AbstractCegarLoop]: Abstraction has 1015 states and 3670 transitions. [2022-12-14 14:35:57,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:35:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 3670 transitions. [2022-12-14 14:35:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:35:57,606 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:57,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:57,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 14:35:57,607 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 2 more)] === [2022-12-14 14:35:57,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:57,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1871687156, now seen corresponding path program 4 times [2022-12-14 14:35:57,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:57,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156164637] [2022-12-14 14:35:57,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:57,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:35:58,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:58,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156164637] [2022-12-14 14:35:58,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156164637] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:58,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446941817] [2022-12-14 14:35:58,163 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:35:58,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:58,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:58,164 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:58,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 14:35:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:58,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 14:35:58,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:58,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:58,398 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 14 treesize of output 16 [2022-12-14 14:35:58,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 14:35:58,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:58,483 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 16 treesize of output 18 [2022-12-14 14:35:58,493 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 17 treesize of output 9 [2022-12-14 14:35:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:35:58,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:58,638 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_340 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (or (not (<= (+ v_ArrVal_340 1) (select .cse0 .cse1))) (< (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 .cse1 v_ArrVal_340)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_342) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 2))))) (<= 2147483647 c_~max~0)) is different from false [2022-12-14 14:35:58,652 WARN L837 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_340 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (or (< (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_340)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_342) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 2)) (not (<= (+ v_ArrVal_340 1) (select .cse0 c_~A~0.offset))))))) is different from false [2022-12-14 14:35:58,676 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_339 (Array Int Int)) (v_ArrVal_340 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_339))) (let ((.cse1 (select .cse0 c_~A~0.base))) (or (< (select (select (store (store .cse0 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_340)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_342) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 2)) (not (<= (+ v_ArrVal_340 1) (select .cse1 c_~A~0.offset))))))) (<= 2147483647 c_~max~0)) is different from false [2022-12-14 14:35:58,922 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 105 treesize of output 81 [2022-12-14 14:35:58,926 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 54 treesize of output 50 [2022-12-14 14:35:58,930 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 22 [2022-12-14 14:35:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-12-14 14:35:59,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446941817] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:35:59,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [501582773] [2022-12-14 14:35:59,016 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 14:35:59,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:35:59,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 32 [2022-12-14 14:35:59,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641300882] [2022-12-14 14:35:59,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:35:59,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 14:35:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:59,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 14:35:59,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=781, Unknown=9, NotChecked=180, Total=1122 [2022-12-14 14:35:59,018 INFO L87 Difference]: Start difference. First operand 1015 states and 3670 transitions. Second operand has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 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 14:36:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:36:01,437 INFO L93 Difference]: Finished difference Result 3702 states and 13657 transitions. [2022-12-14 14:36:01,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 14:36:01,437 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 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 14:36:01,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:36:01,445 INFO L225 Difference]: With dead ends: 3702 [2022-12-14 14:36:01,445 INFO L226 Difference]: Without dead ends: 1878 [2022-12-14 14:36:01,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 19 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=773, Invalid=2310, Unknown=9, NotChecked=330, Total=3422 [2022-12-14 14:36:01,446 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 696 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 562 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:36:01,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 71 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2265 Invalid, 0 Unknown, 562 Unchecked, 1.2s Time] [2022-12-14 14:36:01,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-12-14 14:36:01,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 855. [2022-12-14 14:36:01,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 3.6463700234192036) internal successors, (3114), 854 states have internal predecessors, (3114), 0 states have call successors, (0), 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 14:36:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 3114 transitions. [2022-12-14 14:36:01,472 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 3114 transitions. Word has length 31 [2022-12-14 14:36:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:36:01,472 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 3114 transitions. [2022-12-14 14:36:01,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 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 14:36:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 3114 transitions. [2022-12-14 14:36:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:36:01,474 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:36:01,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:36:01,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 14:36:01,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 14:36:01,675 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 2 more)] === [2022-12-14 14:36:01,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:36:01,675 INFO L85 PathProgramCache]: Analyzing trace with hash -551999692, now seen corresponding path program 5 times [2022-12-14 14:36:01,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:36:01,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012074148] [2022-12-14 14:36:01,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:36:01,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:36:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:36:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 14:36:01,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:36:01,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012074148] [2022-12-14 14:36:01,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012074148] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:36:01,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853108443] [2022-12-14 14:36:01,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:36:01,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:36:01,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:36:01,920 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:36:01,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 14:36:02,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:36:02,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:36:02,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 14:36:02,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:36:02,293 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 15 treesize of output 7 [2022-12-14 14:36:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:36:02,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:36:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:36:02,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853108443] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:36:02,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:36:02,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 9] total 19 [2022-12-14 14:36:02,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792186843] [2022-12-14 14:36:02,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:36:02,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:36:02,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:36:02,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:36:02,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:36:02,630 INFO L87 Difference]: Start difference. First operand 855 states and 3114 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:36:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:36:03,101 INFO L93 Difference]: Finished difference Result 2264 states and 8260 transitions. [2022-12-14 14:36:03,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:36:03,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:36:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:36:03,109 INFO L225 Difference]: With dead ends: 2264 [2022-12-14 14:36:03,110 INFO L226 Difference]: Without dead ends: 1954 [2022-12-14 14:36:03,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-12-14 14:36:03,110 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 105 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:36:03,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 19 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:36:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2022-12-14 14:36:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 916. [2022-12-14 14:36:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 915 states have (on average 3.7049180327868854) internal successors, (3390), 915 states have internal predecessors, (3390), 0 states have call successors, (0), 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 14:36:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 3390 transitions. [2022-12-14 14:36:03,138 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 3390 transitions. Word has length 31 [2022-12-14 14:36:03,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:36:03,138 INFO L495 AbstractCegarLoop]: Abstraction has 916 states and 3390 transitions. [2022-12-14 14:36:03,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:36:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 3390 transitions. [2022-12-14 14:36:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:36:03,140 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:36:03,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:36:03,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 14:36:03,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-14 14:36:03,341 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 2 more)] === [2022-12-14 14:36:03,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:36:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash 228609162, now seen corresponding path program 6 times [2022-12-14 14:36:03,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:36:03,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970696761] [2022-12-14 14:36:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:36:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:36:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:36:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:36:03,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:36:03,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970696761] [2022-12-14 14:36:03,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970696761] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:36:03,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898918869] [2022-12-14 14:36:03,590 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:36:03,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:36:03,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:36:03,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:36:03,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 14:36:03,699 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:36:03,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:36:03,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 14:36:03,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:36:03,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:36:03,863 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 21 treesize of output 21 [2022-12-14 14:36:03,897 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 15 treesize of output 7 [2022-12-14 14:36:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:36:03,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:36:04,483 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (let ((.cse4 (select .cse7 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse0 (< c_~min~0 .cse4)) (.cse2 (select .cse7 c_~A~0.offset))) (and (or (not .cse0) (and (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_471) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ .cse1 3)) (< .cse2 (+ .cse1 1)) (< 2147483645 .cse1)))) (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_471) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse3 1)) (<= 2147483647 .cse3)))))) (or .cse0 (and (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_471) c_~A~0.base) c_~A~0.offset))) (or (< .cse4 (+ .cse5 3)) (< .cse2 (+ .cse5 1)) (< 2147483645 .cse5)))) (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_471) c_~A~0.base) c_~A~0.offset))) (or (<= .cse4 (+ .cse6 1)) (<= 2147483647 .cse6)))))))))) (= (mod c_~b1~0 256) 0)) is different from false [2022-12-14 14:36:06,641 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 41 treesize of output 33 [2022-12-14 14:36:06,644 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 5 treesize of output 3 [2022-12-14 14:36:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:36:08,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898918869] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:36:08,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1087000574] [2022-12-14 14:36:08,688 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 14:36:08,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:36:08,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 25 [2022-12-14 14:36:08,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198830320] [2022-12-14 14:36:08,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:36:08,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 14:36:08,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:36:08,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 14:36:08,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=478, Unknown=7, NotChecked=46, Total=650 [2022-12-14 14:36:08,690 INFO L87 Difference]: Start difference. First operand 916 states and 3390 transitions. Second operand has 26 states, 25 states have (on average 3.72) internal successors, (93), 26 states have internal predecessors, (93), 0 states have call successors, (0), 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 14:36:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:36:11,126 INFO L93 Difference]: Finished difference Result 4667 states and 16936 transitions. [2022-12-14 14:36:11,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-14 14:36:11,127 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.72) internal successors, (93), 26 states have internal predecessors, (93), 0 states have call successors, (0), 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 14:36:11,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:36:11,135 INFO L225 Difference]: With dead ends: 4667 [2022-12-14 14:36:11,135 INFO L226 Difference]: Without dead ends: 2368 [2022-12-14 14:36:11,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1136, Invalid=2521, Unknown=7, NotChecked=118, Total=3782 [2022-12-14 14:36:11,136 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 562 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:36:11,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 74 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1192 Invalid, 0 Unknown, 162 Unchecked, 1.1s Time] [2022-12-14 14:36:11,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-12-14 14:36:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 1012. [2022-12-14 14:36:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.6330365974282888) internal successors, (3673), 1011 states have internal predecessors, (3673), 0 states have call successors, (0), 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 14:36:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3673 transitions. [2022-12-14 14:36:11,162 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3673 transitions. Word has length 31 [2022-12-14 14:36:11,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:36:11,162 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 3673 transitions. [2022-12-14 14:36:11,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.72) internal successors, (93), 26 states have internal predecessors, (93), 0 states have call successors, (0), 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 14:36:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3673 transitions. [2022-12-14 14:36:11,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:36:11,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:36:11,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:36:11,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 14:36:11,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 14:36:11,365 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 2 more)] === [2022-12-14 14:36:11,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:36:11,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1908665636, now seen corresponding path program 7 times [2022-12-14 14:36:11,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:36:11,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298208677] [2022-12-14 14:36:11,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:36:11,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:36:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:36:11,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:36:11,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:36:11,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298208677] [2022-12-14 14:36:11,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298208677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:36:11,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:36:11,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:36:11,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054873189] [2022-12-14 14:36:11,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:36:11,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:36:11,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:36:11,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:36:11,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:36:11,545 INFO L87 Difference]: Start difference. First operand 1012 states and 3673 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:36:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:36:11,648 INFO L93 Difference]: Finished difference Result 1119 states and 4016 transitions. [2022-12-14 14:36:11,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:36:11,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:36:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:36:11,651 INFO L225 Difference]: With dead ends: 1119 [2022-12-14 14:36:11,651 INFO L226 Difference]: Without dead ends: 943 [2022-12-14 14:36:11,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:36:11,652 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:36:11,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:36:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2022-12-14 14:36:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 938. [2022-12-14 14:36:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 3.4962646744930628) internal successors, (3276), 937 states have internal predecessors, (3276), 0 states have call successors, (0), 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 14:36:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 3276 transitions. [2022-12-14 14:36:11,666 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 3276 transitions. Word has length 31 [2022-12-14 14:36:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:36:11,666 INFO L495 AbstractCegarLoop]: Abstraction has 938 states and 3276 transitions. [2022-12-14 14:36:11,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:36:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 3276 transitions. [2022-12-14 14:36:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:36:11,668 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:36:11,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:36:11,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 14:36:11,668 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 2 more)] === [2022-12-14 14:36:11,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:36:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1558513570, now seen corresponding path program 8 times [2022-12-14 14:36:11,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:36:11,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563328729] [2022-12-14 14:36:11,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:36:11,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:36:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:36:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:36:12,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:36:12,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563328729] [2022-12-14 14:36:12,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563328729] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:36:12,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008261364] [2022-12-14 14:36:12,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:36:12,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:36:12,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:36:12,088 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:36:12,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 14:36:12,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:36:12,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:36:12,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 14:36:12,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:36:12,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:36:12,432 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 14 treesize of output 16 [2022-12-14 14:36:12,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 14:36:12,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:36:12,549 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 23 treesize of output 23 [2022-12-14 14:36:12,632 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 17 treesize of output 9 [2022-12-14 14:36:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:36:12,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:36:19,062 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:36:19,501 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_569 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_568))) (let ((.cse0 (select .cse2 c_~A~0.base))) (let ((.cse1 (select (select (store (store .cse2 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_569)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_571) c_~A~0.base) c_~A~0.offset))) (or (not (<= (select .cse0 c_~A~0.offset) (+ v_ArrVal_569 1))) (< .cse1 v_ArrVal_569) (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1))))))) is different from false [2022-12-14 14:36:23,854 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 168 treesize of output 148 [2022-12-14 14:36:23,858 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 124 treesize of output 112 [2022-12-14 14:36:23,863 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 22 [2022-12-14 14:36:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-12-14 14:36:23,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008261364] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:36:23,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1196145888] [2022-12-14 14:36:23,901 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 14:36:23,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:36:23,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 31 [2022-12-14 14:36:23,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347737614] [2022-12-14 14:36:23,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:36:23,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:36:23,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:36:23,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:36:23,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=786, Unknown=24, NotChecked=60, Total=1056 [2022-12-14 14:36:23,903 INFO L87 Difference]: Start difference. First operand 938 states and 3276 transitions. Second operand has 33 states, 32 states have (on average 2.71875) internal successors, (87), 32 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 14:36:28,295 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 14:36:34,717 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 14:36:38,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:36:40,938 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 14:36:43,115 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 14:36:45,823 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 14:36:52,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:36:54,549 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 14:36:56,670 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 14:36:59,689 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 14:37:01,708 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 14:37:03,915 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 14:37:06,063 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 14:37:08,067 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 14:37:10,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:15,573 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 14:37:17,591 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 14:37:24,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:26,005 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 14:37:28,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:30,016 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 14:37:34,099 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 14:37:36,103 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 14:37:38,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:40,834 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 14:37:42,935 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 14:37:44,939 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 14:37:46,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:48,950 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 14:37:50,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:52,960 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 14:37:54,964 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 14:37:56,988 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 14:37:58,993 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 14:38:05,164 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 14:38:07,169 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 14:38:09,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:13,557 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 14:38:15,562 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 14:38:30,861 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 14:38:32,887 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 14:38:35,072 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 14:38:37,084 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 14:38:39,089 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 14:38:41,098 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 14:38:43,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:45,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:47,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:49,177 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 14:38:51,211 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 14:38:53,224 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 14:38:55,228 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 14:38:57,286 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 14:38:59,290 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 14:39:09,421 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 14:39:11,425 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 14:39:13,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:15,442 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 14:39:17,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:19,459 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 14:39:24,586 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 14:39:28,149 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 14:39:30,154 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 14:39:32,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:34,165 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 14:39:42,518 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 14:39:44,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:48,767 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 14:39:50,787 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 14:39:52,792 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 14:40:00,337 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 14:40:03,172 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 14:40:05,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:08,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:10,943 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 14:40:12,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:14,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:16,980 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 14:40:33,158 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 14:40:35,163 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 14:40:37,176 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 14:40:39,181 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 14:40:41,445 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 14:40:47,196 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 14:40:49,200 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 14:40:51,242 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 14:40:53,246 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 14:40:55,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:57,258 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 14:40:59,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:01,271 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 14:41:03,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:05,284 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 14:41:07,528 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 14:41:09,532 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 14:41:11,573 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 14:41:13,648 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 14:41:15,795 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 14:41:17,861 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 14:41:19,865 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 14:41:21,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:23,876 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 14:41:25,940 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 14:41:27,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:29,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:31,957 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 14:41:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:41:32,509 INFO L93 Difference]: Finished difference Result 6606 states and 23797 transitions. [2022-12-14 14:41:32,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-12-14 14:41:32,510 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 32 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 14:41:32,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:41:32,516 INFO L225 Difference]: With dead ends: 6606 [2022-12-14 14:41:32,516 INFO L226 Difference]: Without dead ends: 2056 [2022-12-14 14:41:32,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 40 SyntacticMatches, 41 SemanticMatches, 127 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7707 ImplicationChecksByTransitivity, 102.1s TimeCoverageRelationStatistics Valid=4760, Invalid=11469, Unknown=31, NotChecked=252, Total=16512 [2022-12-14 14:41:32,519 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1307 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 132 mSolverCounterUnsat, 104 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 216.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 3070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 104 IncrementalHoareTripleChecker+Unknown, 375 IncrementalHoareTripleChecker+Unchecked, 217.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:41:32,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 66 Invalid, 3070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2459 Invalid, 104 Unknown, 375 Unchecked, 217.2s Time] [2022-12-14 14:41:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2022-12-14 14:41:32,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 896. [2022-12-14 14:41:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 895 states have (on average 3.463687150837989) internal successors, (3100), 895 states have internal predecessors, (3100), 0 states have call successors, (0), 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 14:41:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 3100 transitions. [2022-12-14 14:41:32,539 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 3100 transitions. Word has length 31 [2022-12-14 14:41:32,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:41:32,539 INFO L495 AbstractCegarLoop]: Abstraction has 896 states and 3100 transitions. [2022-12-14 14:41:32,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 32 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 14:41:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 3100 transitions. [2022-12-14 14:41:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:41:32,541 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:41:32,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:41:32,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-14 14:41:32,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 14:41:32,743 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 2 more)] === [2022-12-14 14:41:32,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:41:32,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1227896768, now seen corresponding path program 9 times [2022-12-14 14:41:32,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:41:32,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727587632] [2022-12-14 14:41:32,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:41:32,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:41:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:41:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:41:33,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:41:33,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727587632] [2022-12-14 14:41:33,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727587632] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:41:33,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451720856] [2022-12-14 14:41:33,076 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:41:33,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:41:33,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:41:33,077 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:41:33,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 14:41:33,189 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:41:33,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:41:33,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 14:41:33,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:41:33,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:41:33,278 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 14 treesize of output 16 [2022-12-14 14:41:33,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:41:33,431 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 21 treesize of output 21 [2022-12-14 14:41:33,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 35 treesize of output 19 [2022-12-14 14:41:33,535 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 44 treesize of output 28 [2022-12-14 14:41:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:41:33,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:41:38,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:41:38,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451720856] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:41:38,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1149433374] [2022-12-14 14:41:38,144 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 14:41:38,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:41:38,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 9] total 29 [2022-12-14 14:41:38,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213664409] [2022-12-14 14:41:38,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:41:38,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 14:41:38,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:41:38,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 14:41:38,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=714, Unknown=5, NotChecked=0, Total=870 [2022-12-14 14:41:38,145 INFO L87 Difference]: Start difference. First operand 896 states and 3100 transitions. Second operand has 30 states, 29 states have (on average 3.206896551724138) internal successors, (93), 30 states have internal predecessors, (93), 0 states have call successors, (0), 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 14:41:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:41:41,801 INFO L93 Difference]: Finished difference Result 5530 states and 19555 transitions. [2022-12-14 14:41:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-14 14:41:41,801 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.206896551724138) internal successors, (93), 30 states have internal predecessors, (93), 0 states have call successors, (0), 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 14:41:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:41:41,807 INFO L225 Difference]: With dead ends: 5530 [2022-12-14 14:41:41,807 INFO L226 Difference]: Without dead ends: 2514 [2022-12-14 14:41:41,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1804 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1641, Invalid=4674, Unknown=5, NotChecked=0, Total=6320 [2022-12-14 14:41:41,809 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 814 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 2154 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 2154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:41:41,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 65 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2154 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 14:41:41,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2022-12-14 14:41:41,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 821. [2022-12-14 14:41:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 820 states have (on average 3.419512195121951) internal successors, (2804), 820 states have internal predecessors, (2804), 0 states have call successors, (0), 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 14:41:41,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2804 transitions. [2022-12-14 14:41:41,831 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2804 transitions. Word has length 31 [2022-12-14 14:41:41,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:41:41,831 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 2804 transitions. [2022-12-14 14:41:41,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.206896551724138) internal successors, (93), 30 states have internal predecessors, (93), 0 states have call successors, (0), 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 14:41:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2804 transitions. [2022-12-14 14:41:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:41:41,833 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:41:41,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:41:41,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 14:41:42,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 14:41:42,035 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 2 more)] === [2022-12-14 14:41:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:41:42,036 INFO L85 PathProgramCache]: Analyzing trace with hash -633194756, now seen corresponding path program 10 times [2022-12-14 14:41:42,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:41:42,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915000156] [2022-12-14 14:41:42,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:41:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:41:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:41:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:41:42,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:41:42,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915000156] [2022-12-14 14:41:42,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915000156] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:41:42,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831863908] [2022-12-14 14:41:42,620 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:41:42,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:41:42,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:41:42,621 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:41:42,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 14:41:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:41:42,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 14:41:42,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:41:42,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:41:42,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:41:42,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:41:42,845 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 14 treesize of output 16 [2022-12-14 14:41:42,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:41:42,894 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 14 treesize of output 16 [2022-12-14 14:41:42,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 14:41:43,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:41:43,011 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 23 treesize of output 23 [2022-12-14 14:41:43,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:41:43,254 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 53 treesize of output 55 [2022-12-14 14:41:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:41:43,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:41:56,509 WARN L233 SmtUtils]: Spent 12.50s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:41:57,313 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708))) (let ((.cse4 (select .cse3 c_~A~0.base))) (or (forall ((v_ArrVal_711 (Array Int Int))) (let ((.cse2 (select (store (store .cse3 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_710)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_711) c_~A~0.base))) (let ((.cse0 (select .cse2 c_~A~0.offset))) (or (<= 2147483647 .cse0) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ 1 .cse0))))) (< .cse0 v_ArrVal_710))))) (not (<= (select .cse4 c_~A~0.offset) (+ v_ArrVal_710 1))))))) (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708))) (let ((.cse7 (select .cse6 c_~A~0.base)) (.cse8 (+ v_ArrVal_710 1))) (or (forall ((v_ArrVal_711 (Array Int Int)) (thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse5 (select (store (store .cse6 c_~A~0.base (store .cse7 c_~A~0.offset v_ArrVal_710)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_711) c_~A~0.base))) (or (not (< c_~min~0 (select .cse5 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (not (< (select .cse5 c_~A~0.offset) v_ArrVal_710))))) (<= c_~min~0 .cse8) (<= 2147483647 v_ArrVal_710) (not (<= (select .cse7 c_~A~0.offset) .cse8)))))) (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708))) (let ((.cse13 (select .cse12 c_~A~0.base)) (.cse11 (+ v_ArrVal_710 1))) (or (forall ((v_ArrVal_711 (Array Int Int)) (thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse10 (select (store (store .cse12 c_~A~0.base (store .cse13 c_~A~0.offset v_ArrVal_710)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_711) c_~A~0.base))) (let ((.cse9 (select .cse10 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse9) (not (< (select .cse10 c_~A~0.offset) v_ArrVal_710)) (<= .cse9 .cse11))))) (<= 2147483647 v_ArrVal_710) (not (<= (select .cse13 c_~A~0.offset) .cse11)))))) (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708))) (let ((.cse17 (select .cse16 c_~A~0.base))) (or (forall ((v_ArrVal_711 (Array Int Int)) (thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse15 (select (store (store .cse16 c_~A~0.base (store .cse17 c_~A~0.offset v_ArrVal_710)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_711) c_~A~0.base))) (let ((.cse14 (select .cse15 c_~A~0.offset))) (or (<= 2147483647 .cse14) (not (< c_~min~0 (select .cse15 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= c_~min~0 (+ 1 .cse14)) (< .cse14 v_ArrVal_710))))) (not (<= (select .cse17 c_~A~0.offset) (+ v_ArrVal_710 1)))))))) is different from false [2022-12-14 14:42:00,011 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_711 (Array Int Int)) (thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708))) (let ((.cse3 (select .cse5 c_~A~0.base))) (let ((.cse4 (select (store (store .cse5 c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_710)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_711) c_~A~0.base))) (let ((.cse1 (select .cse4 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (.cse2 (select .cse4 c_~A~0.offset))) (or (< .cse0 .cse1) (<= .cse1 (+ .cse2 1)) (< .cse2 v_ArrVal_710) (not (<= (select .cse3 c_~A~0.offset) (+ v_ArrVal_710 1))) (<= 2147483647 .cse2))))))) (forall ((v_ArrVal_711 (Array Int Int)) (thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708))) (let ((.cse7 (select .cse8 c_~A~0.base))) (let ((.cse6 (select (store (store .cse8 c_~A~0.base (store .cse7 c_~A~0.offset v_ArrVal_710)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_711) c_~A~0.base))) (or (< (select .cse6 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ v_ArrVal_710 3)) (not (< (select .cse6 c_~A~0.offset) v_ArrVal_710)) (< .cse0 (+ v_ArrVal_710 2)) (<= 2147483647 v_ArrVal_710) (not (<= (select .cse7 c_~A~0.offset) (+ v_ArrVal_710 1)))))))) (forall ((v_ArrVal_711 (Array Int Int)) (thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708))) (let ((.cse10 (select .cse12 c_~A~0.base))) (let ((.cse11 (select (store (store .cse12 c_~A~0.base (store .cse10 c_~A~0.offset v_ArrVal_710)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_711) c_~A~0.base))) (let ((.cse9 (select .cse11 c_~A~0.offset))) (or (< .cse0 (+ .cse9 2)) (< .cse9 v_ArrVal_710) (not (<= (select .cse10 c_~A~0.offset) (+ v_ArrVal_710 1))) (<= 2147483647 .cse9) (< (select .cse11 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ .cse9 3)))))))) (forall ((v_ArrVal_711 (Array Int Int)) (thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708))) (let ((.cse16 (select .cse17 c_~A~0.base))) (let ((.cse14 (select (store (store .cse17 c_~A~0.base (store .cse16 c_~A~0.offset v_ArrVal_710)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_711) c_~A~0.base))) (let ((.cse13 (select .cse14 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (.cse15 (+ v_ArrVal_710 1))) (or (< .cse0 .cse13) (not (< (select .cse14 c_~A~0.offset) v_ArrVal_710)) (<= 2147483647 v_ArrVal_710) (<= .cse13 .cse15) (not (<= (select .cse16 c_~A~0.offset) .cse15)))))))))) is different from false [2022-12-14 14:42:00,189 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_711 (Array Int Int)) (thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_706))) (let ((.cse5 (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select (store (store .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_711) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (+ v_ArrVal_710 1)) (.cse0 (select .cse4 (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse0 .cse1) (not (<= (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse1)) (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse0) (<= 2147483647 v_ArrVal_710) (not (< (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_710))))))))) (forall ((v_ArrVal_711 (Array Int Int)) (thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_706))) (let ((.cse10 (store (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select (store (store .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_711) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse6 v_ArrVal_710) (not (<= (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ v_ArrVal_710 1))) (< (select .cse8 (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ .cse6 3)) (< (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse6 2)) (<= 2147483647 .cse6)))))))) (forall ((v_ArrVal_711 (Array Int Int)) (thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_706))) (let ((.cse14 (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select (store (store .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_711) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (<= (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ v_ArrVal_710 1))) (< (select .cse12 (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ v_ArrVal_710 3)) (<= 2147483647 v_ArrVal_710) (not (< (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_710)) (< (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ v_ArrVal_710 2)))))))) (forall ((v_ArrVal_711 (Array Int Int)) (thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_706))) (let ((.cse20 (store (store .cse18 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse19 (select (store (store .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_711) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (select .cse19 (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse16 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= .cse15 (+ .cse16 1)) (< .cse16 v_ArrVal_710) (not (<= (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ v_ArrVal_710 1))) (< (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse15) (<= 2147483647 .cse16))))))))) is different from false [2022-12-14 14:42:00,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:00,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 123 [2022-12-14 14:42:00,233 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 2667 treesize of output 2649 [2022-12-14 14:42:00,259 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-12-14 14:42:00,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2060 treesize of output 1809 [2022-12-14 14:42:00,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:42:00,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:42:00,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1185 treesize of output 1151 [2022-12-14 14:42:00,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:42:00,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:42:00,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1712 treesize of output 1584 [2022-12-14 14:42:00,326 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 14:42:00,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1636 treesize of output 1602 [2022-12-14 14:42:00,382 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 14:42:00,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1644 treesize of output 1580 [2022-12-14 14:42:00,827 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:42:00,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 1 [2022-12-14 14:42:00,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:00,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 358 treesize of output 226 [2022-12-14 14:42:00,848 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 3243 treesize of output 3163 [2022-12-14 14:42:00,883 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 14:42:00,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2785 treesize of output 2625 [2022-12-14 14:42:00,937 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 14:42:00,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2737 treesize of output 2657 [2022-12-14 14:42:00,998 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 14:42:00,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2713 treesize of output 2581 [2022-12-14 14:42:01,052 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 14:42:01,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3031 treesize of output 2647 [2022-12-14 14:42:01,094 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 14:42:01,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2045 treesize of output 1909 [2022-12-14 14:42:02,390 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:42:02,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 356 treesize of output 1 [2022-12-14 14:42:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 14:42:02,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831863908] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:42:02,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [620419158] [2022-12-14 14:42:02,443 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 14:42:02,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:42:02,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 36 [2022-12-14 14:42:02,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501864605] [2022-12-14 14:42:02,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:42:02,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 14:42:02,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:42:02,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 14:42:02,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=982, Unknown=19, NotChecked=204, Total=1406 [2022-12-14 14:42:02,445 INFO L87 Difference]: Start difference. First operand 821 states and 2804 transitions. Second operand has 38 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 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 14:42:05,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:42:08,647 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 14:42:11,189 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 14:42:13,209 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 14:42:15,533 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 14:42:40,150 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 14:42:42,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:42:44,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:42:46,897 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 14:42:48,975 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 14:42:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:42:49,105 INFO L93 Difference]: Finished difference Result 3163 states and 11217 transitions. [2022-12-14 14:42:49,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-14 14:42:49,106 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 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 14:42:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:42:49,109 INFO L225 Difference]: With dead ends: 3163 [2022-12-14 14:42:49,109 INFO L226 Difference]: Without dead ends: 1392 [2022-12-14 14:42:49,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1970 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=2030, Invalid=5102, Unknown=20, NotChecked=504, Total=7656 [2022-12-14 14:42:49,110 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 1361 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 103 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 543 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:42:49,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 30 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1393 Invalid, 10 Unknown, 543 Unchecked, 25.4s Time] [2022-12-14 14:42:49,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-12-14 14:42:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 662. [2022-12-14 14:42:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 3.4145234493192134) internal successors, (2257), 661 states have internal predecessors, (2257), 0 states have call successors, (0), 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 14:42:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2257 transitions. [2022-12-14 14:42:49,124 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2257 transitions. Word has length 31 [2022-12-14 14:42:49,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:42:49,125 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 2257 transitions. [2022-12-14 14:42:49,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 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 14:42:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2257 transitions. [2022-12-14 14:42:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:42:49,126 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:42:49,126 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:42:49,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 14:42:49,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:49,328 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 2 more)] === [2022-12-14 14:42:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:42:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash -313153734, now seen corresponding path program 11 times [2022-12-14 14:42:49,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:42:49,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265171127] [2022-12-14 14:42:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:49,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:42:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:42:49,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:42:49,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265171127] [2022-12-14 14:42:49,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265171127] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:42:49,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676080782] [2022-12-14 14:42:49,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:42:49,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:49,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:42:49,429 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:42:49,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 14:42:49,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:42:49,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:42:49,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 14:42:49,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:42:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:42:49,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:42:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:42:49,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676080782] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:42:49,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [734560049] [2022-12-14 14:42:49,770 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 14:42:49,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:42:49,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-14 14:42:49,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326515830] [2022-12-14 14:42:49,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:42:49,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:42:49,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:42:49,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:42:49,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:42:49,772 INFO L87 Difference]: Start difference. First operand 662 states and 2257 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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 14:42:49,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:42:49,984 INFO L93 Difference]: Finished difference Result 863 states and 2697 transitions. [2022-12-14 14:42:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 14:42:49,985 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:42:49,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:42:49,987 INFO L225 Difference]: With dead ends: 863 [2022-12-14 14:42:49,987 INFO L226 Difference]: Without dead ends: 663 [2022-12-14 14:42:49,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-12-14 14:42:49,988 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 86 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:42:49,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 4 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:42:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-12-14 14:42:49,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2022-12-14 14:42:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 3.4108761329305137) internal successors, (2258), 662 states have internal predecessors, (2258), 0 states have call successors, (0), 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 14:42:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 2258 transitions. [2022-12-14 14:42:49,998 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 2258 transitions. Word has length 32 [2022-12-14 14:42:49,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:42:49,998 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 2258 transitions. [2022-12-14 14:42:49,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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 14:42:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 2258 transitions. [2022-12-14 14:42:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 14:42:49,999 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:42:49,999 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, 1, 1, 1, 1, 1] [2022-12-14 14:42:50,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 14:42:50,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 14:42:50,201 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 2 more)] === [2022-12-14 14:42:50,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:42:50,202 INFO L85 PathProgramCache]: Analyzing trace with hash -254978033, now seen corresponding path program 12 times [2022-12-14 14:42:50,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:42:50,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867643198] [2022-12-14 14:42:50,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:50,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:42:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:42:50,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:42:50,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867643198] [2022-12-14 14:42:50,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867643198] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:42:50,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418240001] [2022-12-14 14:42:50,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:42:50,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:50,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:42:50,328 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:42:50,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 14:42:50,427 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:42:50,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:42:50,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 14:42:50,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:42:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:42:50,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:42:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:42:50,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418240001] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:42:50,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1805184376] [2022-12-14 14:42:50,573 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 14:42:50,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:42:50,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-14 14:42:50,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378614248] [2022-12-14 14:42:50,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:42:50,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:42:50,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:42:50,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:42:50,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:42:50,575 INFO L87 Difference]: Start difference. First operand 663 states and 2258 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:42:50,704 INFO L93 Difference]: Finished difference Result 826 states and 2811 transitions. [2022-12-14 14:42:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:42:50,705 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-12-14 14:42:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:42:50,707 INFO L225 Difference]: With dead ends: 826 [2022-12-14 14:42:50,707 INFO L226 Difference]: Without dead ends: 826 [2022-12-14 14:42:50,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2022-12-14 14:42:50,707 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 159 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:42:50,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 5 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:42:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-12-14 14:42:50,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2022-12-14 14:42:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 3.4072727272727272) internal successors, (2811), 825 states have internal predecessors, (2811), 0 states have call successors, (0), 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 14:42:50,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2811 transitions. [2022-12-14 14:42:50,719 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2811 transitions. Word has length 33 [2022-12-14 14:42:50,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:42:50,719 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 2811 transitions. [2022-12-14 14:42:50,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2811 transitions. [2022-12-14 14:42:50,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 14:42:50,720 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:42:50,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:42:50,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 14:42:50,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 14:42:50,922 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 2 more)] === [2022-12-14 14:42:50,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:42:50,923 INFO L85 PathProgramCache]: Analyzing trace with hash -773394003, now seen corresponding path program 13 times [2022-12-14 14:42:50,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:42:50,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708677387] [2022-12-14 14:42:50,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:50,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:42:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:42:51,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:42:51,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708677387] [2022-12-14 14:42:51,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708677387] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:42:51,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10465982] [2022-12-14 14:42:51,056 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:42:51,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:51,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:42:51,057 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:42:51,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 14:42:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:51,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 14:42:51,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:42:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:42:51,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:42:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:42:51,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10465982] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:42:51,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1621143891] [2022-12-14 14:42:51,288 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 14:42:51,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:42:51,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-14 14:42:51,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458688586] [2022-12-14 14:42:51,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:42:51,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:42:51,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:42:51,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:42:51,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:42:51,289 INFO L87 Difference]: Start difference. First operand 826 states and 2811 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 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 14:42:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:42:51,476 INFO L93 Difference]: Finished difference Result 918 states and 3161 transitions. [2022-12-14 14:42:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:42:51,476 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 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 34 [2022-12-14 14:42:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:42:51,479 INFO L225 Difference]: With dead ends: 918 [2022-12-14 14:42:51,479 INFO L226 Difference]: Without dead ends: 918 [2022-12-14 14:42:51,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-12-14 14:42:51,479 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 65 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:42:51,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 7 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:42:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-12-14 14:42:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2022-12-14 14:42:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 917 states have (on average 3.4471101417666303) internal successors, (3161), 917 states have internal predecessors, (3161), 0 states have call successors, (0), 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 14:42:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 3161 transitions. [2022-12-14 14:42:51,494 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 3161 transitions. Word has length 34 [2022-12-14 14:42:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:42:51,494 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 3161 transitions. [2022-12-14 14:42:51,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 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 14:42:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 3161 transitions. [2022-12-14 14:42:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 14:42:51,496 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:42:51,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:42:51,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 14:42:51,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 14:42:51,697 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 2 more)] === [2022-12-14 14:42:51,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:42:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1331246849, now seen corresponding path program 14 times [2022-12-14 14:42:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:42:51,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470447815] [2022-12-14 14:42:51,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:42:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 14:42:52,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:42:52,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470447815] [2022-12-14 14:42:52,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470447815] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:42:52,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054846990] [2022-12-14 14:42:52,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:42:52,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:52,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:42:52,125 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:42:52,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f86644e9-8db9-4f09-9795-43b4da12aa60/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 14:42:52,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:42:52,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:42:52,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 14:42:52,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:42:52,419 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 42 treesize of output 40 [2022-12-14 14:42:52,522 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 14 treesize of output 16 [2022-12-14 14:42:52,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:42:52,636 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 25 treesize of output 13 [2022-12-14 14:42:52,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:42:52,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 14:42:52,726 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 23 treesize of output 23 [2022-12-14 14:42:52,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:42:52,807 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 54 treesize of output 52 [2022-12-14 14:42:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:42:52,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:43:14,954 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 941 treesize of output 897 [2022-12-14 14:43:14,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:43:14,986 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:14,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 637 treesize of output 593 [2022-12-14 14:43:15,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:15,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 930 treesize of output 876 [2022-12-14 14:43:15,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:15,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1369 treesize of output 1287 [2022-12-14 14:43:15,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:15,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 836 treesize of output 782 [2022-12-14 14:43:16,412 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 453 treesize of output 417 [2022-12-14 14:43:16,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:43:16,420 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 263 treesize of output 257 [2022-12-14 14:43:16,426 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 407 treesize of output 395 [2022-12-14 14:43:16,434 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 348 treesize of output 314 [2022-12-14 14:43:16,444 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 158 treesize of output 150 [2022-12-14 14:43:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:43:16,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054846990] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:43:16,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [62007809] [2022-12-14 14:43:16,615 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 14:43:16,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:43:16,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 37 [2022-12-14 14:43:16,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922363213] [2022-12-14 14:43:16,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:43:16,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 14:43:16,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:43:16,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 14:43:16,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1231, Unknown=24, NotChecked=0, Total=1482 [2022-12-14 14:43:16,617 INFO L87 Difference]: Start difference. First operand 918 states and 3161 transitions. Second operand has 39 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 38 states have internal predecessors, (98), 0 states have call successors, (0), 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 14:43:29,307 WARN L233 SmtUtils]: Spent 12.26s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:45:04,391 WARN L233 SmtUtils]: Spent 1.46m on a formula simplification. DAG size of input: 141 DAG size of output: 134 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:45:06,396 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 14:45:10,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:45:42,973 WARN L233 SmtUtils]: Spent 29.10s on a formula simplification. DAG size of input: 160 DAG size of output: 151 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:46:23,649 WARN L233 SmtUtils]: Spent 36.85s on a formula simplification. DAG size of input: 139 DAG size of output: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:46:36,105 WARN L233 SmtUtils]: Spent 11.92s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:46:39,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:46:50,998 WARN L233 SmtUtils]: Spent 10.38s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:46:53,088 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 14:46:55,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:46:57,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:46:59,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:47:01,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:47:58,348 WARN L233 SmtUtils]: Spent 51.14s on a formula simplification. DAG size of input: 174 DAG size of output: 158 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:48:00,368 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 14:48:02,415 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 14:48:05,276 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 14:48:10,099 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 14:48:13,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:48:15,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:48:17,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:48:41,116 WARN L233 SmtUtils]: Spent 21.56s on a formula simplification. DAG size of input: 119 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:48:42,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:48:45,468 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 14:48:47,562 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 14:48:50,015 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 14:49:51,245 WARN L233 SmtUtils]: Spent 57.57s on a formula simplification. DAG size of input: 187 DAG size of output: 151 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:50:03,263 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]