./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/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_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/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_833c1028-651b-4551-87ac-53b822d464de/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 9abac63211b9980a3b9079d9eb140a85fbc6c5adec6517ed998cc9e140b19342 --- 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 05:48:37,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 05:48:37,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 05:48:37,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 05:48:37,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 05:48:37,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 05:48:37,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 05:48:37,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 05:48:37,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 05:48:37,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 05:48:37,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 05:48:37,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 05:48:37,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 05:48:37,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 05:48:37,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 05:48:37,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 05:48:37,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 05:48:37,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 05:48:37,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 05:48:37,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 05:48:37,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 05:48:37,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 05:48:37,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 05:48:37,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 05:48:37,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 05:48:37,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 05:48:37,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 05:48:37,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 05:48:37,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 05:48:37,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 05:48:37,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 05:48:37,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 05:48:37,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 05:48:37,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 05:48:37,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 05:48:37,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 05:48:37,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 05:48:37,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 05:48:37,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 05:48:37,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 05:48:37,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 05:48:37,737 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 05:48:37,756 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 05:48:37,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 05:48:37,757 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 05:48:37,757 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 05:48:37,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 05:48:37,758 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 05:48:37,758 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 05:48:37,758 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 05:48:37,758 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 05:48:37,759 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 05:48:37,759 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 05:48:37,759 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 05:48:37,759 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 05:48:37,759 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 05:48:37,759 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 05:48:37,760 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 05:48:37,760 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 05:48:37,760 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 05:48:37,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 05:48:37,761 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 05:48:37,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 05:48:37,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 05:48:37,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 05:48:37,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 05:48:37,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 05:48:37,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 05:48:37,762 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 05:48:37,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 05:48:37,762 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 05:48:37,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 05:48:37,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 05:48:37,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 05:48:37,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:48:37,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 05:48:37,763 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 05:48:37,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 05:48:37,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 05:48:37,764 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 05:48:37,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 05:48:37,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 05:48:37,764 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 05:48:37,764 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_833c1028-651b-4551-87ac-53b822d464de/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_833c1028-651b-4551-87ac-53b822d464de/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 -> 9abac63211b9980a3b9079d9eb140a85fbc6c5adec6517ed998cc9e140b19342 [2022-12-14 05:48:37,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 05:48:37,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 05:48:37,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 05:48:37,972 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 05:48:37,972 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 05:48:37,973 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2022-12-14 05:48:40,655 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 05:48:40,811 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 05:48:40,812 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2022-12-14 05:48:40,818 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/data/e92965c3a/00a45dde7de9439da8d77239fed40947/FLAG83a5cfe33 [2022-12-14 05:48:40,831 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/data/e92965c3a/00a45dde7de9439da8d77239fed40947 [2022-12-14 05:48:40,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 05:48:40,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 05:48:40,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 05:48:40,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 05:48:40,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 05:48:40,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:48:40" (1/1) ... [2022-12-14 05:48:40,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2713316b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:48:40, skipping insertion in model container [2022-12-14 05:48:40,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:48:40" (1/1) ... [2022-12-14 05:48:40,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 05:48:40,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 05:48:40,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 05:48:40,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 05:48:40,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 05:48:40,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 05:48:40,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 05:48:40,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 05:48:40,999 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_833c1028-651b-4551-87ac-53b822d464de/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c[2553,2566] [2022-12-14 05:48:41,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:48:41,013 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 05:48:41,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 05:48:41,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 05:48:41,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 05:48:41,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 05:48:41,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 05:48:41,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 05:48:41,035 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_833c1028-651b-4551-87ac-53b822d464de/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c[2553,2566] [2022-12-14 05:48:41,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:48:41,050 INFO L208 MainTranslator]: Completed translation [2022-12-14 05:48:41,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:48:41 WrapperNode [2022-12-14 05:48:41,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 05:48:41,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 05:48:41,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 05:48:41,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 05:48:41,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:48:41" (1/1) ... [2022-12-14 05:48:41,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:48:41" (1/1) ... [2022-12-14 05:48:41,078 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-12-14 05:48:41,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 05:48:41,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 05:48:41,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 05:48:41,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 05:48:41,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:48:41" (1/1) ... [2022-12-14 05:48:41,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:48:41" (1/1) ... [2022-12-14 05:48:41,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:48:41" (1/1) ... [2022-12-14 05:48:41,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:48:41" (1/1) ... [2022-12-14 05:48:41,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:48:41" (1/1) ... [2022-12-14 05:48:41,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:48:41" (1/1) ... [2022-12-14 05:48:41,102 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:48:41" (1/1) ... [2022-12-14 05:48:41,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:48:41" (1/1) ... [2022-12-14 05:48:41,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 05:48:41,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 05:48:41,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 05:48:41,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 05:48:41,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:48:41" (1/1) ... [2022-12-14 05:48:41,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:48:41,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:48:41,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 05:48:41,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 05:48:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 05:48:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 05:48:41,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 05:48:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 05:48:41,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 05:48:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-14 05:48:41,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-14 05:48:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 05:48:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 05:48:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 05:48:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 05:48:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 05:48:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 05:48:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 05:48:41,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 05:48:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 05:48:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 05:48:41,160 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 05:48:41,240 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 05:48:41,242 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 05:48:41,452 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 05:48:41,501 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 05:48:41,501 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 05:48:41,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:48:41 BoogieIcfgContainer [2022-12-14 05:48:41,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 05:48:41,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 05:48:41,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 05:48:41,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 05:48:41,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:48:40" (1/3) ... [2022-12-14 05:48:41,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4f476e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:48:41, skipping insertion in model container [2022-12-14 05:48:41,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:48:41" (2/3) ... [2022-12-14 05:48:41,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4f476e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:48:41, skipping insertion in model container [2022-12-14 05:48:41,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:48:41" (3/3) ... [2022-12-14 05:48:41,509 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2022-12-14 05:48:41,516 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 05:48:41,523 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 05:48:41,523 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 05:48:41,523 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 05:48:41,596 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-14 05:48:41,621 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 05:48:41,632 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 153 transitions, 330 flow [2022-12-14 05:48:41,634 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 153 transitions, 330 flow [2022-12-14 05:48:41,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 330 flow [2022-12-14 05:48:41,685 INFO L130 PetriNetUnfolder]: 12/150 cut-off events. [2022-12-14 05:48:41,685 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-14 05:48:41,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 12/150 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 90 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2022-12-14 05:48:41,690 INFO L119 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-14 05:48:45,581 INFO L134 LiptonReduction]: Checked pairs total: 1571 [2022-12-14 05:48:45,581 INFO L136 LiptonReduction]: Total number of compositions: 146 [2022-12-14 05:48:45,587 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 80 flow [2022-12-14 05:48:45,603 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 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 05:48:45,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 05:48:45,620 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;@49a73671, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 05:48:45,620 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-14 05:48:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 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 05:48:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 05:48:45,627 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:48:45,628 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] [2022-12-14 05:48:45,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:48:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:48:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1151507285, now seen corresponding path program 1 times [2022-12-14 05:48:45,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:48:45,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449210775] [2022-12-14 05:48:45,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:48:45,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:48:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:48:46,046 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 05:48:46,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:48:46,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449210775] [2022-12-14 05:48:46,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449210775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:48:46,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:48:46,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:48:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011423034] [2022-12-14 05:48:46,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:48:46,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:48:46,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:48:46,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:48:46,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:48:46,072 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 05:48:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:48:46,125 INFO L93 Difference]: Finished difference Result 108 states and 328 transitions. [2022-12-14 05:48:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:48:46,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-12-14 05:48:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:48:46,135 INFO L225 Difference]: With dead ends: 108 [2022-12-14 05:48:46,135 INFO L226 Difference]: Without dead ends: 108 [2022-12-14 05:48:46,136 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 05:48:46,138 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:48:46,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:48:46,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-12-14 05:48:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-12-14 05:48:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 3.0654205607476634) internal successors, (328), 107 states have internal predecessors, (328), 0 states have call successors, (0), 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 05:48:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 328 transitions. [2022-12-14 05:48:46,176 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 328 transitions. Word has length 20 [2022-12-14 05:48:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:48:46,177 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 328 transitions. [2022-12-14 05:48:46,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 05:48:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 328 transitions. [2022-12-14 05:48:46,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:48:46,179 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:48:46,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:48:46,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 05:48:46,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:48:46,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:48:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash -584379404, now seen corresponding path program 1 times [2022-12-14 05:48:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:48:46,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080414045] [2022-12-14 05:48:46,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:48:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:48:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:48:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:48:46,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:48:46,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080414045] [2022-12-14 05:48:46,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080414045] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:48:46,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534796433] [2022-12-14 05:48:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:48:46,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:48:46,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:48:46,303 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:48:46,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 05:48:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:48:46,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 05:48:46,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:48:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:48:46,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:48:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:48:46,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534796433] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 05:48:46,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:48:46,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-12-14 05:48:46,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654293561] [2022-12-14 05:48:46,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:48:46,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:48:46,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:48:46,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:48:46,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 05:48:46,474 INFO L87 Difference]: Start difference. First operand 108 states and 328 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:48:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:48:46,537 INFO L93 Difference]: Finished difference Result 134 states and 413 transitions. [2022-12-14 05:48:46,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:48:46,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 05:48:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:48:46,540 INFO L225 Difference]: With dead ends: 134 [2022-12-14 05:48:46,540 INFO L226 Difference]: Without dead ends: 134 [2022-12-14 05:48:46,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 05:48:46,541 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 53 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:48:46,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 7 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:48:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-12-14 05:48:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-12-14 05:48:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.1052631578947367) internal successors, (413), 133 states have internal predecessors, (413), 0 states have call successors, (0), 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 05:48:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 413 transitions. [2022-12-14 05:48:46,556 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 413 transitions. Word has length 21 [2022-12-14 05:48:46,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:48:46,556 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 413 transitions. [2022-12-14 05:48:46,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:48:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 413 transitions. [2022-12-14 05:48:46,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 05:48:46,558 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:48:46,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:48:46,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 05:48:46,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:48:46,760 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:48:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:48:46,761 INFO L85 PathProgramCache]: Analyzing trace with hash -821717858, now seen corresponding path program 1 times [2022-12-14 05:48:46,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:48:46,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62159098] [2022-12-14 05:48:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:48:46,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:48:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:48:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:48:46,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:48:46,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62159098] [2022-12-14 05:48:46,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62159098] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:48:46,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617649258] [2022-12-14 05:48:46,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:48:46,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:48:46,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:48:46,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:48:46,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 05:48:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:48:47,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 05:48:47,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:48:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:48:47,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:48:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:48:47,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617649258] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 05:48:47,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:48:47,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2022-12-14 05:48:47,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203787755] [2022-12-14 05:48:47,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:48:47,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 05:48:47,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:48:47,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 05:48:47,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-14 05:48:47,187 INFO L87 Difference]: Start difference. First operand 134 states and 413 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:48:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:48:47,312 INFO L93 Difference]: Finished difference Result 166 states and 519 transitions. [2022-12-14 05:48:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 05:48:47,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 05:48:47,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:48:47,314 INFO L225 Difference]: With dead ends: 166 [2022-12-14 05:48:47,314 INFO L226 Difference]: Without dead ends: 166 [2022-12-14 05:48:47,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-12-14 05:48:47,316 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 78 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:48:47,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 11 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:48:47,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-12-14 05:48:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-12-14 05:48:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.1454545454545455) internal successors, (519), 165 states have internal predecessors, (519), 0 states have call successors, (0), 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 05:48:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 519 transitions. [2022-12-14 05:48:47,333 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 519 transitions. Word has length 22 [2022-12-14 05:48:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:48:47,334 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 519 transitions. [2022-12-14 05:48:47,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:48:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 519 transitions. [2022-12-14 05:48:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:48:47,336 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:48:47,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:48:47,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 05:48:47,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:48:47,537 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:48:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:48:47,537 INFO L85 PathProgramCache]: Analyzing trace with hash 514177572, now seen corresponding path program 1 times [2022-12-14 05:48:47,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:48:47,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480723299] [2022-12-14 05:48:47,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:48:47,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:48:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:48:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:48:48,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:48:48,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480723299] [2022-12-14 05:48:48,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480723299] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:48:48,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651044806] [2022-12-14 05:48:48,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:48:48,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:48:48,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:48:48,367 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:48:48,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 05:48:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:48:48,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 05:48:48,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:48:48,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:48:48,717 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 35 treesize of output 33 [2022-12-14 05:48:48,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:48:48,831 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 35 treesize of output 33 [2022-12-14 05:48:48,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:48:48,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 46 [2022-12-14 05:48:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:48:49,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:48:51,719 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_154 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_153) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_154) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (= c_~min1~0 .cse0) (not (< .cse0 c_~min2~0)) (< (+ ~M~0 1) c_~N~0)))) (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_154 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_153) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_154) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0) (< (+ ~M~0 1) c_~N~0))))) is different from false [2022-12-14 05:48:51,787 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:48:51,788 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 277 treesize of output 265 [2022-12-14 05:48:51,797 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 206 treesize of output 194 [2022-12-14 05:48:51,806 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 194 treesize of output 188 [2022-12-14 05:48:51,813 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 188 treesize of output 164 [2022-12-14 05:48:51,821 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 164 treesize of output 152 [2022-12-14 05:48:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 05:48:52,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651044806] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:48:52,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1040154119] [2022-12-14 05:48:52,754 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 05:48:52,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:48:52,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 28 [2022-12-14 05:48:52,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287917270] [2022-12-14 05:48:52,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:48:52,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 05:48:52,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:48:52,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 05:48:52,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=698, Unknown=6, NotChecked=54, Total=870 [2022-12-14 05:48:52,759 INFO L87 Difference]: Start difference. First operand 166 states and 519 transitions. Second operand has 30 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 29 states have internal predecessors, (62), 0 states have call successors, (0), 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 05:48:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:48:58,863 INFO L93 Difference]: Finished difference Result 644 states and 1948 transitions. [2022-12-14 05:48:58,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 05:48:58,863 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 29 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 05:48:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:48:58,866 INFO L225 Difference]: With dead ends: 644 [2022-12-14 05:48:58,866 INFO L226 Difference]: Without dead ends: 630 [2022-12-14 05:48:58,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=287, Invalid=1690, Unknown=7, NotChecked=86, Total=2070 [2022-12-14 05:48:58,867 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 319 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:48:58,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 154 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1409 Invalid, 0 Unknown, 91 Unchecked, 1.2s Time] [2022-12-14 05:48:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-12-14 05:48:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 330. [2022-12-14 05:48:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 3.2492401215805473) internal successors, (1069), 329 states have internal predecessors, (1069), 0 states have call successors, (0), 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 05:48:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1069 transitions. [2022-12-14 05:48:58,884 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1069 transitions. Word has length 23 [2022-12-14 05:48:58,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:48:58,884 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 1069 transitions. [2022-12-14 05:48:58,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 29 states have internal predecessors, (62), 0 states have call successors, (0), 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 05:48:58,885 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1069 transitions. [2022-12-14 05:48:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:48:58,888 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:48:58,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:48:58,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 05:48:59,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:48:59,090 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:48:59,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:48:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2001273604, now seen corresponding path program 2 times [2022-12-14 05:48:59,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:48:59,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393273973] [2022-12-14 05:48:59,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:48:59,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:48:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:48:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:48:59,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:48:59,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393273973] [2022-12-14 05:48:59,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393273973] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:48:59,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299021328] [2022-12-14 05:48:59,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:48:59,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:48:59,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:48:59,709 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:48:59,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 05:48:59,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 05:48:59,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:48:59,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 05:48:59,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:00,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:00,108 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 79 treesize of output 81 [2022-12-14 05:49:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:00,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:00,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:00,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 51 [2022-12-14 05:49:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:00,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299021328] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:00,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1524325661] [2022-12-14 05:49:00,745 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 05:49:00,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:00,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 25 [2022-12-14 05:49:00,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914015366] [2022-12-14 05:49:00,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:00,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 05:49:00,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:00,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 05:49:00,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2022-12-14 05:49:00,747 INFO L87 Difference]: Start difference. First operand 330 states and 1069 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 0 states have call successors, (0), 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 05:49:02,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:02,264 INFO L93 Difference]: Finished difference Result 522 states and 1604 transitions. [2022-12-14 05:49:02,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 05:49:02,265 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 05:49:02,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:02,267 INFO L225 Difference]: With dead ends: 522 [2022-12-14 05:49:02,268 INFO L226 Difference]: Without dead ends: 508 [2022-12-14 05:49:02,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=458, Invalid=1704, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 05:49:02,269 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 175 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:02,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 70 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 05:49:02,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-12-14 05:49:02,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 352. [2022-12-14 05:49:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 3.2706552706552707) internal successors, (1148), 351 states have internal predecessors, (1148), 0 states have call successors, (0), 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 05:49:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1148 transitions. [2022-12-14 05:49:02,287 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1148 transitions. Word has length 23 [2022-12-14 05:49:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:02,288 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 1148 transitions. [2022-12-14 05:49:02,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 0 states have call successors, (0), 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 05:49:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1148 transitions. [2022-12-14 05:49:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:49:02,290 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:02,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:49:02,295 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 05:49:02,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:02,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:02,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1875986532, now seen corresponding path program 3 times [2022-12-14 05:49:02,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:02,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116086161] [2022-12-14 05:49:02,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:02,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:03,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:03,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116086161] [2022-12-14 05:49:03,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116086161] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:03,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554790560] [2022-12-14 05:49:03,030 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:49:03,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:03,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:03,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:03,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 05:49:03,109 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:49:03,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:03,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 05:49:03,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:03,491 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-14 05:49:03,491 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 79 treesize of output 69 [2022-12-14 05:49:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:03,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:03,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:03,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 51 [2022-12-14 05:49:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:03,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554790560] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:03,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1339073550] [2022-12-14 05:49:03,845 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 05:49:03,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:03,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 23 [2022-12-14 05:49:03,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721576497] [2022-12-14 05:49:03,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:03,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 05:49:03,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:03,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 05:49:03,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-12-14 05:49:03,847 INFO L87 Difference]: Start difference. First operand 352 states and 1148 transitions. Second operand has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 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 05:49:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:06,703 INFO L93 Difference]: Finished difference Result 1065 states and 3091 transitions. [2022-12-14 05:49:06,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-14 05:49:06,703 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 05:49:06,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:06,706 INFO L225 Difference]: With dead ends: 1065 [2022-12-14 05:49:06,706 INFO L226 Difference]: Without dead ends: 1030 [2022-12-14 05:49:06,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=617, Invalid=3415, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 05:49:06,708 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 211 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 2241 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:06,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 121 Invalid, 2265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2241 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 05:49:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2022-12-14 05:49:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 402. [2022-12-14 05:49:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 3.309226932668329) internal successors, (1327), 401 states have internal predecessors, (1327), 0 states have call successors, (0), 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 05:49:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1327 transitions. [2022-12-14 05:49:06,724 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1327 transitions. Word has length 23 [2022-12-14 05:49:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:06,724 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 1327 transitions. [2022-12-14 05:49:06,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 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 05:49:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1327 transitions. [2022-12-14 05:49:06,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:49:06,725 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:06,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:49:06,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 05:49:06,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:06,927 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:06,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:06,929 INFO L85 PathProgramCache]: Analyzing trace with hash -156210250, now seen corresponding path program 4 times [2022-12-14 05:49:06,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:06,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230344441] [2022-12-14 05:49:06,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:06,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:07,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:07,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230344441] [2022-12-14 05:49:07,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230344441] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:07,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162301288] [2022-12-14 05:49:07,446 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:49:07,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:07,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:07,447 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:07,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 05:49:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:07,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-14 05:49:07,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:07,794 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 57 treesize of output 33 [2022-12-14 05:49:07,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:07,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:07,949 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:07,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 49 [2022-12-14 05:49:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:08,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162301288] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:08,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1920322699] [2022-12-14 05:49:08,098 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 05:49:08,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:08,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2022-12-14 05:49:08,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741741314] [2022-12-14 05:49:08,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:08,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 05:49:08,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:08,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 05:49:08,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-12-14 05:49:08,100 INFO L87 Difference]: Start difference. First operand 402 states and 1327 transitions. Second operand has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 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 05:49:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:08,912 INFO L93 Difference]: Finished difference Result 657 states and 2132 transitions. [2022-12-14 05:49:08,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 05:49:08,913 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 05:49:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:08,916 INFO L225 Difference]: With dead ends: 657 [2022-12-14 05:49:08,917 INFO L226 Difference]: Without dead ends: 650 [2022-12-14 05:49:08,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 05:49:08,917 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 156 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:08,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 120 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 05:49:08,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-12-14 05:49:08,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 426. [2022-12-14 05:49:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 3.268235294117647) internal successors, (1389), 425 states have internal predecessors, (1389), 0 states have call successors, (0), 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 05:49:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1389 transitions. [2022-12-14 05:49:08,927 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1389 transitions. Word has length 23 [2022-12-14 05:49:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:08,927 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 1389 transitions. [2022-12-14 05:49:08,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 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 05:49:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1389 transitions. [2022-12-14 05:49:08,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:49:08,928 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:08,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:49:08,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 05:49:09,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:09,130 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:09,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash 453131374, now seen corresponding path program 5 times [2022-12-14 05:49:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:09,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132725509] [2022-12-14 05:49:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:09,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:09,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132725509] [2022-12-14 05:49:09,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132725509] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:09,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790480738] [2022-12-14 05:49:09,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:49:09,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:09,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:09,583 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:09,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 05:49:09,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 05:49:09,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:09,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 05:49:09,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:10,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:10,053 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 79 treesize of output 81 [2022-12-14 05:49:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:10,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:10,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:10,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 51 [2022-12-14 05:49:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:10,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790480738] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:10,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1371145642] [2022-12-14 05:49:10,710 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 05:49:10,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:10,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-12-14 05:49:10,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482286466] [2022-12-14 05:49:10,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:10,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 05:49:10,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:10,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 05:49:10,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2022-12-14 05:49:10,711 INFO L87 Difference]: Start difference. First operand 426 states and 1389 transitions. Second operand has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 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 05:49:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:12,007 INFO L93 Difference]: Finished difference Result 637 states and 1978 transitions. [2022-12-14 05:49:12,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 05:49:12,007 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 05:49:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:12,009 INFO L225 Difference]: With dead ends: 637 [2022-12-14 05:49:12,009 INFO L226 Difference]: Without dead ends: 616 [2022-12-14 05:49:12,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=476, Invalid=1594, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 05:49:12,010 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 201 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:12,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 104 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 05:49:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-12-14 05:49:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 434. [2022-12-14 05:49:12,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 3.2817551963048497) internal successors, (1421), 433 states have internal predecessors, (1421), 0 states have call successors, (0), 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 05:49:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1421 transitions. [2022-12-14 05:49:12,020 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1421 transitions. Word has length 23 [2022-12-14 05:49:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:12,020 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 1421 transitions. [2022-12-14 05:49:12,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 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 05:49:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1421 transitions. [2022-12-14 05:49:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:49:12,021 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:12,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:49:12,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 05:49:12,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:12,223 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:12,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:12,224 INFO L85 PathProgramCache]: Analyzing trace with hash 327844302, now seen corresponding path program 6 times [2022-12-14 05:49:12,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:12,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774964552] [2022-12-14 05:49:12,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:12,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:12,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:12,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774964552] [2022-12-14 05:49:12,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774964552] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:12,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688292743] [2022-12-14 05:49:12,785 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:49:12,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:12,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:12,786 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:12,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 05:49:12,851 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:49:12,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:12,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 05:49:12,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:13,087 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-14 05:49:13,087 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 85 treesize of output 69 [2022-12-14 05:49:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:13,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:13,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:13,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 51 [2022-12-14 05:49:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:13,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688292743] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:13,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [531946983] [2022-12-14 05:49:13,499 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 05:49:13,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:13,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 24 [2022-12-14 05:49:13,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824549256] [2022-12-14 05:49:13,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:13,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 05:49:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:13,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 05:49:13,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2022-12-14 05:49:13,501 INFO L87 Difference]: Start difference. First operand 434 states and 1421 transitions. Second operand has 26 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 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 05:49:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:14,661 INFO L93 Difference]: Finished difference Result 710 states and 2094 transitions. [2022-12-14 05:49:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 05:49:14,661 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 05:49:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:14,663 INFO L225 Difference]: With dead ends: 710 [2022-12-14 05:49:14,663 INFO L226 Difference]: Without dead ends: 689 [2022-12-14 05:49:14,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=249, Invalid=1311, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 05:49:14,664 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 86 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:14,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 73 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 05:49:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-12-14 05:49:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 434. [2022-12-14 05:49:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 3.2817551963048497) internal successors, (1421), 433 states have internal predecessors, (1421), 0 states have call successors, (0), 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 05:49:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1421 transitions. [2022-12-14 05:49:14,674 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1421 transitions. Word has length 23 [2022-12-14 05:49:14,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:14,674 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 1421 transitions. [2022-12-14 05:49:14,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 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 05:49:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1421 transitions. [2022-12-14 05:49:14,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:49:14,675 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:14,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:49:14,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 05:49:14,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:14,876 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:14,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:14,877 INFO L85 PathProgramCache]: Analyzing trace with hash 989414152, now seen corresponding path program 7 times [2022-12-14 05:49:14,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:14,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494336279] [2022-12-14 05:49:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:15,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:15,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494336279] [2022-12-14 05:49:15,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494336279] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:15,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400366416] [2022-12-14 05:49:15,354 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:49:15,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:15,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:15,355 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:15,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 05:49:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:15,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 05:49:15,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:15,775 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 57 treesize of output 33 [2022-12-14 05:49:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:15,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:15,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:15,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 51 [2022-12-14 05:49:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:16,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400366416] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:16,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1262899416] [2022-12-14 05:49:16,116 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 05:49:16,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:16,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2022-12-14 05:49:16,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961094788] [2022-12-14 05:49:16,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:16,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 05:49:16,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:16,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 05:49:16,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-12-14 05:49:16,118 INFO L87 Difference]: Start difference. First operand 434 states and 1421 transitions. Second operand has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 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 05:49:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:16,525 INFO L93 Difference]: Finished difference Result 509 states and 1623 transitions. [2022-12-14 05:49:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 05:49:16,525 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 05:49:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:16,527 INFO L225 Difference]: With dead ends: 509 [2022-12-14 05:49:16,527 INFO L226 Difference]: Without dead ends: 502 [2022-12-14 05:49:16,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 05:49:16,527 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 68 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:16,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 32 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:49:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-12-14 05:49:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 446. [2022-12-14 05:49:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 3.2786516853932586) internal successors, (1459), 445 states have internal predecessors, (1459), 0 states have call successors, (0), 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 05:49:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1459 transitions. [2022-12-14 05:49:16,535 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1459 transitions. Word has length 23 [2022-12-14 05:49:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:16,536 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 1459 transitions. [2022-12-14 05:49:16,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 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 05:49:16,536 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1459 transitions. [2022-12-14 05:49:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:49:16,536 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:16,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:49:16,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 05:49:16,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:16,738 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:16,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1484683740, now seen corresponding path program 8 times [2022-12-14 05:49:16,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:16,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560943332] [2022-12-14 05:49:16,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:16,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:17,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:17,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560943332] [2022-12-14 05:49:17,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560943332] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:17,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647068501] [2022-12-14 05:49:17,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:49:17,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:17,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:17,267 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:17,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 05:49:17,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 05:49:17,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:17,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 05:49:17,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:17,606 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 57 treesize of output 33 [2022-12-14 05:49:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:17,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:17,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:17,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 51 [2022-12-14 05:49:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:17,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647068501] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:17,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1322579915] [2022-12-14 05:49:17,984 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 05:49:17,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:17,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2022-12-14 05:49:17,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352175668] [2022-12-14 05:49:17,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:17,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 05:49:17,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:17,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 05:49:17,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2022-12-14 05:49:17,986 INFO L87 Difference]: Start difference. First operand 446 states and 1459 transitions. Second operand has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 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 05:49:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:18,752 INFO L93 Difference]: Finished difference Result 537 states and 1712 transitions. [2022-12-14 05:49:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 05:49:18,752 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 05:49:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:18,754 INFO L225 Difference]: With dead ends: 537 [2022-12-14 05:49:18,754 INFO L226 Difference]: Without dead ends: 530 [2022-12-14 05:49:18,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 05:49:18,754 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 69 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:18,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 38 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 05:49:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-12-14 05:49:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 450. [2022-12-14 05:49:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.285077951002227) internal successors, (1475), 449 states have internal predecessors, (1475), 0 states have call successors, (0), 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 05:49:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1475 transitions. [2022-12-14 05:49:18,762 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1475 transitions. Word has length 23 [2022-12-14 05:49:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:18,762 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 1475 transitions. [2022-12-14 05:49:18,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 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 05:49:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1475 transitions. [2022-12-14 05:49:18,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:49:18,763 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:18,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:49:18,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 05:49:18,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 05:49:18,965 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:18,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:18,966 INFO L85 PathProgramCache]: Analyzing trace with hash -2059740122, now seen corresponding path program 9 times [2022-12-14 05:49:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:18,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257208375] [2022-12-14 05:49:18,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:19,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:19,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257208375] [2022-12-14 05:49:19,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257208375] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:19,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260065683] [2022-12-14 05:49:19,379 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:49:19,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:19,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:19,379 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:19,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 05:49:19,447 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:49:19,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:19,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 05:49:19,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:19,732 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-14 05:49:19,732 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 85 treesize of output 69 [2022-12-14 05:49:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:19,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:19,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:19,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 51 [2022-12-14 05:49:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:20,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260065683] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:20,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1896628458] [2022-12-14 05:49:20,164 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 05:49:20,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:20,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 22 [2022-12-14 05:49:20,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125580809] [2022-12-14 05:49:20,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:20,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 05:49:20,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:20,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 05:49:20,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2022-12-14 05:49:20,166 INFO L87 Difference]: Start difference. First operand 450 states and 1475 transitions. Second operand has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 05:49:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:23,733 INFO L93 Difference]: Finished difference Result 1454 states and 4251 transitions. [2022-12-14 05:49:23,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-14 05:49:23,734 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 05:49:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:23,738 INFO L225 Difference]: With dead ends: 1454 [2022-12-14 05:49:23,738 INFO L226 Difference]: Without dead ends: 1384 [2022-12-14 05:49:23,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=578, Invalid=3328, Unknown=0, NotChecked=0, Total=3906 [2022-12-14 05:49:23,739 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 182 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2419 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 2448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:23,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 154 Invalid, 2448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2419 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 05:49:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2022-12-14 05:49:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 470. [2022-12-14 05:49:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 3.4008528784648187) internal successors, (1595), 469 states have internal predecessors, (1595), 0 states have call successors, (0), 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 05:49:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1595 transitions. [2022-12-14 05:49:23,752 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1595 transitions. Word has length 23 [2022-12-14 05:49:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:23,752 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 1595 transitions. [2022-12-14 05:49:23,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 05:49:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1595 transitions. [2022-12-14 05:49:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 05:49:23,753 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:23,754 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] [2022-12-14 05:49:23,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 05:49:23,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:23,955 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash 433075009, now seen corresponding path program 10 times [2022-12-14 05:49:23,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:23,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618412680] [2022-12-14 05:49:23,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:23,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:24,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:24,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618412680] [2022-12-14 05:49:24,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618412680] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:24,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287759072] [2022-12-14 05:49:24,048 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:49:24,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:24,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:24,049 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:24,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 05:49:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:24,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 05:49:24,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:24,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:24,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287759072] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:24,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [629601128] [2022-12-14 05:49:24,210 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 05:49:24,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:24,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-14 05:49:24,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254385969] [2022-12-14 05:49:24,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:24,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 05:49:24,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:24,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 05:49:24,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-12-14 05:49:24,212 INFO L87 Difference]: Start difference. First operand 470 states and 1595 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:24,344 INFO L93 Difference]: Finished difference Result 670 states and 2248 transitions. [2022-12-14 05:49:24,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 05:49:24,345 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 05:49:24,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:24,348 INFO L225 Difference]: With dead ends: 670 [2022-12-14 05:49:24,348 INFO L226 Difference]: Without dead ends: 670 [2022-12-14 05:49:24,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 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 05:49:24,349 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 133 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:24,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 31 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:49:24,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-12-14 05:49:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 500. [2022-12-14 05:49:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 499 states have (on average 3.434869739478958) internal successors, (1714), 499 states have internal predecessors, (1714), 0 states have call successors, (0), 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 05:49:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1714 transitions. [2022-12-14 05:49:24,358 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1714 transitions. Word has length 24 [2022-12-14 05:49:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:24,358 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 1714 transitions. [2022-12-14 05:49:24,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1714 transitions. [2022-12-14 05:49:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 05:49:24,359 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:24,359 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] [2022-12-14 05:49:24,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-14 05:49:24,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:24,560 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:24,560 INFO L85 PathProgramCache]: Analyzing trace with hash 65189966, now seen corresponding path program 11 times [2022-12-14 05:49:24,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:24,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182176899] [2022-12-14 05:49:24,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:24,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:24,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:24,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182176899] [2022-12-14 05:49:24,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182176899] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:24,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043184342] [2022-12-14 05:49:24,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:49:24,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:24,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:24,625 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:24,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 05:49:24,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 05:49:24,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:24,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 05:49:24,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:24,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:24,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043184342] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:24,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1293324514] [2022-12-14 05:49:24,859 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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 05:49:24,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:24,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 18 [2022-12-14 05:49:24,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676863737] [2022-12-14 05:49:24,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:24,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 05:49:24,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:24,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 05:49:24,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-12-14 05:49:24,860 INFO L87 Difference]: Start difference. First operand 500 states and 1714 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:25,324 INFO L93 Difference]: Finished difference Result 694 states and 2193 transitions. [2022-12-14 05:49:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 05:49:25,324 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 05:49:25,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:25,326 INFO L225 Difference]: With dead ends: 694 [2022-12-14 05:49:25,326 INFO L226 Difference]: Without dead ends: 684 [2022-12-14 05:49:25,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2022-12-14 05:49:25,327 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 271 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:25,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 98 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:49:25,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-12-14 05:49:25,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 494. [2022-12-14 05:49:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.283975659229209) internal successors, (1619), 493 states have internal predecessors, (1619), 0 states have call successors, (0), 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 05:49:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1619 transitions. [2022-12-14 05:49:25,342 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1619 transitions. Word has length 24 [2022-12-14 05:49:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:25,342 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 1619 transitions. [2022-12-14 05:49:25,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1619 transitions. [2022-12-14 05:49:25,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 05:49:25,344 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:25,344 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] [2022-12-14 05:49:25,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 05:49:25,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 05:49:25,545 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:25,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:25,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1022737058, now seen corresponding path program 12 times [2022-12-14 05:49:25,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:25,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2434382] [2022-12-14 05:49:25,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:25,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:25,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:25,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2434382] [2022-12-14 05:49:25,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2434382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:25,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741910011] [2022-12-14 05:49:25,659 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:49:25,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:25,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:25,660 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:25,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 05:49:25,729 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:49:25,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:25,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 05:49:25,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:25,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:25,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741910011] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:25,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2003849586] [2022-12-14 05:49:25,904 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 05:49:25,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:25,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2022-12-14 05:49:25,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835437019] [2022-12-14 05:49:25,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:25,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 05:49:25,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:25,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 05:49:25,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-12-14 05:49:25,905 INFO L87 Difference]: Start difference. First operand 494 states and 1619 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:26,244 INFO L93 Difference]: Finished difference Result 554 states and 1683 transitions. [2022-12-14 05:49:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 05:49:26,245 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 05:49:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:26,246 INFO L225 Difference]: With dead ends: 554 [2022-12-14 05:49:26,246 INFO L226 Difference]: Without dead ends: 510 [2022-12-14 05:49:26,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-12-14 05:49:26,247 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 223 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:26,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 56 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:49:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-12-14 05:49:26,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 494. [2022-12-14 05:49:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.0933062880324544) internal successors, (1525), 493 states have internal predecessors, (1525), 0 states have call successors, (0), 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 05:49:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1525 transitions. [2022-12-14 05:49:26,257 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1525 transitions. Word has length 24 [2022-12-14 05:49:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:26,257 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 1525 transitions. [2022-12-14 05:49:26,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1525 transitions. [2022-12-14 05:49:26,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 05:49:26,258 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:26,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:49:26,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 05:49:26,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 05:49:26,460 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:26,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:26,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1963283162, now seen corresponding path program 1 times [2022-12-14 05:49:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:26,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448329314] [2022-12-14 05:49:26,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:26,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:26,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:26,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448329314] [2022-12-14 05:49:26,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448329314] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:26,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199602600] [2022-12-14 05:49:26,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:26,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:26,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:26,554 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:26,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 05:49:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:26,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 05:49:26,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:26,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:26,758 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 05:49:26,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199602600] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:26,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1004339879] [2022-12-14 05:49:26,759 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 05:49:26,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:26,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-14 05:49:26,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057728058] [2022-12-14 05:49:26,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:26,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 05:49:26,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:26,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 05:49:26,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-12-14 05:49:26,760 INFO L87 Difference]: Start difference. First operand 494 states and 1525 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:27,167 INFO L93 Difference]: Finished difference Result 664 states and 1926 transitions. [2022-12-14 05:49:27,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 05:49:27,168 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 05:49:27,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:27,169 INFO L225 Difference]: With dead ends: 664 [2022-12-14 05:49:27,169 INFO L226 Difference]: Without dead ends: 632 [2022-12-14 05:49:27,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2022-12-14 05:49:27,170 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 179 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:27,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 67 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:49:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-12-14 05:49:27,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 528. [2022-12-14 05:49:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 3.0531309297912714) internal successors, (1609), 527 states have internal predecessors, (1609), 0 states have call successors, (0), 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 05:49:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1609 transitions. [2022-12-14 05:49:27,178 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1609 transitions. Word has length 24 [2022-12-14 05:49:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:27,179 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 1609 transitions. [2022-12-14 05:49:27,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1609 transitions. [2022-12-14 05:49:27,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 05:49:27,180 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:27,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:49:27,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-14 05:49:27,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:27,381 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:27,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1210564000, now seen corresponding path program 2 times [2022-12-14 05:49:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:27,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165979346] [2022-12-14 05:49:27,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:27,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:27,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:27,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165979346] [2022-12-14 05:49:27,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165979346] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:27,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662839724] [2022-12-14 05:49:27,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:49:27,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:27,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:27,459 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:27,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 05:49:27,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 05:49:27,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:27,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 05:49:27,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:27,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:27,672 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 05:49:27,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662839724] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:27,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1040874440] [2022-12-14 05:49:27,673 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 05:49:27,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:27,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-14 05:49:27,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816097617] [2022-12-14 05:49:27,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:27,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 05:49:27,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:27,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 05:49:27,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-12-14 05:49:27,674 INFO L87 Difference]: Start difference. First operand 528 states and 1609 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 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 05:49:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:28,054 INFO L93 Difference]: Finished difference Result 634 states and 1795 transitions. [2022-12-14 05:49:28,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 05:49:28,054 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 05:49:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:28,058 INFO L225 Difference]: With dead ends: 634 [2022-12-14 05:49:28,059 INFO L226 Difference]: Without dead ends: 602 [2022-12-14 05:49:28,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=309, Invalid=747, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 05:49:28,060 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 193 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:28,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 65 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:49:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-12-14 05:49:28,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 506. [2022-12-14 05:49:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 3.0475247524752476) internal successors, (1539), 505 states have internal predecessors, (1539), 0 states have call successors, (0), 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 05:49:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1539 transitions. [2022-12-14 05:49:28,070 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1539 transitions. Word has length 24 [2022-12-14 05:49:28,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:28,070 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 1539 transitions. [2022-12-14 05:49:28,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 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 05:49:28,070 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1539 transitions. [2022-12-14 05:49:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 05:49:28,071 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:28,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:49:28,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 05:49:28,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 05:49:28,272 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:28,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:28,272 INFO L85 PathProgramCache]: Analyzing trace with hash 842364330, now seen corresponding path program 3 times [2022-12-14 05:49:28,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:28,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858958771] [2022-12-14 05:49:28,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:28,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:28,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:28,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858958771] [2022-12-14 05:49:28,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858958771] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:28,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286890636] [2022-12-14 05:49:28,375 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:49:28,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:28,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:28,376 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:28,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 05:49:28,445 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:49:28,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:28,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 05:49:28,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:28,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:28,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286890636] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:28,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [931701984] [2022-12-14 05:49:28,527 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 05:49:28,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:28,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2022-12-14 05:49:28,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117765297] [2022-12-14 05:49:28,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:28,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 05:49:28,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:28,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 05:49:28,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-12-14 05:49:28,529 INFO L87 Difference]: Start difference. First operand 506 states and 1539 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:28,968 INFO L93 Difference]: Finished difference Result 428 states and 1265 transitions. [2022-12-14 05:49:28,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 05:49:28,968 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 05:49:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:28,971 INFO L225 Difference]: With dead ends: 428 [2022-12-14 05:49:28,971 INFO L226 Difference]: Without dead ends: 307 [2022-12-14 05:49:28,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=271, Invalid=785, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 05:49:28,972 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 134 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:28,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 66 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:49:28,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-12-14 05:49:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2022-12-14 05:49:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.301324503311258) internal successors, (997), 302 states have internal predecessors, (997), 0 states have call successors, (0), 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 05:49:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 997 transitions. [2022-12-14 05:49:28,977 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 997 transitions. Word has length 24 [2022-12-14 05:49:28,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:28,977 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 997 transitions. [2022-12-14 05:49:28,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:28,977 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 997 transitions. [2022-12-14 05:49:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 05:49:28,977 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:28,977 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] [2022-12-14 05:49:28,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 05:49:29,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 05:49:29,179 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:29,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:29,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1504637981, now seen corresponding path program 13 times [2022-12-14 05:49:29,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:29,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136825476] [2022-12-14 05:49:29,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:29,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:29,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:29,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136825476] [2022-12-14 05:49:29,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136825476] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:29,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030954083] [2022-12-14 05:49:29,302 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:49:29,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:29,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:29,303 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:29,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 05:49:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:29,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 05:49:29,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:29,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:29,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030954083] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:29,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [644727502] [2022-12-14 05:49:29,515 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 05:49:29,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:29,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-14 05:49:29,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907520758] [2022-12-14 05:49:29,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:29,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 05:49:29,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:29,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 05:49:29,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-12-14 05:49:29,516 INFO L87 Difference]: Start difference. First operand 303 states and 997 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:29,687 INFO L93 Difference]: Finished difference Result 471 states and 1515 transitions. [2022-12-14 05:49:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 05:49:29,687 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 05:49:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:29,691 INFO L225 Difference]: With dead ends: 471 [2022-12-14 05:49:29,691 INFO L226 Difference]: Without dead ends: 471 [2022-12-14 05:49:29,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-12-14 05:49:29,692 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 191 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:29,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 27 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:49:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-12-14 05:49:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 337. [2022-12-14 05:49:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 3.369047619047619) internal successors, (1132), 336 states have internal predecessors, (1132), 0 states have call successors, (0), 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 05:49:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1132 transitions. [2022-12-14 05:49:29,701 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1132 transitions. Word has length 25 [2022-12-14 05:49:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:29,701 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 1132 transitions. [2022-12-14 05:49:29,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1132 transitions. [2022-12-14 05:49:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 05:49:29,702 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:29,702 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] [2022-12-14 05:49:29,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 05:49:29,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:29,903 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:29,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:29,904 INFO L85 PathProgramCache]: Analyzing trace with hash -36478745, now seen corresponding path program 14 times [2022-12-14 05:49:29,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:29,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282843903] [2022-12-14 05:49:29,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:29,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:30,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:30,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282843903] [2022-12-14 05:49:30,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282843903] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:30,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343244746] [2022-12-14 05:49:30,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:49:30,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:30,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:30,041 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:30,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 05:49:30,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 05:49:30,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:30,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 05:49:30,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:30,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:30,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343244746] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:30,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [23210043] [2022-12-14 05:49:30,335 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 05:49:30,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:30,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-14 05:49:30,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317784026] [2022-12-14 05:49:30,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:30,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 05:49:30,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:30,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 05:49:30,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-14 05:49:30,337 INFO L87 Difference]: Start difference. First operand 337 states and 1132 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 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 05:49:30,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:30,811 INFO L93 Difference]: Finished difference Result 595 states and 1884 transitions. [2022-12-14 05:49:30,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 05:49:30,812 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 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 25 [2022-12-14 05:49:30,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:30,817 INFO L225 Difference]: With dead ends: 595 [2022-12-14 05:49:30,817 INFO L226 Difference]: Without dead ends: 595 [2022-12-14 05:49:30,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=614, Unknown=0, NotChecked=0, Total=870 [2022-12-14 05:49:30,818 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 258 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:30,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 48 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:49:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-12-14 05:49:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 343. [2022-12-14 05:49:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 3.4210526315789473) internal successors, (1170), 342 states have internal predecessors, (1170), 0 states have call successors, (0), 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 05:49:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1170 transitions. [2022-12-14 05:49:30,826 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1170 transitions. Word has length 25 [2022-12-14 05:49:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:30,826 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 1170 transitions. [2022-12-14 05:49:30,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 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 05:49:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1170 transitions. [2022-12-14 05:49:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 05:49:30,827 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:30,827 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] [2022-12-14 05:49:30,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 05:49:31,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:31,029 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash 818827909, now seen corresponding path program 15 times [2022-12-14 05:49:31,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:31,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536157306] [2022-12-14 05:49:31,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:31,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:31,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:31,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536157306] [2022-12-14 05:49:31,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536157306] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:31,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047017310] [2022-12-14 05:49:31,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:49:31,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:31,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:31,159 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:31,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 05:49:31,222 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:49:31,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:31,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 05:49:31,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:31,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:31,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047017310] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:31,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [410274273] [2022-12-14 05:49:31,392 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 05:49:31,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:31,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2022-12-14 05:49:31,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416650096] [2022-12-14 05:49:31,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:31,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 05:49:31,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:31,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 05:49:31,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-12-14 05:49:31,393 INFO L87 Difference]: Start difference. First operand 343 states and 1170 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:31,928 INFO L93 Difference]: Finished difference Result 547 states and 1745 transitions. [2022-12-14 05:49:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 05:49:31,928 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 05:49:31,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:31,930 INFO L225 Difference]: With dead ends: 547 [2022-12-14 05:49:31,930 INFO L226 Difference]: Without dead ends: 547 [2022-12-14 05:49:31,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=338, Invalid=994, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 05:49:31,931 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 207 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:31,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 57 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:49:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-12-14 05:49:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 355. [2022-12-14 05:49:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 3.3870056497175143) internal successors, (1199), 354 states have internal predecessors, (1199), 0 states have call successors, (0), 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 05:49:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1199 transitions. [2022-12-14 05:49:31,937 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1199 transitions. Word has length 25 [2022-12-14 05:49:31,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:31,937 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 1199 transitions. [2022-12-14 05:49:31,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1199 transitions. [2022-12-14 05:49:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 05:49:31,938 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:31,938 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] [2022-12-14 05:49:31,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 05:49:32,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:32,140 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:32,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:32,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1956445143, now seen corresponding path program 16 times [2022-12-14 05:49:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:32,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434616910] [2022-12-14 05:49:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:32,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:32,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434616910] [2022-12-14 05:49:32,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434616910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:32,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769264718] [2022-12-14 05:49:32,256 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:49:32,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:32,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:32,257 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:32,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 05:49:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:32,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 05:49:32,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:32,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:32,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769264718] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:32,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1706346978] [2022-12-14 05:49:32,491 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 05:49:32,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:32,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-14 05:49:32,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635617484] [2022-12-14 05:49:32,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:32,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 05:49:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:32,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 05:49:32,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-12-14 05:49:32,492 INFO L87 Difference]: Start difference. First operand 355 states and 1199 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:32,809 INFO L93 Difference]: Finished difference Result 409 states and 1351 transitions. [2022-12-14 05:49:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 05:49:32,810 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 05:49:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:32,813 INFO L225 Difference]: With dead ends: 409 [2022-12-14 05:49:32,813 INFO L226 Difference]: Without dead ends: 409 [2022-12-14 05:49:32,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-12-14 05:49:32,814 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 125 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:32,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 54 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:49:32,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-12-14 05:49:32,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 367. [2022-12-14 05:49:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 3.420765027322404) internal successors, (1252), 366 states have internal predecessors, (1252), 0 states have call successors, (0), 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 05:49:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1252 transitions. [2022-12-14 05:49:32,822 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1252 transitions. Word has length 25 [2022-12-14 05:49:32,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:32,822 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 1252 transitions. [2022-12-14 05:49:32,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:32,822 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1252 transitions. [2022-12-14 05:49:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 05:49:32,823 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:32,823 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] [2022-12-14 05:49:32,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-14 05:49:33,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 05:49:33,024 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:33,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash 415328417, now seen corresponding path program 17 times [2022-12-14 05:49:33,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:33,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224467861] [2022-12-14 05:49:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:33,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:33,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:33,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224467861] [2022-12-14 05:49:33,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224467861] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:33,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237659162] [2022-12-14 05:49:33,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:49:33,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:33,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:33,151 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:33,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 05:49:33,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 05:49:33,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:33,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 05:49:33,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:33,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:33,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237659162] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:33,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1540047739] [2022-12-14 05:49:33,420 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 05:49:33,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:33,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-14 05:49:33,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61147970] [2022-12-14 05:49:33,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:33,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 05:49:33,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:33,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 05:49:33,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-14 05:49:33,422 INFO L87 Difference]: Start difference. First operand 367 states and 1252 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:33,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:33,783 INFO L93 Difference]: Finished difference Result 543 states and 1771 transitions. [2022-12-14 05:49:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 05:49:33,783 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 05:49:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:33,785 INFO L225 Difference]: With dead ends: 543 [2022-12-14 05:49:33,785 INFO L226 Difference]: Without dead ends: 543 [2022-12-14 05:49:33,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=671, Unknown=0, NotChecked=0, Total=930 [2022-12-14 05:49:33,786 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 207 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:33,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 50 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:49:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-12-14 05:49:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 379. [2022-12-14 05:49:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.484126984126984) internal successors, (1317), 378 states have internal predecessors, (1317), 0 states have call successors, (0), 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 05:49:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1317 transitions. [2022-12-14 05:49:33,796 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1317 transitions. Word has length 25 [2022-12-14 05:49:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:33,796 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 1317 transitions. [2022-12-14 05:49:33,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1317 transitions. [2022-12-14 05:49:33,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 05:49:33,797 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:33,797 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] [2022-12-14 05:49:33,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-14 05:49:33,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:33,999 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:34,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1270635071, now seen corresponding path program 18 times [2022-12-14 05:49:34,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:34,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366449492] [2022-12-14 05:49:34,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:34,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:34,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:34,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366449492] [2022-12-14 05:49:34,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366449492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:34,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138208653] [2022-12-14 05:49:34,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:49:34,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:34,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:34,101 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:34,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 05:49:34,167 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:49:34,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:34,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 05:49:34,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:34,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:34,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:34,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138208653] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:34,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [663136819] [2022-12-14 05:49:34,304 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 05:49:34,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:34,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2022-12-14 05:49:34,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603000696] [2022-12-14 05:49:34,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:34,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 05:49:34,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:34,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 05:49:34,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-12-14 05:49:34,306 INFO L87 Difference]: Start difference. First operand 379 states and 1317 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:34,909 INFO L93 Difference]: Finished difference Result 515 states and 1708 transitions. [2022-12-14 05:49:34,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 05:49:34,909 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 05:49:34,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:34,912 INFO L225 Difference]: With dead ends: 515 [2022-12-14 05:49:34,912 INFO L226 Difference]: Without dead ends: 515 [2022-12-14 05:49:34,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 05:49:34,913 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 165 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:34,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 55 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:49:34,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-12-14 05:49:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 357. [2022-12-14 05:49:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 3.393258426966292) internal successors, (1208), 356 states have internal predecessors, (1208), 0 states have call successors, (0), 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 05:49:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1208 transitions. [2022-12-14 05:49:34,920 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1208 transitions. Word has length 25 [2022-12-14 05:49:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:34,920 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 1208 transitions. [2022-12-14 05:49:34,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1208 transitions. [2022-12-14 05:49:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 05:49:34,921 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:34,921 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] [2022-12-14 05:49:34,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 05:49:35,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:35,122 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:35,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:35,123 INFO L85 PathProgramCache]: Analyzing trace with hash -72637417, now seen corresponding path program 19 times [2022-12-14 05:49:35,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:35,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478084901] [2022-12-14 05:49:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:35,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:35,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:35,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478084901] [2022-12-14 05:49:35,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478084901] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:35,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742104783] [2022-12-14 05:49:35,238 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:49:35,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:35,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:35,239 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:35,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 05:49:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:35,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 05:49:35,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:35,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:35,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742104783] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:35,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [66610596] [2022-12-14 05:49:35,466 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 05:49:35,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:35,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-14 05:49:35,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944914330] [2022-12-14 05:49:35,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:35,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 05:49:35,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:35,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 05:49:35,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-14 05:49:35,467 INFO L87 Difference]: Start difference. First operand 357 states and 1208 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:35,878 INFO L93 Difference]: Finished difference Result 691 states and 2287 transitions. [2022-12-14 05:49:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 05:49:35,878 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 05:49:35,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:35,880 INFO L225 Difference]: With dead ends: 691 [2022-12-14 05:49:35,880 INFO L226 Difference]: Without dead ends: 691 [2022-12-14 05:49:35,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=348, Invalid=774, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 05:49:35,881 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 237 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:35,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 55 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:49:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-12-14 05:49:35,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 381. [2022-12-14 05:49:35,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.4894736842105263) internal successors, (1326), 380 states have internal predecessors, (1326), 0 states have call successors, (0), 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 05:49:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1326 transitions. [2022-12-14 05:49:35,889 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1326 transitions. Word has length 25 [2022-12-14 05:49:35,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:35,889 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 1326 transitions. [2022-12-14 05:49:35,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:35,889 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1326 transitions. [2022-12-14 05:49:35,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 05:49:35,890 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:35,890 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] [2022-12-14 05:49:35,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-14 05:49:36,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 05:49:36,091 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:36,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash 782669237, now seen corresponding path program 20 times [2022-12-14 05:49:36,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:36,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453068737] [2022-12-14 05:49:36,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:36,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:36,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:36,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453068737] [2022-12-14 05:49:36,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453068737] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:36,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118859191] [2022-12-14 05:49:36,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:49:36,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:36,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:36,209 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:36,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 05:49:36,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 05:49:36,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:36,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 05:49:36,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:36,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:36,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118859191] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:36,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1393901993] [2022-12-14 05:49:36,491 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 05:49:36,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:36,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-14 05:49:36,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531577445] [2022-12-14 05:49:36,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:36,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 05:49:36,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:36,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 05:49:36,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-12-14 05:49:36,493 INFO L87 Difference]: Start difference. First operand 381 states and 1326 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 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 05:49:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:36,909 INFO L93 Difference]: Finished difference Result 675 states and 2250 transitions. [2022-12-14 05:49:36,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 05:49:36,909 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 05:49:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:36,915 INFO L225 Difference]: With dead ends: 675 [2022-12-14 05:49:36,915 INFO L226 Difference]: Without dead ends: 675 [2022-12-14 05:49:36,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=277, Invalid=715, Unknown=0, NotChecked=0, Total=992 [2022-12-14 05:49:36,916 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 229 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:36,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 37 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:49:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-12-14 05:49:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 369. [2022-12-14 05:49:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 3.426630434782609) internal successors, (1261), 368 states have internal predecessors, (1261), 0 states have call successors, (0), 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 05:49:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1261 transitions. [2022-12-14 05:49:36,923 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1261 transitions. Word has length 25 [2022-12-14 05:49:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:36,923 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 1261 transitions. [2022-12-14 05:49:36,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 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 05:49:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1261 transitions. [2022-12-14 05:49:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 05:49:36,924 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:36,924 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] [2022-12-14 05:49:36,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 05:49:37,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 05:49:37,125 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:37,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1934956329, now seen corresponding path program 21 times [2022-12-14 05:49:37,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:37,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306746876] [2022-12-14 05:49:37,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:37,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:37,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:37,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306746876] [2022-12-14 05:49:37,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306746876] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:37,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294652636] [2022-12-14 05:49:37,243 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:49:37,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:37,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:37,244 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:37,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 05:49:37,314 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:49:37,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:37,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 05:49:37,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:37,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:49:37,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294652636] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:37,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1098381296] [2022-12-14 05:49:37,449 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 05:49:37,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:37,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2022-12-14 05:49:37,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368937171] [2022-12-14 05:49:37,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:37,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 05:49:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:37,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 05:49:37,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-12-14 05:49:37,450 INFO L87 Difference]: Start difference. First operand 369 states and 1261 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:37,931 INFO L93 Difference]: Finished difference Result 471 states and 1553 transitions. [2022-12-14 05:49:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 05:49:37,932 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 05:49:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:37,934 INFO L225 Difference]: With dead ends: 471 [2022-12-14 05:49:37,934 INFO L226 Difference]: Without dead ends: 471 [2022-12-14 05:49:37,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2022-12-14 05:49:37,935 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 168 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:37,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 76 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:49:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-12-14 05:49:37,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 381. [2022-12-14 05:49:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.3947368421052633) internal successors, (1290), 380 states have internal predecessors, (1290), 0 states have call successors, (0), 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 05:49:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1290 transitions. [2022-12-14 05:49:37,945 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1290 transitions. Word has length 25 [2022-12-14 05:49:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:37,945 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 1290 transitions. [2022-12-14 05:49:37,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:49:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1290 transitions. [2022-12-14 05:49:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 05:49:37,946 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:37,947 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] [2022-12-14 05:49:37,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 05:49:38,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:38,148 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2114733559, now seen corresponding path program 22 times [2022-12-14 05:49:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:38,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714318461] [2022-12-14 05:49:38,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:38,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:38,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:38,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714318461] [2022-12-14 05:49:38,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714318461] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:38,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086632553] [2022-12-14 05:49:38,266 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:49:38,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:38,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:38,267 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:38,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 05:49:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:38,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 05:49:38,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:38,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:49:38,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086632553] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:38,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [860361861] [2022-12-14 05:49:38,470 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 05:49:38,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:38,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-14 05:49:38,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633133944] [2022-12-14 05:49:38,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:38,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 05:49:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:38,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 05:49:38,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-12-14 05:49:38,471 INFO L87 Difference]: Start difference. First operand 381 states and 1290 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 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 05:49:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:38,685 INFO L93 Difference]: Finished difference Result 513 states and 1641 transitions. [2022-12-14 05:49:38,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 05:49:38,685 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 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 25 [2022-12-14 05:49:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:38,687 INFO L225 Difference]: With dead ends: 513 [2022-12-14 05:49:38,688 INFO L226 Difference]: Without dead ends: 513 [2022-12-14 05:49:38,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-12-14 05:49:38,688 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 118 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:38,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 35 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:49:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-12-14 05:49:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 357. [2022-12-14 05:49:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 3.3286516853932584) internal successors, (1185), 356 states have internal predecessors, (1185), 0 states have call successors, (0), 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 05:49:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1185 transitions. [2022-12-14 05:49:38,695 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1185 transitions. Word has length 25 [2022-12-14 05:49:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:38,696 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 1185 transitions. [2022-12-14 05:49:38,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 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 05:49:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1185 transitions. [2022-12-14 05:49:38,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 05:49:38,696 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:38,696 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] [2022-12-14 05:49:38,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-14 05:49:38,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 05:49:38,898 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:38,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1738112309, now seen corresponding path program 23 times [2022-12-14 05:49:38,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:38,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600724466] [2022-12-14 05:49:38,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:38,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:40,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:40,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600724466] [2022-12-14 05:49:40,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600724466] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:40,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375929052] [2022-12-14 05:49:40,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:49:40,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:40,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:40,436 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:40,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 05:49:40,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 05:49:40,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:49:40,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 05:49:40,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:40,649 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 13 treesize of output 9 [2022-12-14 05:49:40,700 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 05:49:41,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:41,034 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 97 treesize of output 81 [2022-12-14 05:49:41,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:41,446 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 97 treesize of output 81 [2022-12-14 05:49:41,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:41,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:41,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 108 [2022-12-14 05:49:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:42,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:43,409 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1307 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) c_~A~0.base)) (.cse1 (* ~M~0 4))) (let ((.cse2 (select .cse0 (+ c_~A~0.offset .cse1 4)))) (or (< 0 ~M~0) (< (select .cse0 (+ c_~A~0.offset .cse1)) c_~min2~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse2 c_~min2~0)) (= c_~min1~0 .cse2))))) (forall ((v_ArrVal_1307 (Array Int Int)) (~M~0 Int)) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) c_~A~0.base)) (.cse6 (* ~M~0 4))) (let ((.cse4 (select .cse5 (+ c_~A~0.offset .cse6))) (.cse3 (select .cse5 (+ c_~A~0.offset .cse6 4)))) (or (not (< .cse3 .cse4)) (not (< .cse4 c_~min2~0)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (= c_~min1~0 .cse3))))) (forall ((v_ArrVal_1307 (Array Int Int)) (~M~0 Int)) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) c_~A~0.base)) (.cse9 (* ~M~0 4))) (let ((.cse7 (select .cse8 (+ c_~A~0.offset .cse9)))) (or (not (< .cse7 c_~min2~0)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse8 (+ c_~A~0.offset .cse9 4)) .cse7) (= c_~min1~0 .cse7))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_1307 (Array Int Int)) (~M~0 Int)) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) c_~A~0.base)) (.cse11 (* ~M~0 4))) (or (< (select .cse10 (+ c_~A~0.offset .cse11 4)) c_~min2~0) (< 0 ~M~0) (< (select .cse10 (+ c_~A~0.offset .cse11)) c_~min2~0) (< (+ 2 ~M~0) c_~N~0)))))) is different from false [2022-12-14 05:49:43,526 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) c_~A~0.base)) (.cse3 (* ~M~0 4))) (let ((.cse0 (select .cse2 (+ c_~A~0.offset .cse3))) (.cse1 (select .cse2 (+ c_~A~0.offset .cse3 4)))) (or (not (< .cse0 c_~min2~0)) (< 0 ~M~0) (not (< .cse1 .cse0)) (< (+ 2 ~M~0) c_~N~0) (= c_~min1~0 .cse1))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) c_~A~0.base)) (.cse5 (* ~M~0 4))) (or (< (select .cse4 (+ c_~A~0.offset .cse5)) c_~min2~0) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse4 (+ c_~A~0.offset .cse5 4)) c_~min2~0))))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) c_~A~0.base)) (.cse8 (* ~M~0 4))) (let ((.cse6 (select .cse7 (+ c_~A~0.offset .cse8)))) (or (not (< .cse6 c_~min2~0)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (= c_~min1~0 .cse6) (< (select .cse7 (+ c_~A~0.offset .cse8 4)) .cse6))))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) c_~A~0.base)) (.cse10 (* ~M~0 4))) (let ((.cse11 (select .cse9 (+ c_~A~0.offset .cse10 4)))) (or (< (select .cse9 (+ c_~A~0.offset .cse10)) c_~min2~0) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (= c_~min1~0 .cse11) (not (< .cse11 c_~min2~0))))))) is different from false [2022-12-14 05:49:46,744 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse0 c_~min1~0)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse2 (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse3 (* ~M~0 4))) (let ((.cse1 (select .cse2 (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse1 c_~min2~0)) (< 0 ~M~0) (< (select .cse2 (+ .cse3 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse1) (= .cse0 .cse1) (< (+ 2 ~M~0) c_~N~0))))) (< (select .cse5 .cse6) .cse0)))))) (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse13 .cse6))) (or (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse10 (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse11 (* ~M~0 4))) (let ((.cse9 (select .cse10 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse7 (select .cse10 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse7 c_~min2~0)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (= .cse8 .cse9) (not (< .cse9 .cse7)))))) (not (< .cse8 c_~min1~0)) (< (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))))) (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse19 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse18 (select .cse19 .cse6)) (.cse14 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse14 c_~min1~0)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse15 (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse16 (* ~M~0 4))) (or (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse15 (+ .cse16 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (< (select .cse15 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0)))) (= c_~min2~0 .cse18) (not (< .cse18 .cse14))))))) (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse22 (select (store (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse23 (* ~M~0 4))) (let ((.cse21 (select .cse22 (+ .cse23 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse20 (select .cse22 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse20 c_~min2~0)) (= c_~min1~0 .cse21) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse21 .cse20)))))) (< (select .cse25 .cse6) c_~min1~0) (< (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1305 (Array Int Int)) (~M~0 Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse26 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse27 (select (store (store .cse29 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse28 (* ~M~0 4))) (or (< (select .cse26 .cse6) c_~min1~0) (< (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse27 (+ .cse28 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (< (select .cse27 (+ .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0)))))) (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse30 (select .cse31 .cse6))) (or (not (< .cse30 c_~min1~0)) (< (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse33 (select (store (store .cse35 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse34 (* ~M~0 4))) (let ((.cse32 (select .cse33 (+ .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse32 c_~min2~0)) (= .cse30 .cse32) (< 0 ~M~0) (< (select .cse33 (+ .cse34 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse32) (< (+ 2 ~M~0) c_~N~0)))))))))) (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse38 (select .cse42 .cse6)) (.cse36 (select .cse42 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse36 c_~min1~0)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse39 (select (store (store .cse41 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse40 (* ~M~0 4))) (let ((.cse37 (select .cse39 (+ .cse40 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse37 c_~min2~0)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (= .cse38 .cse37) (< (select .cse39 (+ .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))))) (not (< .cse38 .cse36))))))) (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse43 (select .cse47 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse43 c_~min1~0)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse44 (select (store (store .cse46 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse45 (* ~M~0 4))) (or (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse44 (+ .cse45 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (< (select .cse44 (+ .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0)))) (< (select .cse47 .cse6) .cse43) (= c_~min2~0 .cse43)))))) (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse48 (select .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse48 .cse6) c_~min1~0) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse50 (select (store (store .cse52 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse51 (* ~M~0 4))) (let ((.cse49 (select .cse50 (+ .cse51 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~min1~0 .cse49) (not (< .cse49 c_~min2~0)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse50 (+ .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))))) (< (select .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse60 (select .cse58 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse54 (select .cse60 .cse6)) (.cse59 (select .cse60 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse56 (select (store (store .cse58 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse57 (* ~M~0 4))) (let ((.cse55 (select .cse56 (+ .cse57 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse53 (select .cse56 (+ .cse57 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse53 c_~min2~0)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (= .cse54 .cse55) (not (< .cse55 .cse53)))))) (not (< .cse59 c_~min1~0)) (not (< .cse54 .cse59))))))) (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse62 (select .cse66 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse61 (select .cse62 .cse6))) (or (not (< .cse61 c_~min1~0)) (< (select .cse62 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse64 (select (store (store .cse66 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse65 (* ~M~0 4))) (let ((.cse63 (select .cse64 (+ .cse65 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse63 c_~min2~0)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (= .cse61 .cse63) (< (select .cse64 (+ .cse65 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0)))))))))) (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse68 (select .cse71 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse67 (select .cse68 .cse6))) (or (not (< .cse67 c_~min1~0)) (< (select .cse68 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse69 (select (store (store .cse71 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse70 (* ~M~0 4))) (or (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse69 (+ .cse70 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (< (select .cse69 (+ .cse70 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0)))) (= c_~min2~0 .cse67)))))) (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse73 (select .cse78 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse72 (select .cse73 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse72 c_~min1~0)) (< (select .cse73 .cse6) .cse72) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse76 (select (store (store .cse78 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse77 (* ~M~0 4))) (let ((.cse75 (select .cse76 (+ .cse77 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse74 (select .cse76 (+ .cse77 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse74 c_~min2~0)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (= .cse72 .cse75) (not (< .cse75 .cse74))))))))))) (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse80 (select .cse84 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse79 (select .cse80 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse79 c_~min1~0)) (< (select .cse80 .cse6) .cse79) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse82 (select (store (store .cse84 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse83 (* ~M~0 4))) (let ((.cse81 (select .cse82 (+ .cse83 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse81 c_~min2~0)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (= .cse79 .cse81) (< (select .cse82 (+ .cse83 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0)))))))))) (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse89 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse85 (select .cse89 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse85 .cse6) c_~min1~0) (< (select .cse85 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse87 (select (store (store .cse89 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse88 (* ~M~0 4))) (let ((.cse86 (select .cse87 (+ .cse88 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse86 c_~min2~0)) (< 0 ~M~0) (< (select .cse87 (+ .cse88 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse86) (< (+ 2 ~M~0) c_~N~0) (= c_~min1~0 .cse86))))))))) (forall ((v_ArrVal_1305 (Array Int Int))) (let ((.cse95 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1305))) (let ((.cse96 (select .cse95 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse92 (select .cse96 .cse6)) (.cse90 (select .cse96 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse90 c_~min1~0)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (~M~0 Int)) (let ((.cse93 (select (store (store .cse95 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse94 (* ~M~0 4))) (let ((.cse91 (select .cse93 (+ .cse94 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse91 c_~min2~0)) (= .cse92 .cse91) (< 0 ~M~0) (< (select .cse93 (+ .cse94 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse91) (< (+ 2 ~M~0) c_~N~0))))) (not (< .cse92 .cse90))))))))) is different from false [2022-12-14 05:49:46,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:46,927 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 146 treesize of output 98 [2022-12-14 05:49:46,963 INFO L321 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2022-12-14 05:49:46,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1959 treesize of output 1877 [2022-12-14 05:49:46,992 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 1809 treesize of output 1489 [2022-12-14 05:49:47,047 INFO L321 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2022-12-14 05:49:47,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1509 treesize of output 1455 [2022-12-14 05:49:47,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:47,084 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 1409 treesize of output 1249 [2022-12-14 05:49:51,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:51,002 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 157 treesize of output 97 [2022-12-14 05:49:51,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:49:51,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:49:51,035 INFO L321 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2022-12-14 05:49:51,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 139 [2022-12-14 05:49:51,073 INFO L321 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2022-12-14 05:49:51,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 90 [2022-12-14 05:49:51,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:51,307 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 213 treesize of output 129 [2022-12-14 05:49:51,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:49:51,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:49:51,333 INFO L321 Elim1Store]: treesize reduction 33, result has 23.3 percent of original size [2022-12-14 05:49:51,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 160 [2022-12-14 05:49:51,352 INFO L321 Elim1Store]: treesize reduction 39, result has 9.3 percent of original size [2022-12-14 05:49:51,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 135 treesize of output 96 [2022-12-14 05:49:51,408 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 05:49:51,408 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 218 treesize of output 1 [2022-12-14 05:49:51,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:51,417 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 154 treesize of output 94 [2022-12-14 05:49:51,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:49:51,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:49:51,441 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-14 05:49:51,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 137 treesize of output 110 [2022-12-14 05:49:51,464 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-14 05:49:51,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 55 [2022-12-14 05:49:51,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:51,509 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 112 treesize of output 76 [2022-12-14 05:49:51,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:49:51,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:49:51,532 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-14 05:49:51,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 88 [2022-12-14 05:49:51,562 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-14 05:49:51,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 37 [2022-12-14 05:49:51,582 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 05:49:51,582 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 198 treesize of output 1 [2022-12-14 05:49:51,591 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 05:49:51,592 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 185 treesize of output 1 [2022-12-14 05:49:51,601 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 05:49:51,601 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 174 treesize of output 1 [2022-12-14 05:49:51,610 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 05:49:51,611 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 216 treesize of output 1 [2022-12-14 05:49:51,620 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 05:49:51,620 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 168 treesize of output 1 [2022-12-14 05:49:51,629 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 05:49:51,630 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 215 treesize of output 1 [2022-12-14 05:49:51,639 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 05:49:51,639 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 137 treesize of output 1 [2022-12-14 05:49:51,648 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 05:49:51,648 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 188 treesize of output 1 [2022-12-14 05:49:51,657 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 05:49:51,657 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 196 treesize of output 1 [2022-12-14 05:49:51,666 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 05:49:51,666 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 176 treesize of output 1 [2022-12-14 05:49:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-14 05:49:51,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375929052] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:51,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [540239149] [2022-12-14 05:49:51,835 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 05:49:51,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:51,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2022-12-14 05:49:51,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830353847] [2022-12-14 05:49:51,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:49:51,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-14 05:49:51,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:51,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-14 05:49:51,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1544, Unknown=12, NotChecked=246, Total=1980 [2022-12-14 05:49:51,837 INFO L87 Difference]: Start difference. First operand 357 states and 1185 transitions. Second operand has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 44 states have internal predecessors, (71), 0 states have call successors, (0), 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 05:49:57,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:57,146 INFO L93 Difference]: Finished difference Result 735 states and 2287 transitions. [2022-12-14 05:49:57,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 05:49:57,147 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 44 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 05:49:57,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:57,148 INFO L225 Difference]: With dead ends: 735 [2022-12-14 05:49:57,148 INFO L226 Difference]: Without dead ends: 721 [2022-12-14 05:49:57,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=357, Invalid=2723, Unknown=12, NotChecked=330, Total=3422 [2022-12-14 05:49:57,149 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 335 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 43 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:57,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 160 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1939 Invalid, 2 Unknown, 327 Unchecked, 3.1s Time] [2022-12-14 05:49:57,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-12-14 05:49:57,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 411. [2022-12-14 05:49:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 3.292682926829268) internal successors, (1350), 410 states have internal predecessors, (1350), 0 states have call successors, (0), 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 05:49:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1350 transitions. [2022-12-14 05:49:57,158 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1350 transitions. Word has length 26 [2022-12-14 05:49:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:57,158 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 1350 transitions. [2022-12-14 05:49:57,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 44 states have internal predecessors, (71), 0 states have call successors, (0), 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 05:49:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1350 transitions. [2022-12-14 05:49:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 05:49:57,159 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:57,159 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] [2022-12-14 05:49:57,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-14 05:49:57,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 05:49:57,360 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 05:49:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:57,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1165275833, now seen corresponding path program 4 times [2022-12-14 05:49:57,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:57,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471779093] [2022-12-14 05:49:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:57,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:58,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:58,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471779093] [2022-12-14 05:49:58,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471779093] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:58,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46646956] [2022-12-14 05:49:58,362 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:49:58,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:58,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:58,362 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:58,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_833c1028-651b-4551-87ac-53b822d464de/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 05:49:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:58,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 05:49:58,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:58,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:58,847 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 105 treesize of output 87 [2022-12-14 05:49:59,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:59,068 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 105 treesize of output 87 [2022-12-14 05:49:59,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:49:59,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:59,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:49:59,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 81 [2022-12-14 05:49:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:59,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:50:00,221 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_thread2Thread1of1ForFork0_~i~1 1)) (.cse1 (+ (* c_thread2Thread1of1ForFork0_~i~1 4) c_~A~0.offset))) (and (forall ((v_ArrVal_1357 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1357) c_~A~0.base))) (or (< (select .cse0 .cse1) c_~min2~0) (forall ((~M~0 Int)) (let ((.cse3 (select .cse0 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse2 ~M~0) (= c_~min1~0 .cse3) (not (< .cse3 c_~min2~0)))))))) (forall ((v_ArrVal_1357 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1357) c_~A~0.base))) (let ((.cse4 (select .cse6 .cse1))) (or (not (< .cse4 c_~min2~0)) (forall ((~M~0 Int)) (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse2 ~M~0) (= c_~min1~0 .cse5) (not (< .cse5 .cse4))))))))) (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_1357 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1357) c_~A~0.base))) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse2 ~M~0) (< (select .cse7 (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0) (< (select .cse7 .cse1) c_~min2~0))))) (forall ((v_ArrVal_1357 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1357) c_~A~0.base))) (let ((.cse9 (select .cse8 .cse1))) (or (forall ((~M~0 Int)) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse2 ~M~0) (< (select .cse8 (+ c_~A~0.offset (* ~M~0 4))) .cse9))) (= c_~min1~0 .cse9) (not (< .cse9 c_~min2~0)))))))) is different from false [2022-12-14 05:50:00,277 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1357 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1357) c_~A~0.base))) (let ((.cse1 (select .cse2 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse0 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (= c_~min1~0 .cse0) (not (< .cse0 .cse1)) (< 1 ~M~0)))) (not (< .cse1 c_~min2~0)))))) (forall ((v_ArrVal_1357 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1357) c_~A~0.base))) (or (< (select .cse3 c_~A~0.offset) c_~min2~0) (forall ((~M~0 Int)) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (= c_~min1~0 .cse4) (not (< .cse4 c_~min2~0)) (< 1 ~M~0))))))) (forall ((v_ArrVal_1357 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1357) c_~A~0.base))) (let ((.cse6 (select .cse5 c_~A~0.offset))) (or (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (< (select .cse5 (+ c_~A~0.offset (* ~M~0 4))) .cse6) (< 1 ~M~0))) (not (< .cse6 c_~min2~0)) (= c_~min1~0 .cse6))))) (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_1357 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1357) c_~A~0.base))) (or (not (< 0 ~M~0)) (< (select .cse7 c_~A~0.offset) c_~min2~0) (< (select .cse7 (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0) (< 1 ~M~0)))))) is different from false [2022-12-14 05:50:00,381 WARN L837 $PredicateComparison]: unable to prove that (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_1357 (Array Int Int)) (~M~0 Int) (v_ArrVal_1356 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1357) c_~A~0.base))) (or (< (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0) (< (select .cse0 c_~A~0.offset) c_~min2~0) (not (< 0 ~M~0)) (< 1 ~M~0))))) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1356 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1357) c_~A~0.base))) (let ((.cse1 (select .cse3 c_~A~0.offset))) (or (not (< .cse1 c_~min2~0)) (forall ((~M~0 Int)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse2) (not (< 0 ~M~0)) (not (< .cse2 .cse1)) (< 1 ~M~0)))))))) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1356 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1357) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse4 (select .cse5 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse4) (not (< .cse4 c_~min2~0)) (not (< 0 ~M~0)) (< 1 ~M~0)))) (< (select .cse5 c_~A~0.offset) c_~min2~0)))) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1356 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1357) c_~A~0.base))) (let ((.cse7 (select .cse6 c_~A~0.offset))) (or (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (< (select .cse6 (+ c_~A~0.offset (* ~M~0 4))) .cse7) (< 1 ~M~0))) (not (< .cse7 c_~min2~0)) (= c_~min1~0 .cse7)))))) is different from false [2022-12-14 05:50:01,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:01,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 2508 treesize of output 2731 [2022-12-14 05:50:01,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:01,956 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 2062 treesize of output 2045 [2022-12-14 05:50:02,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:02,074 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 2034 treesize of output 2031 [2022-12-14 05:50:02,198 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:02,198 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 2020 treesize of output 2015 [2022-12-14 05:50:02,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:02,327 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 2004 treesize of output 1983 [2022-12-14 05:50:02,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:02,454 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 1972 treesize of output 1951 [2022-12-14 05:50:02,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:02,577 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 1940 treesize of output 1935 [2022-12-14 05:50:02,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:02,705 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 1924 treesize of output 1911 [2022-12-14 05:50:02,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:02,835 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 1900 treesize of output 1863 [2022-12-14 05:50:02,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:02,969 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 1852 treesize of output 1799 [2022-12-14 05:50:03,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:03,108 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 1788 treesize of output 1767 [2022-12-14 05:50:03,245 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:03,246 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 1756 treesize of output 1739 [2022-12-14 05:50:03,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:03,386 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 1728 treesize of output 1683 [2022-12-14 05:50:03,524 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:03,525 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 1672 treesize of output 1667 [2022-12-14 05:50:03,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:03,663 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 1656 treesize of output 1659 [2022-12-14 05:50:03,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:03,807 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 1648 treesize of output 1635 [2022-12-14 05:50:03,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:50:03,968 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 1624 treesize of output 1623 [2022-12-14 05:52:47,543 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 05:52:57,488 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 05:53:46,352 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 05:54:00,950 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 05:55:22,929 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 05:55:40,570 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 05:56:13,459 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 05:56:31,041 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 05:56:48,154 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 05:57:15,943 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 05:57:45,886 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 05:58:14,343 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 05:59:00,327 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 05:59:22,228 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 05:59:39,146 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 06:00:09,984 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 06:00:44,604 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 06:01:17,212 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 06:02:02,131 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 06:02:29,620 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 06:02:43,455 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts.