./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS --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 ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 --- 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-8393723 [2022-11-19 07:09:17,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:09:17,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:09:17,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:09:17,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:09:17,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:09:17,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:09:17,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:09:17,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:09:17,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:09:17,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:09:17,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:09:17,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:09:17,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:09:17,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:09:17,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:09:17,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:09:17,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:09:17,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:09:17,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:09:17,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:09:17,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:09:17,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:09:17,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:09:17,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:09:17,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:09:17,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:09:17,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:09:17,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:09:17,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:09:17,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:09:17,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:09:17,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:09:17,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:09:17,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:09:17,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:09:17,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:09:17,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:09:17,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:09:17,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:09:17,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:09:17,875 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:09:17,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:09:17,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:09:17,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:09:17,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:09:17,922 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:09:17,922 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:09:17,922 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:09:17,922 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:09:17,923 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:09:17,923 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:09:17,924 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:09:17,924 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:09:17,924 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:09:17,924 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:09:17,925 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:09:17,925 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:09:17,925 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:09:17,925 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:09:17,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:09:17,926 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:09:17,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:09:17,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:09:17,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:09:17,928 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:09:17,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:09:17,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:09:17,929 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:09:17,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:09:17,929 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:09:17,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:09:17,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:09:17,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:09:17,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:09:17,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:09:17,930 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:09:17,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:09:17,931 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:09:17,931 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:09:17,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:09:17,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:09:17,933 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:09:17,933 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_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/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_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS 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 -> ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 [2022-11-19 07:09:18,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:09:18,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:09:18,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:09:18,237 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:09:18,237 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:09:18,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2022-11-19 07:09:18,328 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/data/d668cd710/ae2d3e46c3e94a39990fa0b4e5949b27/FLAG212662dd5 [2022-11-19 07:09:18,848 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:09:18,848 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2022-11-19 07:09:18,856 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/data/d668cd710/ae2d3e46c3e94a39990fa0b4e5949b27/FLAG212662dd5 [2022-11-19 07:09:19,233 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/data/d668cd710/ae2d3e46c3e94a39990fa0b4e5949b27 [2022-11-19 07:09:19,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:09:19,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:09:19,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:09:19,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:09:19,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:09:19,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:09:19" (1/1) ... [2022-11-19 07:09:19,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@162acaf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:19, skipping insertion in model container [2022-11-19 07:09:19,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:09:19" (1/1) ... [2022-11-19 07:09:19,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:09:19,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:09:19,526 WARN L234 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_c348431b-d1cf-4710-874c-306713b0ff67/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2022-11-19 07:09:19,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:09:19,544 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:09:19,565 WARN L234 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_c348431b-d1cf-4710-874c-306713b0ff67/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2022-11-19 07:09:19,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:09:19,584 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:09:19,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:19 WrapperNode [2022-11-19 07:09:19,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:09:19,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:09:19,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:09:19,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:09:19,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:19" (1/1) ... [2022-11-19 07:09:19,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:19" (1/1) ... [2022-11-19 07:09:19,624 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-11-19 07:09:19,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:09:19,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:09:19,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:09:19,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:09:19,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:19" (1/1) ... [2022-11-19 07:09:19,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:19" (1/1) ... [2022-11-19 07:09:19,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:19" (1/1) ... [2022-11-19 07:09:19,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:19" (1/1) ... [2022-11-19 07:09:19,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:19" (1/1) ... [2022-11-19 07:09:19,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:19" (1/1) ... [2022-11-19 07:09:19,651 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:19" (1/1) ... [2022-11-19 07:09:19,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:19" (1/1) ... [2022-11-19 07:09:19,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:09:19,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:09:19,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:09:19,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:09:19,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:19" (1/1) ... [2022-11-19 07:09:19,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:09:19,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:09:19,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:09:19,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:09:19,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:09:19,730 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-19 07:09:19,730 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-19 07:09:19,730 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-19 07:09:19,731 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-19 07:09:19,731 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-19 07:09:19,731 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-19 07:09:19,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:09:19,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:09:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:09:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:09:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:09:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 07:09:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:09:19,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:09:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 07:09:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:09:19,734 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:09:19,860 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:09:19,863 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:09:20,258 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:09:20,324 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:09:20,325 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-19 07:09:20,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:09:20 BoogieIcfgContainer [2022-11-19 07:09:20,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:09:20,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:09:20,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:09:20,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:09:20,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:09:19" (1/3) ... [2022-11-19 07:09:20,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4f80cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:09:20, skipping insertion in model container [2022-11-19 07:09:20,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:19" (2/3) ... [2022-11-19 07:09:20,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4f80cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:09:20, skipping insertion in model container [2022-11-19 07:09:20,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:09:20" (3/3) ... [2022-11-19 07:09:20,349 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-11-19 07:09:20,358 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 07:09:20,371 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:09:20,371 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 07:09:20,371 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:09:20,516 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-19 07:09:20,552 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:09:20,567 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 154 transitions, 332 flow [2022-11-19 07:09:20,570 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 154 transitions, 332 flow [2022-11-19 07:09:20,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 154 transitions, 332 flow [2022-11-19 07:09:20,684 INFO L130 PetriNetUnfolder]: 12/151 cut-off events. [2022-11-19 07:09:20,684 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-19 07:09:20,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 151 events. 12/151 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-11-19 07:09:20,695 INFO L119 LiptonReduction]: Number of co-enabled transitions 1320 [2022-11-19 07:09:27,602 INFO L134 LiptonReduction]: Checked pairs total: 1541 [2022-11-19 07:09:27,602 INFO L136 LiptonReduction]: Total number of compositions: 148 [2022-11-19 07:09:27,611 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 80 flow [2022-11-19 07:09:27,638 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-11-19 07:09:27,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:09:27,663 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;@5da139c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:09:27,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-19 07:09:27,666 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-11-19 07:09:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 07:09:27,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:09:27,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] [2022-11-19 07:09:27,677 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-11-19 07:09:27,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:09:27,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1055041608, now seen corresponding path program 1 times [2022-11-19 07:09:27,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:09:27,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277228998] [2022-11-19 07:09:27,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:09:27,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:09:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:09:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:09:28,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:09:28,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277228998] [2022-11-19 07:09:28,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277228998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:09:28,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:09:28,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:09:28,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506996976] [2022-11-19 07:09:28,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:09:28,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:09:28,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:09:28,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:09:28,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:09:28,574 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, 2 states have (on average 10.0) 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-11-19 07:09:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:09:28,707 INFO L93 Difference]: Finished difference Result 204 states and 632 transitions. [2022-11-19 07:09:28,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:09:28,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) 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-11-19 07:09:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:09:28,736 INFO L225 Difference]: With dead ends: 204 [2022-11-19 07:09:28,736 INFO L226 Difference]: Without dead ends: 197 [2022-11-19 07:09:28,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11-19 07:09:28,742 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:09:28,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:09:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-19 07:09:28,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-11-19 07:09:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 3.13265306122449) internal successors, (614), 196 states have internal predecessors, (614), 0 states have call successors, (0), 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-11-19 07:09:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 614 transitions. [2022-11-19 07:09:28,824 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 614 transitions. Word has length 20 [2022-11-19 07:09:28,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:09:28,826 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 614 transitions. [2022-11-19 07:09:28,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) 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-11-19 07:09:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 614 transitions. [2022-11-19 07:09:28,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:09:28,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:09:28,843 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-11-19 07:09:28,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:09:28,844 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-11-19 07:09:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:09:28,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1532028833, now seen corresponding path program 1 times [2022-11-19 07:09:28,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:09:28,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067939313] [2022-11-19 07:09:28,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:09:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:09:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:09:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:09:29,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:09:29,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067939313] [2022-11-19 07:09:29,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067939313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:09:29,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:09:29,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:09:29,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767898098] [2022-11-19 07:09:29,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:09:29,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:09:29,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:09:29,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:09:29,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:09:29,374 INFO L87 Difference]: Start difference. First operand 197 states and 614 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-11-19 07:09:29,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:09:29,489 INFO L93 Difference]: Finished difference Result 198 states and 615 transitions. [2022-11-19 07:09:29,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:09:29,490 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-11-19 07:09:29,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:09:29,493 INFO L225 Difference]: With dead ends: 198 [2022-11-19 07:09:29,493 INFO L226 Difference]: Without dead ends: 198 [2022-11-19 07:09:29,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:09:29,496 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:09:29,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:09:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-19 07:09:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-11-19 07:09:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 3.1218274111675126) internal successors, (615), 197 states have internal predecessors, (615), 0 states have call successors, (0), 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-11-19 07:09:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 615 transitions. [2022-11-19 07:09:29,528 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 615 transitions. Word has length 21 [2022-11-19 07:09:29,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:09:29,528 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 615 transitions. [2022-11-19 07:09:29,528 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-11-19 07:09:29,528 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 615 transitions. [2022-11-19 07:09:29,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:09:29,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:09:29,530 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-11-19 07:09:29,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:09:29,530 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-11-19 07:09:29,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:09:29,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1924133900, now seen corresponding path program 1 times [2022-11-19 07:09:29,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:09:29,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949117199] [2022-11-19 07:09:29,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:09:29,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:09:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:09:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:09:29,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:09:29,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949117199] [2022-11-19 07:09:29,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949117199] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:09:29,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613955185] [2022-11-19 07:09:29,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:09:29,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:09:29,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:09:29,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:09:29,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:09:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:09:29,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:09:29,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:09:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:09:29,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:09:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:09:29,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613955185] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-19 07:09:29,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:09:29,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-11-19 07:09:29,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085948122] [2022-11-19 07:09:29,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:09:29,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:09:29,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:09:29,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:09:29,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:09:29,906 INFO L87 Difference]: Start difference. First operand 198 states and 615 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-11-19 07:09:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:09:29,988 INFO L93 Difference]: Finished difference Result 174 states and 549 transitions. [2022-11-19 07:09:29,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:09:29,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-11-19 07:09:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:09:29,991 INFO L225 Difference]: With dead ends: 174 [2022-11-19 07:09:29,991 INFO L226 Difference]: Without dead ends: 174 [2022-11-19 07:09:29,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:09:29,992 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 50 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:09:29,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 7 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:09:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-19 07:09:29,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 134. [2022-11-19 07:09:30,000 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-11-19 07:09:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 413 transitions. [2022-11-19 07:09:30,002 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 413 transitions. Word has length 22 [2022-11-19 07:09:30,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:09:30,002 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 413 transitions. [2022-11-19 07:09:30,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-11-19 07:09:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 413 transitions. [2022-11-19 07:09:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:09:30,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:09:30,004 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-11-19 07:09:30,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-19 07:09:30,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:09:30,210 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-11-19 07:09:30,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:09:30,211 INFO L85 PathProgramCache]: Analyzing trace with hash -570695373, now seen corresponding path program 1 times [2022-11-19 07:09:30,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:09:30,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622416719] [2022-11-19 07:09:30,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:09:30,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:09:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:09:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:09:30,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:09:30,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622416719] [2022-11-19 07:09:30,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622416719] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:09:30,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80388256] [2022-11-19 07:09:30,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:09:30,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:09:30,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:09:30,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:09:30,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:09:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:09:30,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 07:09:30,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:09:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:09:30,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:09:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:09:30,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80388256] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-19 07:09:30,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:09:30,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2022-11-19 07:09:30,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454975821] [2022-11-19 07:09:30,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:09:30,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:09:30,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:09:30,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:09:30,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-19 07:09:30,757 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-11-19 07:09:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:09:30,989 INFO L93 Difference]: Finished difference Result 166 states and 519 transitions. [2022-11-19 07:09:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:09:30,990 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-11-19 07:09:30,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:09:30,991 INFO L225 Difference]: With dead ends: 166 [2022-11-19 07:09:30,992 INFO L226 Difference]: Without dead ends: 166 [2022-11-19 07:09:30,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-11-19 07:09:30,993 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 66 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:09:30,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 11 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:09:30,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-19 07:09:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-11-19 07:09:31,000 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-11-19 07:09:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 519 transitions. [2022-11-19 07:09:31,002 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 519 transitions. Word has length 22 [2022-11-19 07:09:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:09:31,002 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 519 transitions. [2022-11-19 07:09:31,002 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-11-19 07:09:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 519 transitions. [2022-11-19 07:09:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:09:31,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:09:31,003 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-11-19 07:09:31,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 07:09:31,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:09:31,209 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-11-19 07:09:31,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:09:31,210 INFO L85 PathProgramCache]: Analyzing trace with hash -294060223, now seen corresponding path program 1 times [2022-11-19 07:09:31,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:09:31,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013847816] [2022-11-19 07:09:31,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:09:31,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:09:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:09:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:09:32,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:09:32,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013847816] [2022-11-19 07:09:32,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013847816] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:09:32,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748972844] [2022-11-19 07:09:32,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:09:32,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:09:32,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:09:32,347 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:09:32,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:09:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:09:32,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-19 07:09:32,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:09:33,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:09:33,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:09:33,055 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 66 treesize of output 39 [2022-11-19 07:09:33,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:09:33,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:09:33,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:09:33,667 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 127 treesize of output 75 [2022-11-19 07:09:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:09:34,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748972844] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:09:34,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1181245070] [2022-11-19 07:09:34,118 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:09:34,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:09:34,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2022-11-19 07:09:34,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582355496] [2022-11-19 07:09:34,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:09:34,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-19 07:09:34,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:09:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-19 07:09:34,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2022-11-19 07:09:34,127 INFO L87 Difference]: Start difference. First operand 166 states and 519 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:09:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:09:35,995 INFO L93 Difference]: Finished difference Result 420 states and 1260 transitions. [2022-11-19 07:09:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-19 07:09:35,996 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:09:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:09:35,999 INFO L225 Difference]: With dead ends: 420 [2022-11-19 07:09:35,999 INFO L226 Difference]: Without dead ends: 406 [2022-11-19 07:09:36,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=313, Invalid=1327, Unknown=0, NotChecked=0, Total=1640 [2022-11-19 07:09:36,001 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 236 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-19 07:09:36,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 82 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-19 07:09:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-11-19 07:09:36,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 280. [2022-11-19 07:09:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 3.182795698924731) internal successors, (888), 279 states have internal predecessors, (888), 0 states have call successors, (0), 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-11-19 07:09:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 888 transitions. [2022-11-19 07:09:36,015 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 888 transitions. Word has length 23 [2022-11-19 07:09:36,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:09:36,016 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 888 transitions. [2022-11-19 07:09:36,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:09:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 888 transitions. [2022-11-19 07:09:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:09:36,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:09:36,018 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-11-19 07:09:36,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-19 07:09:36,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:09:36,223 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-11-19 07:09:36,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:09:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash 360280049, now seen corresponding path program 2 times [2022-11-19 07:09:36,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:09:36,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412323949] [2022-11-19 07:09:36,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:09:36,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:09:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:09:37,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-11-19 07:09:37,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:09:37,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412323949] [2022-11-19 07:09:37,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412323949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:09:37,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699468846] [2022-11-19 07:09:37,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:09:37,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:09:37,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:09:37,368 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:09:37,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:09:37,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 07:09:37,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:09:37,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-19 07:09:37,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:09:38,022 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:09:38,024 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 75 treesize of output 65 [2022-11-19 07:09:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:09:38,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:09:38,494 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:09:38,494 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 119 treesize of output 75 [2022-11-19 07:09:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:09:39,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699468846] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:09:39,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2008231099] [2022-11-19 07:09:39,013 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:09:39,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:09:39,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-11-19 07:09:39,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942876297] [2022-11-19 07:09:39,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:09:39,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-19 07:09:39,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:09:39,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-19 07:09:39,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2022-11-19 07:09:39,017 INFO L87 Difference]: Start difference. First operand 280 states and 888 transitions. Second operand has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:09:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:09:39,628 INFO L93 Difference]: Finished difference Result 367 states and 1160 transitions. [2022-11-19 07:09:39,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:09:39,629 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:09:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:09:39,631 INFO L225 Difference]: With dead ends: 367 [2022-11-19 07:09:39,632 INFO L226 Difference]: Without dead ends: 360 [2022-11-19 07:09:39,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2022-11-19 07:09:39,633 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 113 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:09:39,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 52 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 368 Invalid, 0 Unknown, 78 Unchecked, 0.3s Time] [2022-11-19 07:09:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-11-19 07:09:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 306. [2022-11-19 07:09:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.1704918032786886) internal successors, (967), 305 states have internal predecessors, (967), 0 states have call successors, (0), 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-11-19 07:09:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 967 transitions. [2022-11-19 07:09:39,649 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 967 transitions. Word has length 23 [2022-11-19 07:09:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:09:39,649 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 967 transitions. [2022-11-19 07:09:39,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:09:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 967 transitions. [2022-11-19 07:09:39,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:09:39,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:09:39,651 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-11-19 07:09:39,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:09:39,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-19 07:09:39,860 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-11-19 07:09:39,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:09:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1459008271, now seen corresponding path program 3 times [2022-11-19 07:09:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:09:39,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550473157] [2022-11-19 07:09:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:09:39,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:09:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:09:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:09:40,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:09:40,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550473157] [2022-11-19 07:09:40,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550473157] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:09:40,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596663499] [2022-11-19 07:09:40,790 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:09:40,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:09:40,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:09:40,791 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:09:40,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 07:09:40,928 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:09:40,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:09:40,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-19 07:09:40,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:09:41,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:09:41,086 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-11-19 07:09:41,163 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-11-19 07:09:41,348 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-11-19 07:09:41,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:09:41,569 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 66 treesize of output 46 [2022-11-19 07:09:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:09:41,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:09:45,479 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_~min2~0 c_~min1~0)) (.cse12 (< c_~min3~0 c_~min2~0))) (and (forall ((~M~0 Int) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base))) (let ((.cse1 (select .cse0 (+ c_~A~0.offset (* ~M~0 4))))) (or (< (select .cse0 c_~A~0.offset) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (<= c_~min2~0 .cse1) (= c_~min1~0 .cse1) (not (< .cse1 c_~min3~0)))))) (forall ((~M~0 Int) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base))) (let ((.cse2 (select .cse3 c_~A~0.offset))) (or (= .cse2 c_~min3~0) (not (< .cse2 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (< (select .cse3 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0))))) (or .cse4 (forall ((~M~0 Int) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base))) (let ((.cse6 (select .cse5 (+ c_~A~0.offset (* ~M~0 4))))) (or (< (select .cse5 c_~A~0.offset) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (< .cse6 c_~min2~0) (not (< .cse6 c_~min3~0))))))) (forall ((~M~0 Int) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base))) (let ((.cse7 (select .cse9 c_~A~0.offset)) (.cse8 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse7 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (= c_~min2~0 .cse7) (< .cse8 c_~min2~0) (not (< .cse8 c_~min3~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base))) (let ((.cse10 (select .cse11 c_~A~0.offset))) (or (not (< .cse10 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (= c_~min2~0 .cse10) (< (select .cse11 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0))))) .cse12) (or (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse4 .cse12)) (forall ((~M~0 Int) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base))) (or (< (select .cse13 c_~A~0.offset) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (< (select .cse13 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0))))))) is different from false [2022-11-19 07:09:45,818 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~min3~0 c_~min2~0)) (.cse11 (= c_~min2~0 c_~min1~0))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse1 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (= c_~min2~0 .cse2) (< 0 ~M~0) (< ~M~0 0) (not (< .cse2 c_~min1~0))))))) (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse4 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse3 c_~min3~0)) (= c_~min1~0 .cse3) (< 0 ~M~0) (<= c_~min2~0 .cse3) (< (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< ~M~0 0))))) (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse5 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< 0 ~M~0) (= .cse6 c_~min3~0) (< ~M~0 0) (not (< .cse6 c_~min1~0)))))) (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (select .cse9 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse7 c_~min3~0)) (= c_~min2~0 .cse8) (< 0 ~M~0) (< ~M~0 0) (not (< .cse8 c_~min1~0)) (< .cse7 c_~min2~0))))) (or (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse10 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< 0 ~M~0) (< (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< ~M~0 0)))) (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse11 .cse0))) (or .cse11 (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse13 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse12 c_~min3~0)) (< 0 ~M~0) (< (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< ~M~0 0) (< .cse12 c_~min2~0)))))))) is different from false [2022-11-19 07:09:45,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:09:45,896 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 94 treesize of output 70 [2022-11-19 07:09:45,912 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:09:45,913 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 845 treesize of output 809 [2022-11-19 07:09:45,945 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:09:45,946 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 805 treesize of output 697 [2022-11-19 07:09:45,977 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:09:45,977 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 693 treesize of output 641 [2022-11-19 07:09:46,010 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:09:46,011 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 439 treesize of output 415 [2022-11-19 07:09:50,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:09:50,352 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 90 treesize of output 66 [2022-11-19 07:09:50,373 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:09:50,373 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 1593 treesize of output 1533 [2022-11-19 07:09:50,417 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:09:50,417 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 1529 treesize of output 1453 [2022-11-19 07:09:50,460 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:09:50,461 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 1449 treesize of output 1293 [2022-11-19 07:09:50,506 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:09:50,507 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 885 treesize of output 849 [2022-11-19 07:10:59,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:10:59,902 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 90 treesize of output 66 [2022-11-19 07:10:59,938 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:10:59,939 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 3217 treesize of output 3093 [2022-11-19 07:10:59,995 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:10:59,996 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 3089 treesize of output 2933 [2022-11-19 07:11:00,067 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:11:00,068 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 2929 treesize of output 2853 [2022-11-19 07:11:00,133 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:11:00,134 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 2849 treesize of output 2533 [2022-11-19 07:14:47,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:14:47,553 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 123 treesize of output 87 [2022-11-19 07:14:47,574 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:14:47,575 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 527 treesize of output 507 [2022-11-19 07:14:47,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:47,603 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 385 treesize of output 369 [2022-11-19 07:14:47,624 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:14:47,624 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 487 treesize of output 427 [2022-11-19 07:14:47,660 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:14:47,660 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 423 treesize of output 395 [2022-11-19 07:14:48,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:14:48,795 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 61 treesize of output 49 [2022-11-19 07:14:48,820 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:14:48,821 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 2187 treesize of output 2095 [2022-11-19 07:14:48,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:48,877 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 1047 treesize of output 983 [2022-11-19 07:14:48,908 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:14:48,908 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 2027 treesize of output 1903 [2022-11-19 07:14:48,949 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:14:48,949 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 1899 treesize of output 1647 [2022-11-19 07:17:01,869 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-19 07:17:01,869 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 126 treesize of output 1 [2022-11-19 07:17:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-19 07:17:01,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596663499] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:17:01,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1278822835] [2022-11-19 07:17:01,895 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:17:01,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:17:01,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 33 [2022-11-19 07:17:01,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333874902] [2022-11-19 07:17:01,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:17:01,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 07:17:01,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:17:01,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 07:17:01,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=852, Unknown=6, NotChecked=126, Total=1190 [2022-11-19 07:17:01,899 INFO L87 Difference]: Start difference. First operand 306 states and 967 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:17:05,840 INFO L93 Difference]: Finished difference Result 456 states and 1315 transitions. [2022-11-19 07:17:05,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-19 07:17:05,841 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:17:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:17:05,844 INFO L225 Difference]: With dead ends: 456 [2022-11-19 07:17:05,845 INFO L226 Difference]: Without dead ends: 428 [2022-11-19 07:17:05,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=458, Invalid=1800, Unknown=6, NotChecked=186, Total=2450 [2022-11-19 07:17:05,846 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 166 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 614 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:17:05,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 70 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1209 Invalid, 0 Unknown, 614 Unchecked, 1.3s Time] [2022-11-19 07:17:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-11-19 07:17:05,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 319. [2022-11-19 07:17:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 3.1540880503144653) internal successors, (1003), 318 states have internal predecessors, (1003), 0 states have call successors, (0), 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-11-19 07:17:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 1003 transitions. [2022-11-19 07:17:05,879 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 1003 transitions. Word has length 23 [2022-11-19 07:17:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:17:05,879 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 1003 transitions. [2022-11-19 07:17:05,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 1003 transitions. [2022-11-19 07:17:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:17:05,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:17:05,881 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-11-19 07:17:05,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:17:06,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-19 07:17:06,087 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-11-19 07:17:06,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:17:06,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1384884849, now seen corresponding path program 4 times [2022-11-19 07:17:06,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:17:06,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015059757] [2022-11-19 07:17:06,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:17:06,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:17:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:17:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:07,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:17:07,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015059757] [2022-11-19 07:17:07,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015059757] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:17:07,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394487308] [2022-11-19 07:17:07,185 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:17:07,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:17:07,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:17:07,186 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:17:07,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 07:17:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:17:07,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-19 07:17:07,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:17:07,786 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:17:07,787 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 75 treesize of output 65 [2022-11-19 07:17:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:07,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:17:08,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:08,173 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 119 treesize of output 75 [2022-11-19 07:17:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:08,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394487308] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:17:08,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [917913952] [2022-11-19 07:17:08,608 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:17:08,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:17:08,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2022-11-19 07:17:08,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256956963] [2022-11-19 07:17:08,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:17:08,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-19 07:17:08,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:17:08,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-19 07:17:08,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2022-11-19 07:17:08,611 INFO L87 Difference]: Start difference. First operand 319 states and 1003 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:09,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:17:09,991 INFO L93 Difference]: Finished difference Result 429 states and 1321 transitions. [2022-11-19 07:17:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-19 07:17:09,992 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:17:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:17:09,995 INFO L225 Difference]: With dead ends: 429 [2022-11-19 07:17:09,995 INFO L226 Difference]: Without dead ends: 415 [2022-11-19 07:17:09,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=347, Invalid=1213, Unknown=0, NotChecked=0, Total=1560 [2022-11-19 07:17:09,996 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 202 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:17:09,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 53 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 534 Invalid, 0 Unknown, 43 Unchecked, 0.5s Time] [2022-11-19 07:17:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-11-19 07:17:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 321. [2022-11-19 07:17:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 3.15625) internal successors, (1010), 320 states have internal predecessors, (1010), 0 states have call successors, (0), 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-11-19 07:17:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 1010 transitions. [2022-11-19 07:17:10,011 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 1010 transitions. Word has length 23 [2022-11-19 07:17:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:17:10,011 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 1010 transitions. [2022-11-19 07:17:10,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 1010 transitions. [2022-11-19 07:17:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:17:10,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:17:10,013 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-11-19 07:17:10,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 07:17:10,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:17:10,219 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-11-19 07:17:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:17:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash 355185201, now seen corresponding path program 5 times [2022-11-19 07:17:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:17:10,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624155704] [2022-11-19 07:17:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:17:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:17:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:17:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:11,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:17:11,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624155704] [2022-11-19 07:17:11,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624155704] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:17:11,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510970110] [2022-11-19 07:17:11,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:17:11,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:17:11,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:17:11,556 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:17:11,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 07:17:11,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 07:17:11,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:17:11,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-19 07:17:11,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:17:11,704 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 414 treesize of output 406 [2022-11-19 07:17:12,154 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-11-19 07:17:12,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:12,360 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 66 treesize of output 46 [2022-11-19 07:17:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:12,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:17:13,229 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:13,229 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 249 treesize of output 189 [2022-11-19 07:17:13,237 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 154 treesize of output 136 [2022-11-19 07:17:13,244 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 136 treesize of output 130 [2022-11-19 07:17:13,250 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 130 treesize of output 118 [2022-11-19 07:17:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:14,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510970110] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:17:14,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [543164207] [2022-11-19 07:17:14,063 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:17:14,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:17:14,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-19 07:17:14,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188284903] [2022-11-19 07:17:14,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:17:14,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-19 07:17:14,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:17:14,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-19 07:17:14,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1057, Unknown=1, NotChecked=0, Total=1260 [2022-11-19 07:17:14,066 INFO L87 Difference]: Start difference. First operand 321 states and 1010 transitions. Second operand has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 35 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:17:16,311 INFO L93 Difference]: Finished difference Result 627 states and 1886 transitions. [2022-11-19 07:17:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-19 07:17:16,312 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 35 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:17:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:17:16,316 INFO L225 Difference]: With dead ends: 627 [2022-11-19 07:17:16,316 INFO L226 Difference]: Without dead ends: 613 [2022-11-19 07:17:16,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=537, Invalid=2114, Unknown=1, NotChecked=0, Total=2652 [2022-11-19 07:17:16,318 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 278 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-19 07:17:16,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 121 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1010 Invalid, 0 Unknown, 91 Unchecked, 0.9s Time] [2022-11-19 07:17:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-11-19 07:17:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 333. [2022-11-19 07:17:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 3.13855421686747) internal successors, (1042), 332 states have internal predecessors, (1042), 0 states have call successors, (0), 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-11-19 07:17:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1042 transitions. [2022-11-19 07:17:16,333 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1042 transitions. Word has length 23 [2022-11-19 07:17:16,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:17:16,334 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 1042 transitions. [2022-11-19 07:17:16,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 35 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1042 transitions. [2022-11-19 07:17:16,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:17:16,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:17:16,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-11-19 07:17:16,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 07:17:16,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:17:16,545 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-11-19 07:17:16,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:17:16,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1203153615, now seen corresponding path program 6 times [2022-11-19 07:17:16,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:17:16,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374498614] [2022-11-19 07:17:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:17:16,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:17:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:17:17,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:17,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:17:17,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374498614] [2022-11-19 07:17:17,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374498614] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:17:17,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209165286] [2022-11-19 07:17:17,411 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:17:17,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:17:17,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:17:17,416 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:17:17,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 07:17:17,532 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:17:17,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:17:17,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-19 07:17:17,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:17:18,032 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:17:18,034 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-11-19 07:17:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:17:18,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:17:18,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:18,665 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 103 treesize of output 73 [2022-11-19 07:17:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:17:19,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209165286] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:17:19,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [315248634] [2022-11-19 07:17:19,030 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:17:19,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:17:19,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 26 [2022-11-19 07:17:19,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315969711] [2022-11-19 07:17:19,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:17:19,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-19 07:17:19,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:17:19,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-19 07:17:19,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2022-11-19 07:17:19,033 INFO L87 Difference]: Start difference. First operand 333 states and 1042 transitions. Second operand has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:17:21,579 INFO L93 Difference]: Finished difference Result 690 states and 2059 transitions. [2022-11-19 07:17:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-19 07:17:21,580 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:17:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:17:21,584 INFO L225 Difference]: With dead ends: 690 [2022-11-19 07:17:21,584 INFO L226 Difference]: Without dead ends: 683 [2022-11-19 07:17:21,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=321, Invalid=1841, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 07:17:21,586 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 126 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:17:21,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 143 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1151 Invalid, 0 Unknown, 179 Unchecked, 1.0s Time] [2022-11-19 07:17:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-11-19 07:17:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 341. [2022-11-19 07:17:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 3.123529411764706) internal successors, (1062), 340 states have internal predecessors, (1062), 0 states have call successors, (0), 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-11-19 07:17:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1062 transitions. [2022-11-19 07:17:21,602 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1062 transitions. Word has length 23 [2022-11-19 07:17:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:17:21,602 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 1062 transitions. [2022-11-19 07:17:21,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1062 transitions. [2022-11-19 07:17:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:17:21,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:17:21,604 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-11-19 07:17:21,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 07:17:21,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:17:21,816 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-11-19 07:17:21,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:17:21,817 INFO L85 PathProgramCache]: Analyzing trace with hash 620659845, now seen corresponding path program 7 times [2022-11-19 07:17:21,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:17:21,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679886327] [2022-11-19 07:17:21,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:17:21,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:17:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:17:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:22,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:17:22,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679886327] [2022-11-19 07:17:22,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679886327] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:17:22,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665789546] [2022-11-19 07:17:22,573 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:17:22,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:17:22,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:17:22,574 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:17:22,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 07:17:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:17:22,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-19 07:17:22,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:17:23,177 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:17:23,178 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 75 treesize of output 65 [2022-11-19 07:17:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:23,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:17:23,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:23,647 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 103 treesize of output 73 [2022-11-19 07:17:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:24,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665789546] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:17:24,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [495284939] [2022-11-19 07:17:24,078 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:17:24,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:17:24,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2022-11-19 07:17:24,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652716299] [2022-11-19 07:17:24,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:17:24,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-19 07:17:24,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:17:24,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-19 07:17:24,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2022-11-19 07:17:24,082 INFO L87 Difference]: Start difference. First operand 341 states and 1062 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:17:25,946 INFO L93 Difference]: Finished difference Result 580 states and 1771 transitions. [2022-11-19 07:17:25,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-19 07:17:25,947 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:17:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:17:25,950 INFO L225 Difference]: With dead ends: 580 [2022-11-19 07:17:25,950 INFO L226 Difference]: Without dead ends: 552 [2022-11-19 07:17:25,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=348, Invalid=1544, Unknown=0, NotChecked=0, Total=1892 [2022-11-19 07:17:25,951 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 182 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 07:17:25,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 142 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 789 Invalid, 0 Unknown, 123 Unchecked, 0.7s Time] [2022-11-19 07:17:25,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-11-19 07:17:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 357. [2022-11-19 07:17:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 3.1657303370786516) internal successors, (1127), 356 states have internal predecessors, (1127), 0 states have call successors, (0), 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-11-19 07:17:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1127 transitions. [2022-11-19 07:17:25,967 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1127 transitions. Word has length 23 [2022-11-19 07:17:25,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:17:25,967 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 1127 transitions. [2022-11-19 07:17:25,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1127 transitions. [2022-11-19 07:17:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:17:25,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:17:25,970 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-11-19 07:17:25,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-19 07:17:26,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-19 07:17:26,175 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-11-19 07:17:26,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:17:26,175 INFO L85 PathProgramCache]: Analyzing trace with hash -916705771, now seen corresponding path program 8 times [2022-11-19 07:17:26,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:17:26,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066658074] [2022-11-19 07:17:26,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:17:26,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:17:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:17:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:27,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:17:27,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066658074] [2022-11-19 07:17:27,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066658074] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:17:27,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190360459] [2022-11-19 07:17:27,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:17:27,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:17:27,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:17:27,288 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:17:27,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 07:17:27,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 07:17:27,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:17:27,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-19 07:17:27,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:17:28,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:28,023 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-11-19 07:17:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:28,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:17:28,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:28,828 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 103 treesize of output 73 [2022-11-19 07:17:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:29,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190360459] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:17:29,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [352004818] [2022-11-19 07:17:29,452 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:17:29,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:17:29,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 32 [2022-11-19 07:17:29,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297601891] [2022-11-19 07:17:29,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:17:29,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-19 07:17:29,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:17:29,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-19 07:17:29,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2022-11-19 07:17:29,456 INFO L87 Difference]: Start difference. First operand 357 states and 1127 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:17:32,591 INFO L93 Difference]: Finished difference Result 622 states and 1907 transitions. [2022-11-19 07:17:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-19 07:17:32,592 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:17:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:17:32,595 INFO L225 Difference]: With dead ends: 622 [2022-11-19 07:17:32,596 INFO L226 Difference]: Without dead ends: 601 [2022-11-19 07:17:32,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=665, Invalid=2527, Unknown=0, NotChecked=0, Total=3192 [2022-11-19 07:17:32,597 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 342 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:17:32,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 173 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1133 Invalid, 0 Unknown, 131 Unchecked, 1.0s Time] [2022-11-19 07:17:32,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-11-19 07:17:32,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 355. [2022-11-19 07:17:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 3.1666666666666665) internal successors, (1121), 354 states have internal predecessors, (1121), 0 states have call successors, (0), 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-11-19 07:17:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1121 transitions. [2022-11-19 07:17:32,613 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1121 transitions. Word has length 23 [2022-11-19 07:17:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:17:32,613 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 1121 transitions. [2022-11-19 07:17:32,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1121 transitions. [2022-11-19 07:17:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:17:32,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:17:32,615 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-11-19 07:17:32,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 07:17:32,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-19 07:17:32,820 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-11-19 07:17:32,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:17:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash -665859815, now seen corresponding path program 9 times [2022-11-19 07:17:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:17:32,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773151987] [2022-11-19 07:17:32,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:17:32,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:17:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:17:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:34,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:17:34,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773151987] [2022-11-19 07:17:34,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773151987] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:17:34,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787952054] [2022-11-19 07:17:34,006 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:17:34,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:17:34,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:17:34,008 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:17:34,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-19 07:17:34,131 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:17:34,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:17:34,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-19 07:17:34,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:17:34,683 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:17:34,684 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-11-19 07:17:34,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:17:34,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:17:35,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:35,322 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 103 treesize of output 73 [2022-11-19 07:17:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:17:35,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787952054] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:17:35,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [732194180] [2022-11-19 07:17:35,702 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:17:35,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:17:35,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 26 [2022-11-19 07:17:35,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909242877] [2022-11-19 07:17:35,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:17:35,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-19 07:17:35,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:17:35,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-19 07:17:35,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2022-11-19 07:17:35,705 INFO L87 Difference]: Start difference. First operand 355 states and 1121 transitions. Second operand has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:38,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:17:38,382 INFO L93 Difference]: Finished difference Result 609 states and 1809 transitions. [2022-11-19 07:17:38,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-19 07:17:38,383 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:17:38,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:17:38,387 INFO L225 Difference]: With dead ends: 609 [2022-11-19 07:17:38,387 INFO L226 Difference]: Without dead ends: 597 [2022-11-19 07:17:38,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=464, Invalid=2188, Unknown=0, NotChecked=0, Total=2652 [2022-11-19 07:17:38,388 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 206 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 300 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-19 07:17:38,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 167 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 907 Invalid, 0 Unknown, 300 Unchecked, 0.8s Time] [2022-11-19 07:17:38,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-11-19 07:17:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 361. [2022-11-19 07:17:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 3.191666666666667) internal successors, (1149), 360 states have internal predecessors, (1149), 0 states have call successors, (0), 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-11-19 07:17:38,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 1149 transitions. [2022-11-19 07:17:38,403 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 1149 transitions. Word has length 23 [2022-11-19 07:17:38,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:17:38,403 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 1149 transitions. [2022-11-19 07:17:38,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 1149 transitions. [2022-11-19 07:17:38,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:17:38,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:17:38,405 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-11-19 07:17:38,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-19 07:17:38,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:17:38,611 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-11-19 07:17:38,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:17:38,611 INFO L85 PathProgramCache]: Analyzing trace with hash -59680447, now seen corresponding path program 10 times [2022-11-19 07:17:38,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:17:38,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075867744] [2022-11-19 07:17:38,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:17:38,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:17:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:17:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:39,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:17:39,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075867744] [2022-11-19 07:17:39,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075867744] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:17:39,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160319642] [2022-11-19 07:17:39,979 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:17:39,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:17:39,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:17:39,982 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:17:39,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-19 07:17:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:17:40,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-19 07:17:40,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:17:40,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:17:40,262 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-11-19 07:17:40,331 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-11-19 07:17:40,413 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-11-19 07:17:40,717 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:17:40,717 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 81 treesize of output 65 [2022-11-19 07:17:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:40,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:17:41,816 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_~min2~0 c_~min1~0)) (.cse14 (< c_~min3~0 c_~min2~0)) (.cse13 (<= c_~min2~0 c_~min3~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_582 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse2))) (or (= c_~min1~0 .cse0) (<= c_~min2~0 .cse0) (< (select .cse1 c_~A~0.offset) c_~min1~0) (not (< .cse0 c_~min3~0)))))) (or .cse3 (forall ((v_ArrVal_582 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base))) (let ((.cse4 (select .cse5 .cse2))) (or (< .cse4 c_~min2~0) (< (select .cse5 c_~A~0.offset) c_~min1~0) (not (< .cse4 c_~min3~0))))))) (forall ((v_ArrVal_582 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset)) (.cse6 (select .cse8 .cse2))) (or (= .cse6 .cse7) (<= c_~min2~0 .cse6) (not (< .cse7 c_~min1~0)) (not (< .cse6 c_~min3~0)))))) (forall ((v_ArrVal_582 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base))) (let ((.cse9 (select .cse11 c_~A~0.offset)) (.cse10 (select .cse11 .cse2))) (or (= c_~min2~0 .cse9) (< .cse10 c_~min2~0) (not (< .cse9 c_~min1~0)) (not (< .cse10 c_~min3~0)))))) (or (forall ((v_ArrVal_582 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base))) (or (< (select .cse12 c_~A~0.offset) c_~min1~0) (< (select .cse12 .cse2) c_~min3~0)))) (and (or .cse13 (= c_~min1~0 c_~min3~0)) (or .cse3 .cse14))) (or (forall ((v_ArrVal_582 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base))) (let ((.cse15 (select .cse16 c_~A~0.offset))) (or (= c_~min2~0 .cse15) (not (< .cse15 c_~min1~0)) (< (select .cse16 .cse2) c_~min3~0))))) .cse14) (or .cse13 (forall ((v_ArrVal_582 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base))) (let ((.cse17 (select .cse18 c_~A~0.offset))) (or (= c_~min3~0 .cse17) (not (< .cse17 c_~min1~0)) (< (select .cse18 .cse2) c_~min3~0)))))))) is different from false [2022-11-19 07:17:42,267 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (<= c_~min2~0 c_~min3~0)) (.cse7 (= c_~min2~0 c_~min1~0)) (.cse3 (< c_~min3~0 c_~min2~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (= c_~min2~0 .cse0) (< (select .cse1 .cse2) c_~min3~0) (not (< .cse0 c_~min1~0)))))) .cse3) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse2)) (.cse4 (select .cse6 c_~A~0.offset))) (or (= c_~min2~0 .cse4) (not (< .cse5 c_~min3~0)) (< .cse5 c_~min2~0) (not (< .cse4 c_~min1~0)))))) (or .cse7 (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse2))) (or (not (< .cse8 c_~min3~0)) (< .cse8 c_~min2~0) (< (select .cse9 c_~A~0.offset) c_~min1~0)))))) (or .cse10 (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base))) (let ((.cse12 (select .cse11 c_~A~0.offset))) (or (< (select .cse11 .cse2) c_~min3~0) (not (< .cse12 c_~min1~0)) (= .cse12 c_~min3~0)))))) (or (and (or .cse10 (= c_~min1~0 c_~min3~0)) (or .cse7 .cse3)) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base))) (or (< (select .cse13 .cse2) c_~min3~0) (< (select .cse13 c_~A~0.offset) c_~min1~0))))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base))) (let ((.cse14 (select .cse16 .cse2)) (.cse15 (select .cse16 c_~A~0.offset))) (or (= .cse14 .cse15) (<= c_~min2~0 .cse14) (not (< .cse14 c_~min3~0)) (not (< .cse15 c_~min1~0)))))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse2))) (or (<= c_~min2~0 .cse17) (not (< .cse17 c_~min3~0)) (< (select .cse18 c_~A~0.offset) c_~min1~0) (= c_~min1~0 .cse17))))))) is different from false [2022-11-19 07:17:45,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:45,222 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 90 treesize of output 66 [2022-11-19 07:17:45,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:45,248 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 781 treesize of output 759 [2022-11-19 07:17:45,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:45,274 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 749 treesize of output 719 [2022-11-19 07:17:45,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:45,300 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 709 treesize of output 639 [2022-11-19 07:17:45,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:45,329 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 431 treesize of output 421 [2022-11-19 07:17:48,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:48,354 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 126 treesize of output 90 [2022-11-19 07:17:48,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:48,378 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 550 treesize of output 532 [2022-11-19 07:17:48,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:48,404 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 522 treesize of output 452 [2022-11-19 07:17:48,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:48,455 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 287 treesize of output 277 [2022-11-19 07:17:48,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:48,478 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 422 treesize of output 392 [2022-11-19 07:17:53,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:53,107 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 90 treesize of output 66 [2022-11-19 07:17:53,132 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:17:53,133 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 375 treesize of output 363 [2022-11-19 07:17:53,159 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:17:53,159 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 359 treesize of output 323 [2022-11-19 07:17:53,186 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:17:53,186 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 319 treesize of output 303 [2022-11-19 07:17:53,211 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:17:53,212 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 205 treesize of output 199 [2022-11-19 07:17:54,129 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-19 07:17:54,129 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 152 treesize of output 1 [2022-11-19 07:17:54,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:54,163 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 94 treesize of output 70 [2022-11-19 07:17:54,192 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:17:54,192 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 845 treesize of output 809 [2022-11-19 07:17:54,229 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:17:54,229 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 805 treesize of output 753 [2022-11-19 07:17:54,266 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:17:54,266 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 749 treesize of output 641 [2022-11-19 07:17:54,305 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:17:54,305 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 439 treesize of output 415 [2022-11-19 07:17:56,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:56,359 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 123 treesize of output 87 [2022-11-19 07:17:56,391 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:17:56,392 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 4503 treesize of output 4315 [2022-11-19 07:17:56,466 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:17:56,467 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 4311 treesize of output 3803 [2022-11-19 07:17:56,548 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:17:56,548 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 3799 treesize of output 3547 [2022-11-19 07:17:56,654 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:17:56,655 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 2723 treesize of output 2599 [2022-11-19 07:18:28,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:18:28,508 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 61 treesize of output 49 [2022-11-19 07:18:28,533 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:18:28,534 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 531 treesize of output 511 [2022-11-19 07:18:28,562 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:18:28,563 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 507 treesize of output 447 [2022-11-19 07:18:28,590 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:18:28,591 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 443 treesize of output 415 [2022-11-19 07:18:28,622 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:18:28,622 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 213 treesize of output 201 [2022-11-19 07:18:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:29,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160319642] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:18:29,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1714782721] [2022-11-19 07:18:29,453 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:18:29,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:18:29,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 30 [2022-11-19 07:18:29,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276614094] [2022-11-19 07:18:29,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:18:29,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-19 07:18:29,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:29,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-19 07:18:29,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=735, Unknown=2, NotChecked=114, Total=992 [2022-11-19 07:18:29,458 INFO L87 Difference]: Start difference. First operand 361 states and 1149 transitions. Second operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:34,504 INFO L93 Difference]: Finished difference Result 744 states and 2341 transitions. [2022-11-19 07:18:34,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-19 07:18:34,505 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:18:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:34,509 INFO L225 Difference]: With dead ends: 744 [2022-11-19 07:18:34,509 INFO L226 Difference]: Without dead ends: 732 [2022-11-19 07:18:34,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=483, Invalid=2279, Unknown=2, NotChecked=206, Total=2970 [2022-11-19 07:18:34,511 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 271 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:34,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 194 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1125 Invalid, 0 Unknown, 342 Unchecked, 1.3s Time] [2022-11-19 07:18:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2022-11-19 07:18:34,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 360. [2022-11-19 07:18:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 3.1922005571030643) internal successors, (1146), 359 states have internal predecessors, (1146), 0 states have call successors, (0), 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-11-19 07:18:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 1146 transitions. [2022-11-19 07:18:34,526 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 1146 transitions. Word has length 23 [2022-11-19 07:18:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:34,527 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 1146 transitions. [2022-11-19 07:18:34,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 1146 transitions. [2022-11-19 07:18:34,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:18:34,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:34,529 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-11-19 07:18:34,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-19 07:18:34,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-19 07:18:34,737 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-11-19 07:18:34,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1962600201, now seen corresponding path program 11 times [2022-11-19 07:18:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:34,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30390598] [2022-11-19 07:18:34,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:34,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:35,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:35,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30390598] [2022-11-19 07:18:35,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30390598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:18:35,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305712736] [2022-11-19 07:18:35,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:18:35,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:35,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:35,633 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:18:35,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-19 07:18:35,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 07:18:35,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:18:35,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-19 07:18:35,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:18:36,305 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 63 treesize of output 43 [2022-11-19 07:18:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:36,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:18:36,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:18:36,766 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 119 treesize of output 75 [2022-11-19 07:18:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:37,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305712736] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:18:37,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [87895582] [2022-11-19 07:18:37,374 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:18:37,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:18:37,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 28 [2022-11-19 07:18:37,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270320502] [2022-11-19 07:18:37,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:18:37,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-19 07:18:37,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:37,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-19 07:18:37,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-11-19 07:18:37,376 INFO L87 Difference]: Start difference. First operand 360 states and 1146 transitions. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 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-11-19 07:18:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:38,486 INFO L93 Difference]: Finished difference Result 423 states and 1290 transitions. [2022-11-19 07:18:38,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-19 07:18:38,487 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 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-11-19 07:18:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:38,490 INFO L225 Difference]: With dead ends: 423 [2022-11-19 07:18:38,490 INFO L226 Difference]: Without dead ends: 411 [2022-11-19 07:18:38,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2022-11-19 07:18:38,491 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 97 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:38,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 47 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 769 Invalid, 0 Unknown, 59 Unchecked, 0.7s Time] [2022-11-19 07:18:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-11-19 07:18:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 360. [2022-11-19 07:18:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 3.1922005571030643) internal successors, (1146), 359 states have internal predecessors, (1146), 0 states have call successors, (0), 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-11-19 07:18:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 1146 transitions. [2022-11-19 07:18:38,504 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 1146 transitions. Word has length 23 [2022-11-19 07:18:38,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:38,504 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 1146 transitions. [2022-11-19 07:18:38,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 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-11-19 07:18:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 1146 transitions. [2022-11-19 07:18:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:18:38,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:38,506 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-11-19 07:18:38,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-19 07:18:38,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 07:18:38,712 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-11-19 07:18:38,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1756038041, now seen corresponding path program 12 times [2022-11-19 07:18:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:38,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835889799] [2022-11-19 07:18:38,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:38,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:39,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:39,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835889799] [2022-11-19 07:18:39,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835889799] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:18:39,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692218558] [2022-11-19 07:18:39,869 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:18:39,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:39,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:39,870 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:18:39,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-19 07:18:39,983 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:18:39,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:18:39,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-19 07:18:39,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:18:40,527 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:18:40,528 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-11-19 07:18:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:18:40,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:18:41,164 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:18:41,164 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 103 treesize of output 73 [2022-11-19 07:18:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:18:41,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692218558] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:18:41,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2075898251] [2022-11-19 07:18:41,606 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:18:41,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:18:41,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 7] total 28 [2022-11-19 07:18:41,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857962845] [2022-11-19 07:18:41,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:18:41,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-19 07:18:41,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:41,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-19 07:18:41,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2022-11-19 07:18:41,609 INFO L87 Difference]: Start difference. First operand 360 states and 1146 transitions. Second operand has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:44,780 INFO L93 Difference]: Finished difference Result 731 states and 2213 transitions. [2022-11-19 07:18:44,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-19 07:18:44,780 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:18:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:44,782 INFO L225 Difference]: With dead ends: 731 [2022-11-19 07:18:44,782 INFO L226 Difference]: Without dead ends: 724 [2022-11-19 07:18:44,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=349, Invalid=2201, Unknown=0, NotChecked=0, Total=2550 [2022-11-19 07:18:44,784 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 143 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:44,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 143 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1100 Invalid, 0 Unknown, 199 Unchecked, 1.2s Time] [2022-11-19 07:18:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-11-19 07:18:44,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 370. [2022-11-19 07:18:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 3.200542005420054) internal successors, (1181), 369 states have internal predecessors, (1181), 0 states have call successors, (0), 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-11-19 07:18:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1181 transitions. [2022-11-19 07:18:44,799 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1181 transitions. Word has length 23 [2022-11-19 07:18:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:44,799 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 1181 transitions. [2022-11-19 07:18:44,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:44,800 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1181 transitions. [2022-11-19 07:18:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:18:44,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:44,801 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-11-19 07:18:44,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-19 07:18:45,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-19 07:18:45,006 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-11-19 07:18:45,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:45,007 INFO L85 PathProgramCache]: Analyzing trace with hash -746919281, now seen corresponding path program 13 times [2022-11-19 07:18:45,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:45,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25386425] [2022-11-19 07:18:45,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:45,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:46,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:46,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25386425] [2022-11-19 07:18:46,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25386425] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:18:46,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077955893] [2022-11-19 07:18:46,339 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:18:46,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:46,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:46,346 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:18:46,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-19 07:18:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:46,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-19 07:18:46,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:18:46,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:18:46,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:18:46,724 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-11-19 07:18:46,802 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-11-19 07:18:47,174 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:18:47,175 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 75 treesize of output 65 [2022-11-19 07:18:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:47,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:18:48,436 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~min2~0 c_~min3~0)) (.cse15 (= c_~min2~0 c_~min1~0)) (.cse7 (< c_~min3~0 c_~min2~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (forall ((v_ArrVal_719 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_719) c_~A~0.base))) (let ((.cse1 (select .cse2 c_~A~0.offset))) (or (= .cse1 c_~min3~0) (not (< .cse1 c_~min1~0)) (< (select .cse2 .cse3) c_~min3~0)))))) (forall ((v_ArrVal_719 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_719) c_~A~0.base))) (let ((.cse4 (select .cse6 .cse3)) (.cse5 (select .cse6 c_~A~0.offset))) (or (< .cse4 c_~min2~0) (not (< .cse5 c_~min1~0)) (not (< .cse4 c_~min3~0)) (= c_~min2~0 .cse5))))) (or .cse7 (forall ((v_ArrVal_719 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_719) c_~A~0.base))) (let ((.cse8 (select .cse9 c_~A~0.offset))) (or (not (< .cse8 c_~min1~0)) (= c_~min2~0 .cse8) (< (select .cse9 .cse3) c_~min3~0)))))) (forall ((v_ArrVal_719 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_719) c_~A~0.base))) (let ((.cse11 (select .cse12 c_~A~0.offset)) (.cse10 (select .cse12 .cse3))) (or (= .cse10 .cse11) (<= c_~min2~0 .cse10) (not (< .cse11 c_~min1~0)) (not (< .cse10 c_~min3~0)))))) (forall ((v_ArrVal_719 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_719) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse3))) (or (= c_~min1~0 .cse13) (<= c_~min2~0 .cse13) (not (< .cse13 c_~min3~0)) (< (select .cse14 c_~A~0.offset) c_~min1~0))))) (or .cse15 (forall ((v_ArrVal_719 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_719) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse3))) (or (< .cse16 c_~min2~0) (not (< .cse16 c_~min3~0)) (< (select .cse17 c_~A~0.offset) c_~min1~0)))))) (or (and (or .cse0 (= c_~min1~0 c_~min3~0)) (or .cse15 .cse7)) (forall ((v_ArrVal_719 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_719) c_~A~0.base))) (or (< (select .cse18 c_~A~0.offset) c_~min1~0) (< (select .cse18 .cse3) c_~min3~0))))))) is different from false [2022-11-19 07:18:48,805 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_~min2~0 c_~min1~0)) (.cse10 (<= c_~min2~0 c_~min3~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse11 (< c_~min3~0 c_~min2~0))) (and (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_719) c_~A~0.base))) (let ((.cse1 (select .cse2 c_~A~0.offset)) (.cse0 (select .cse2 .cse3))) (or (not (< .cse0 c_~min3~0)) (not (< .cse1 c_~min1~0)) (<= c_~min2~0 .cse0) (= .cse1 .cse0))))) (or .cse4 (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_719) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse3))) (or (not (< .cse5 c_~min3~0)) (< .cse5 c_~min2~0) (< (select .cse6 c_~A~0.offset) c_~min1~0)))))) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_719) c_~A~0.base))) (let ((.cse8 (select .cse9 c_~A~0.offset)) (.cse7 (select .cse9 .cse3))) (or (not (< .cse7 c_~min3~0)) (= c_~min2~0 .cse8) (not (< .cse8 c_~min1~0)) (< .cse7 c_~min2~0))))) (or (and (or .cse10 (= c_~min1~0 c_~min3~0)) (or .cse4 .cse11)) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_719) c_~A~0.base))) (or (< (select .cse12 .cse3) c_~min3~0) (< (select .cse12 c_~A~0.offset) c_~min1~0))))) (or .cse10 (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_719) c_~A~0.base))) (let ((.cse14 (select .cse13 c_~A~0.offset))) (or (< (select .cse13 .cse3) c_~min3~0) (= c_~min3~0 .cse14) (not (< .cse14 c_~min1~0))))))) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_719) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse3))) (or (= c_~min1~0 .cse15) (not (< .cse15 c_~min3~0)) (<= c_~min2~0 .cse15) (< (select .cse16 c_~A~0.offset) c_~min1~0))))) (or (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_719) c_~A~0.base))) (let ((.cse18 (select .cse17 c_~A~0.offset))) (or (< (select .cse17 .cse3) c_~min3~0) (= c_~min2~0 .cse18) (not (< .cse18 c_~min1~0)))))) .cse11))) is different from false [2022-11-19 07:18:49,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:18:49,958 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 152 treesize of output 104 [2022-11-19 07:18:49,979 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-19 07:18:49,980 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 2431 treesize of output 2308 [2022-11-19 07:18:50,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:18:50,004 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 1703 treesize of output 1527 [2022-11-19 07:18:50,032 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-19 07:18:50,033 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 2127 treesize of output 2039 [2022-11-19 07:18:50,061 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-19 07:18:50,062 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 2039 treesize of output 1687 [2022-11-19 07:18:53,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:18:53,441 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 90 treesize of output 66 [2022-11-19 07:18:53,458 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:18:53,458 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 781 treesize of output 753 [2022-11-19 07:18:53,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:18:53,483 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 497 treesize of output 457 [2022-11-19 07:18:53,502 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:18:53,503 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 709 treesize of output 633 [2022-11-19 07:18:53,528 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:18:53,528 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 629 treesize of output 613 [2022-11-19 07:19:01,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:19:01,369 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 94 treesize of output 70 [2022-11-19 07:19:01,399 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:19:01,399 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 3473 treesize of output 3317 [2022-11-19 07:19:01,457 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:19:01,458 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 3313 treesize of output 2869 [2022-11-19 07:19:01,533 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:19:01,533 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 2865 treesize of output 2757 [2022-11-19 07:19:01,585 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:19:01,586 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 2753 treesize of output 2533 [2022-11-19 07:20:47,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:20:47,929 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 61 treesize of output 49 [2022-11-19 07:20:47,955 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:20:47,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 2187 treesize of output 2095 [2022-11-19 07:20:48,003 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:20:48,004 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 2091 treesize of output 1839 [2022-11-19 07:20:48,050 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:20:48,051 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 1835 treesize of output 1775 [2022-11-19 07:20:48,098 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:20:48,099 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 1771 treesize of output 1647 [2022-11-19 07:21:57,795 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-19 07:21:57,795 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 90 treesize of output 1 [2022-11-19 07:21:57,810 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-19 07:21:57,810 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 123 treesize of output 1 [2022-11-19 07:21:57,824 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-19 07:21:57,824 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 126 treesize of output 1 [2022-11-19 07:21:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:21:57,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077955893] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:21:57,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [299260371] [2022-11-19 07:21:57,939 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:21:57,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:21:57,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-11-19 07:21:57,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100321623] [2022-11-19 07:21:57,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:21:57,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-19 07:21:57,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:57,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-19 07:21:57,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=697, Unknown=2, NotChecked=110, Total=930 [2022-11-19 07:21:57,941 INFO L87 Difference]: Start difference. First operand 370 states and 1181 transitions. Second operand has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:59,700 INFO L93 Difference]: Finished difference Result 544 states and 1670 transitions. [2022-11-19 07:21:59,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-19 07:21:59,701 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:21:59,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:59,703 INFO L225 Difference]: With dead ends: 544 [2022-11-19 07:21:59,704 INFO L226 Difference]: Without dead ends: 523 [2022-11-19 07:21:59,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=218, Invalid=1120, Unknown=2, NotChecked=142, Total=1482 [2022-11-19 07:21:59,705 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 152 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:59,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 95 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 421 Invalid, 0 Unknown, 153 Unchecked, 0.5s Time] [2022-11-19 07:21:59,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-11-19 07:21:59,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 386. [2022-11-19 07:21:59,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 3.225974025974026) internal successors, (1242), 385 states have internal predecessors, (1242), 0 states have call successors, (0), 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-11-19 07:21:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1242 transitions. [2022-11-19 07:21:59,718 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1242 transitions. Word has length 23 [2022-11-19 07:21:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:59,718 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 1242 transitions. [2022-11-19 07:21:59,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1242 transitions. [2022-11-19 07:21:59,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:21:59,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:59,720 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-11-19 07:21:59,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-19 07:21:59,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:21:59,927 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-11-19 07:21:59,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:59,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1318909947, now seen corresponding path program 14 times [2022-11-19 07:21:59,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:59,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499442091] [2022-11-19 07:21:59,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:59,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:22:01,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:22:01,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499442091] [2022-11-19 07:22:01,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499442091] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:22:01,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516595102] [2022-11-19 07:22:01,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:22:01,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:22:01,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:22:01,116 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:22:01,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-19 07:22:01,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 07:22:01,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:22:01,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-19 07:22:01,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:22:01,823 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:22:01,823 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 75 treesize of output 65 [2022-11-19 07:22:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:22:01,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:22:02,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:22:02,349 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 103 treesize of output 73 [2022-11-19 07:22:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:22:02,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516595102] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:22:02,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2033834792] [2022-11-19 07:22:02,836 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:22:02,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:22:02,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2022-11-19 07:22:02,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923502648] [2022-11-19 07:22:02,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:22:02,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-19 07:22:02,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:22:02,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-19 07:22:02,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2022-11-19 07:22:02,839 INFO L87 Difference]: Start difference. First operand 386 states and 1242 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:22:03,495 INFO L93 Difference]: Finished difference Result 490 states and 1533 transitions. [2022-11-19 07:22:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:22:03,496 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:22:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:22:03,500 INFO L225 Difference]: With dead ends: 490 [2022-11-19 07:22:03,500 INFO L226 Difference]: Without dead ends: 483 [2022-11-19 07:22:03,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2022-11-19 07:22:03,500 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 91 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:22:03,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 77 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 396 Invalid, 0 Unknown, 53 Unchecked, 0.4s Time] [2022-11-19 07:22:03,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-11-19 07:22:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 389. [2022-11-19 07:22:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 3.2190721649484537) internal successors, (1249), 388 states have internal predecessors, (1249), 0 states have call successors, (0), 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-11-19 07:22:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1249 transitions. [2022-11-19 07:22:03,512 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1249 transitions. Word has length 23 [2022-11-19 07:22:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:22:03,513 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 1249 transitions. [2022-11-19 07:22:03,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1249 transitions. [2022-11-19 07:22:03,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:22:03,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:22:03,515 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-11-19 07:22:03,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-19 07:22:03,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 07:22:03,721 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-11-19 07:22:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:22:03,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1502390755, now seen corresponding path program 15 times [2022-11-19 07:22:03,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:22:03,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898114057] [2022-11-19 07:22:03,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:22:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:22:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:22:04,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:22:04,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898114057] [2022-11-19 07:22:04,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898114057] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:22:04,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990399453] [2022-11-19 07:22:04,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:22:04,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:22:04,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:22:04,972 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:22:04,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-19 07:22:05,097 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:22:05,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:22:05,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-19 07:22:05,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:22:05,636 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:22:05,636 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-11-19 07:22:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:22:05,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:22:06,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:22:06,233 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 119 treesize of output 75 [2022-11-19 07:22:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:22:06,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990399453] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:22:06,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1829795101] [2022-11-19 07:22:06,734 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:22:06,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:22:06,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 7] total 28 [2022-11-19 07:22:06,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816318531] [2022-11-19 07:22:06,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:22:06,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-19 07:22:06,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:22:06,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-19 07:22:06,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2022-11-19 07:22:06,735 INFO L87 Difference]: Start difference. First operand 389 states and 1249 transitions. Second operand has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:22:08,983 INFO L93 Difference]: Finished difference Result 631 states and 1856 transitions. [2022-11-19 07:22:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-19 07:22:08,984 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:22:08,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:22:08,986 INFO L225 Difference]: With dead ends: 631 [2022-11-19 07:22:08,986 INFO L226 Difference]: Without dead ends: 617 [2022-11-19 07:22:08,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=309, Invalid=1671, Unknown=0, NotChecked=0, Total=1980 [2022-11-19 07:22:08,987 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 109 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-19 07:22:08,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 57 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 836 Invalid, 0 Unknown, 193 Unchecked, 0.8s Time] [2022-11-19 07:22:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-11-19 07:22:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 405. [2022-11-19 07:22:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 3.2202970297029703) internal successors, (1301), 404 states have internal predecessors, (1301), 0 states have call successors, (0), 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-11-19 07:22:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1301 transitions. [2022-11-19 07:22:09,001 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1301 transitions. Word has length 23 [2022-11-19 07:22:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:22:09,001 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 1301 transitions. [2022-11-19 07:22:09,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1301 transitions. [2022-11-19 07:22:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:22:09,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:22:09,004 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-11-19 07:22:09,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-19 07:22:09,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:22:09,210 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-11-19 07:22:09,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:22:09,210 INFO L85 PathProgramCache]: Analyzing trace with hash -900664123, now seen corresponding path program 16 times [2022-11-19 07:22:09,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:22:09,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636039077] [2022-11-19 07:22:09,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:22:09,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:22:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:22:10,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:22:10,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636039077] [2022-11-19 07:22:10,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636039077] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:22:10,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873214933] [2022-11-19 07:22:10,454 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:22:10,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:22:10,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:22:10,455 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:22:10,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-19 07:22:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:10,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-19 07:22:10,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:22:10,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:22:10,738 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-11-19 07:22:10,813 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-11-19 07:22:10,888 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-11-19 07:22:11,263 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:22:11,263 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 81 treesize of output 65 [2022-11-19 07:22:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:22:11,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:22:12,496 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (<= c_~min2~0 c_~min3~0)) (.cse6 (< c_~min3~0 c_~min2~0)) (.cse5 (= c_~min2~0 c_~min1~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_856 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse3)) (.cse0 (select .cse2 c_~A~0.offset))) (or (= .cse0 .cse1) (<= c_~min2~0 .cse1) (not (< .cse1 c_~min3~0)) (not (< .cse0 c_~min1~0)))))) (or (and (or .cse4 (= c_~min1~0 c_~min3~0)) (or .cse5 .cse6)) (forall ((v_ArrVal_856 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) c_~A~0.base))) (or (< (select .cse7 c_~A~0.offset) c_~min1~0) (< (select .cse7 .cse3) c_~min3~0))))) (or .cse4 (forall ((v_ArrVal_856 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) c_~A~0.base))) (let ((.cse8 (select .cse9 c_~A~0.offset))) (or (= .cse8 c_~min3~0) (< (select .cse9 .cse3) c_~min3~0) (not (< .cse8 c_~min1~0))))))) (or (forall ((v_ArrVal_856 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) c_~A~0.base))) (let ((.cse11 (select .cse10 c_~A~0.offset))) (or (< (select .cse10 .cse3) c_~min3~0) (= c_~min2~0 .cse11) (not (< .cse11 c_~min1~0)))))) .cse6) (forall ((v_ArrVal_856 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) c_~A~0.base))) (let ((.cse13 (select .cse12 .cse3))) (or (< (select .cse12 c_~A~0.offset) c_~min1~0) (= c_~min1~0 .cse13) (<= c_~min2~0 .cse13) (not (< .cse13 c_~min3~0)))))) (or .cse5 (forall ((v_ArrVal_856 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) c_~A~0.base))) (let ((.cse15 (select .cse14 .cse3))) (or (< (select .cse14 c_~A~0.offset) c_~min1~0) (< .cse15 c_~min2~0) (not (< .cse15 c_~min3~0))))))) (forall ((v_ArrVal_856 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse3)) (.cse16 (select .cse18 c_~A~0.offset))) (or (= c_~min2~0 .cse16) (< .cse17 c_~min2~0) (not (< .cse17 c_~min3~0)) (not (< .cse16 c_~min1~0)))))))) is different from false [2022-11-19 07:22:12,826 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~min2~0 c_~min3~0)) (.cse2 (< c_~min3~0 c_~min2~0)) (.cse1 (= c_~min2~0 c_~min1~0)) (.cse4 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (and (or .cse0 (= c_~min1~0 c_~min3~0)) (or .cse1 .cse2)) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_855) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) c_~A~0.base))) (or (< (select .cse3 c_~A~0.offset) c_~min1~0) (< (select .cse3 .cse4) c_~min3~0))))) (or .cse0 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_855) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) c_~A~0.base))) (let ((.cse5 (select .cse6 c_~A~0.offset))) (or (not (< .cse5 c_~min1~0)) (= c_~min3~0 .cse5) (< (select .cse6 .cse4) c_~min3~0)))))) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_855) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) c_~A~0.base))) (let ((.cse8 (select .cse9 c_~A~0.offset)) (.cse7 (select .cse9 .cse4))) (or (not (< .cse7 c_~min3~0)) (not (< .cse8 c_~min1~0)) (<= c_~min2~0 .cse7) (= .cse8 .cse7))))) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_855) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) c_~A~0.base))) (let ((.cse11 (select .cse12 c_~A~0.offset)) (.cse10 (select .cse12 .cse4))) (or (not (< .cse10 c_~min3~0)) (not (< .cse11 c_~min1~0)) (= c_~min2~0 .cse11) (< .cse10 c_~min2~0))))) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_855) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) c_~A~0.base))) (let ((.cse14 (select .cse13 .cse4))) (or (< (select .cse13 c_~A~0.offset) c_~min1~0) (not (< .cse14 c_~min3~0)) (= c_~min1~0 .cse14) (<= c_~min2~0 .cse14))))) (or .cse2 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_855) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) c_~A~0.base))) (let ((.cse15 (select .cse16 c_~A~0.offset))) (or (not (< .cse15 c_~min1~0)) (< (select .cse16 .cse4) c_~min3~0) (= c_~min2~0 .cse15)))))) (or .cse1 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_855) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) c_~A~0.base))) (let ((.cse18 (select .cse17 .cse4))) (or (< (select .cse17 c_~A~0.offset) c_~min1~0) (not (< .cse18 c_~min3~0)) (< .cse18 c_~min2~0)))))))) is different from false [2022-11-19 07:22:20,055 WARN L233 SmtUtils]: Spent 6.75s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 07:22:20,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:22:20,134 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 152 treesize of output 104 [2022-11-19 07:22:20,155 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-19 07:22:20,155 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 2431 treesize of output 2308 [2022-11-19 07:22:20,186 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-19 07:22:20,187 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 2303 treesize of output 2127 [2022-11-19 07:22:20,215 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-19 07:22:20,215 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 2127 treesize of output 1775 [2022-11-19 07:22:20,244 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-19 07:22:20,245 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 1775 treesize of output 1687 [2022-11-19 07:22:24,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:22:24,727 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 90 treesize of output 66 [2022-11-19 07:22:24,753 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:24,754 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 3217 treesize of output 3093 [2022-11-19 07:22:24,812 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:24,813 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 3089 treesize of output 2933 [2022-11-19 07:22:24,872 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:24,873 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 2929 treesize of output 2853 [2022-11-19 07:22:24,929 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:24,930 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 2849 treesize of output 2533 [2022-11-19 07:22:28,881 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:22:28,882 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 126 treesize of output 90 [2022-11-19 07:22:28,905 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:28,905 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 1142 treesize of output 1090 [2022-11-19 07:22:28,941 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:28,942 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 1086 treesize of output 1010 [2022-11-19 07:22:28,976 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:28,976 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 1006 treesize of output 850 [2022-11-19 07:22:29,013 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:29,013 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 549 treesize of output 513 [2022-11-19 07:22:38,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:22:38,717 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 61 treesize of output 49 [2022-11-19 07:22:38,741 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:38,741 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 255 treesize of output 247 [2022-11-19 07:22:38,763 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:38,763 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 243 treesize of output 215 [2022-11-19 07:22:38,786 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:38,786 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 211 treesize of output 199 [2022-11-19 07:22:38,810 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:38,810 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 101 treesize of output 97 [2022-11-19 07:22:39,192 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-19 07:22:39,192 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 123 treesize of output 1 [2022-11-19 07:22:39,207 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-19 07:22:39,207 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 90 treesize of output 1 [2022-11-19 07:22:39,222 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-19 07:22:39,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 1 [2022-11-19 07:22:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:22:39,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873214933] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:22:39,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [458228399] [2022-11-19 07:22:39,363 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:22:39,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:22:39,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 30 [2022-11-19 07:22:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920224761] [2022-11-19 07:22:39,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:22:39,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-19 07:22:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:22:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-19 07:22:39,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=755, Unknown=2, NotChecked=114, Total=992 [2022-11-19 07:22:39,365 INFO L87 Difference]: Start difference. First operand 405 states and 1301 transitions. Second operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:22:43,555 INFO L93 Difference]: Finished difference Result 783 states and 2405 transitions. [2022-11-19 07:22:43,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-19 07:22:43,560 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:22:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:22:43,564 INFO L225 Difference]: With dead ends: 783 [2022-11-19 07:22:43,564 INFO L226 Difference]: Without dead ends: 770 [2022-11-19 07:22:43,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=372, Invalid=2084, Unknown=2, NotChecked=194, Total=2652 [2022-11-19 07:22:43,566 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 292 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:22:43,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 169 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1019 Invalid, 0 Unknown, 512 Unchecked, 1.3s Time] [2022-11-19 07:22:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-19 07:22:43,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 420. [2022-11-19 07:22:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 3.236276849642005) internal successors, (1356), 419 states have internal predecessors, (1356), 0 states have call successors, (0), 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-11-19 07:22:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1356 transitions. [2022-11-19 07:22:43,582 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1356 transitions. Word has length 23 [2022-11-19 07:22:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:22:43,583 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 1356 transitions. [2022-11-19 07:22:43,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1356 transitions. [2022-11-19 07:22:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:22:43,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:22:43,585 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-11-19 07:22:43,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-19 07:22:43,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:22:43,796 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-11-19 07:22:43,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:22:43,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1778101809, now seen corresponding path program 17 times [2022-11-19 07:22:43,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:22:43,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042286956] [2022-11-19 07:22:43,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:22:43,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:22:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:22:45,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:22:45,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042286956] [2022-11-19 07:22:45,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042286956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:22:45,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925412364] [2022-11-19 07:22:45,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:22:45,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:22:45,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:22:45,070 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:22:45,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-19 07:22:45,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 07:22:45,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:22:45,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-19 07:22:45,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:22:45,911 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:22:45,911 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 75 treesize of output 65 [2022-11-19 07:22:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:22:46,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:22:46,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:22:46,637 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 103 treesize of output 73 [2022-11-19 07:22:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:22:47,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925412364] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:22:47,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1498600402] [2022-11-19 07:22:47,089 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-19 07:22:47,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:22:47,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 27 [2022-11-19 07:22:47,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770413828] [2022-11-19 07:22:47,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:22:47,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 07:22:47,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:22:47,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 07:22:47,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2022-11-19 07:22:47,091 INFO L87 Difference]: Start difference. First operand 420 states and 1356 transitions. Second operand has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:22:49,455 INFO L93 Difference]: Finished difference Result 614 states and 1962 transitions. [2022-11-19 07:22:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-19 07:22:49,456 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:22:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:22:49,460 INFO L225 Difference]: With dead ends: 614 [2022-11-19 07:22:49,460 INFO L226 Difference]: Without dead ends: 600 [2022-11-19 07:22:49,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=319, Invalid=1403, Unknown=0, NotChecked=0, Total=1722 [2022-11-19 07:22:49,461 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 185 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-19 07:22:49,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 144 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 814 Invalid, 0 Unknown, 141 Unchecked, 0.9s Time] [2022-11-19 07:22:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-11-19 07:22:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 427. [2022-11-19 07:22:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 3.2535211267605635) internal successors, (1386), 426 states have internal predecessors, (1386), 0 states have call successors, (0), 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-11-19 07:22:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1386 transitions. [2022-11-19 07:22:49,476 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1386 transitions. Word has length 23 [2022-11-19 07:22:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:22:49,477 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 1386 transitions. [2022-11-19 07:22:49,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1386 transitions. [2022-11-19 07:22:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:22:49,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:22:49,479 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-11-19 07:22:49,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-19 07:22:49,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:22:49,685 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-11-19 07:22:49,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:22:49,686 INFO L85 PathProgramCache]: Analyzing trace with hash 365443175, now seen corresponding path program 18 times [2022-11-19 07:22:49,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:22:49,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588422681] [2022-11-19 07:22:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:22:49,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:22:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:22:50,756 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:22:50,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588422681] [2022-11-19 07:22:50,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588422681] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:22:50,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079383197] [2022-11-19 07:22:50,756 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:22:50,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:22:50,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:22:50,760 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:22:50,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c348431b-d1cf-4710-874c-306713b0ff67/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-19 07:22:50,901 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:22:50,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:22:50,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-19 07:22:50,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:22:50,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:22:51,037 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-11-19 07:22:51,104 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-11-19 07:22:51,219 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-11-19 07:22:51,796 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:22:51,797 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-11-19 07:22:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:22:51,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:22:53,806 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (<= c_~min2~0 c_~min3~0)) (.cse0 (= c_~min2~0 c_~min1~0)) (.cse8 (< c_~min3~0 c_~min2~0))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_949 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) c_~A~0.base))) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (or (< ~M~0 0) (not (< .cse1 c_~min3~0)) (< .cse1 c_~min2~0) (< (select .cse2 c_~A~0.offset) c_~min1~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse3) (< ~M~0 0) (<= c_~min2~0 .cse3) (not (< .cse3 c_~min3~0)) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))) (< (select .cse4 c_~A~0.offset) c_~min1~0)))) (or .cse5 (forall ((~M~0 Int) (v_ArrVal_949 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) c_~A~0.base))) (let ((.cse6 (select .cse7 c_~A~0.offset))) (or (< ~M~0 0) (not (< .cse6 c_~min1~0)) (< (select .cse7 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= c_~min3~0 .cse6) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))))) (or (and (or .cse5 (= c_~min1~0 c_~min3~0)) (or .cse0 .cse8)) (forall ((~M~0 Int) (v_ArrVal_949 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) c_~A~0.base))) (or (< ~M~0 0) (< (select .cse9 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse9 c_~A~0.offset) c_~min1~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))))) (or .cse8 (forall ((~M~0 Int) (v_ArrVal_949 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) c_~A~0.base))) (let ((.cse10 (select .cse11 c_~A~0.offset))) (or (= c_~min2~0 .cse10) (< ~M~0 0) (not (< .cse10 c_~min1~0)) (< (select .cse11 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) c_~A~0.base))) (let ((.cse14 (select .cse13 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse12 (select .cse13 (+ c_~A~0.offset (* ~M~0 4))))) (or (< ~M~0 0) (not (< .cse12 c_~min3~0)) (< .cse12 c_~min2~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))) (= c_~min2~0 .cse14) (not (< .cse14 c_~min1~0)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) c_~A~0.base))) (let ((.cse15 (select .cse17 c_~A~0.offset))) (or (not (< .cse15 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse16 (select .cse17 (+ c_~A~0.offset (* ~M~0 4))))) (or (< ~M~0 0) (<= c_~min2~0 .cse16) (not (< .cse16 c_~min3~0)) (= .cse16 .cse15) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))))))))) is different from false [2022-11-19 07:22:54,685 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_~min2~0 c_~min1~0)) (.cse7 (< c_~min3~0 c_~min2~0))) (and (forall ((~M~0 Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse0 c_~min3~0)) (<= c_~min2~0 .cse0) (= c_~min1~0 .cse0) (< (select .cse1 c_~A~0.offset) c_~min1~0))))) (or .cse2 (forall ((~M~0 Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) c_~A~0.base))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (< .cse3 c_~min2~0) (not (< .cse3 c_~min3~0)) (< (select .cse4 c_~A~0.offset) c_~min1~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) c_~A~0.base))) (let ((.cse6 (select .cse5 c_~A~0.offset))) (or (< (select .cse5 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< 0 ~M~0) (not (< .cse6 c_~min1~0)) (< ~M~0 0) (= c_~min2~0 .cse6))))) .cse7) (or (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse2 .cse7)) (forall ((~M~0 Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) c_~A~0.base))) (or (< (select .cse8 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< 0 ~M~0) (< ~M~0 0) (< (select .cse8 c_~A~0.offset) c_~min1~0))))) (forall ((~M~0 Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) c_~A~0.base))) (let ((.cse9 (select .cse11 c_~A~0.offset)) (.cse10 (select .cse11 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (not (< .cse9 c_~min1~0)) (< ~M~0 0) (= c_~min2~0 .cse9) (< .cse10 c_~min2~0) (not (< .cse10 c_~min3~0)))))) (forall ((~M~0 Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) c_~A~0.base))) (let ((.cse13 (select .cse12 c_~A~0.offset))) (or (< (select .cse12 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< 0 ~M~0) (not (< .cse13 c_~min1~0)) (< ~M~0 0) (= .cse13 c_~min3~0))))))) is different from false [2022-11-19 07:22:55,048 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_~min2~0 c_~min1~0)) (.cse8 (< c_~min3~0 c_~min2~0))) (and (forall ((~M~0 Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse2 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse1 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse0 c_~min2~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse1 c_~min1~0)) (not (< .cse0 c_~min3~0)) (= c_~min2~0 .cse1))))) (or .cse3 (forall ((~M~0 Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select .cse5 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse4 c_~min2~0) (< 0 ~M~0) (< (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< ~M~0 0) (not (< .cse4 c_~min3~0))))))) (forall ((~M~0 Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse6 c_~min1~0)) (= .cse6 c_~min3~0) (< (select .cse7 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (or (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse3 .cse8)) (forall ((~M~0 Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 ~M~0) (< (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< ~M~0 0) (< (select .cse9 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (or (forall ((~M~0 Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse10 c_~min1~0)) (< (select .cse11 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (= c_~min2~0 .cse10))))) .cse8) (forall ((~M~0 Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_949) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse13 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= c_~min2~0 .cse12) (< 0 ~M~0) (< (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< ~M~0 0) (not (< .cse12 c_~min3~0)) (= c_~min1~0 .cse12))))))) is different from false [2022-11-19 07:22:55,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:22:55,087 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 90 treesize of output 66 [2022-11-19 07:22:55,109 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:55,110 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 3217 treesize of output 3093 [2022-11-19 07:22:55,197 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:55,197 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 3089 treesize of output 2933 [2022-11-19 07:22:55,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:55,274 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 1949 treesize of output 1869 [2022-11-19 07:22:55,324 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:22:55,324 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 2849 treesize of output 2533