./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI --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 362fd638a164593c63fbfc307f633b7ac4c475762218e6a2237e90d5b6553a84 --- 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-5e519f3 [2022-11-03 01:38:25,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:38:25,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:38:25,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:38:25,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:38:25,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:38:25,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:38:25,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:38:25,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:38:25,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:38:25,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:38:25,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:38:25,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:38:25,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:38:25,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:38:25,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:38:25,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:38:25,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:38:25,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:38:25,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:38:25,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:38:25,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:38:25,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:38:25,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:38:25,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:38:25,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:38:25,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:38:25,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:38:25,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:38:25,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:38:25,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:38:25,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:38:25,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:38:25,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:38:25,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:38:25,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:38:25,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:38:25,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:38:25,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:38:25,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:38:25,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:38:25,990 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:38:26,034 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:38:26,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:38:26,037 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:38:26,037 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:38:26,039 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:38:26,039 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:38:26,039 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:38:26,039 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:38:26,040 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:38:26,040 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:38:26,041 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:38:26,041 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:38:26,041 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:38:26,042 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:38:26,042 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:38:26,042 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:38:26,042 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:38:26,042 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:38:26,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:38:26,043 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:38:26,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:38:26,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:38:26,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:38:26,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:38:26,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:38:26,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:38:26,045 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:38:26,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:38:26,045 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:38:26,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:38:26,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:38:26,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:38:26,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:38:26,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:38:26,046 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:38:26,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:38:26,046 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:38:26,047 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:38:26,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:38:26,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:38:26,047 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:38:26,047 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_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/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_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI 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 -> 362fd638a164593c63fbfc307f633b7ac4c475762218e6a2237e90d5b6553a84 [2022-11-03 01:38:26,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:38:26,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:38:26,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:38:26,465 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:38:26,466 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:38:26,471 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2022-11-03 01:38:26,570 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/data/48259b2c0/de2aeddf5e674fc887c423fec82d2965/FLAGf920cae4b [2022-11-03 01:38:27,254 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:38:27,256 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2022-11-03 01:38:27,268 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/data/48259b2c0/de2aeddf5e674fc887c423fec82d2965/FLAGf920cae4b [2022-11-03 01:38:27,553 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/data/48259b2c0/de2aeddf5e674fc887c423fec82d2965 [2022-11-03 01:38:27,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:38:27,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:38:27,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:38:27,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:38:27,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:38:27,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:38:27" (1/1) ... [2022-11-03 01:38:27,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4f360a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:38:27, skipping insertion in model container [2022-11-03 01:38:27,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:38:27" (1/1) ... [2022-11-03 01:38:27,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:38:27,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:38:27,942 WARN L230 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_816ae5d0-7902-481c-8976-7d6b3db91eed/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c[2434,2447] [2022-11-03 01:38:27,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:38:27,963 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:38:27,990 WARN L230 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_816ae5d0-7902-481c-8976-7d6b3db91eed/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c[2434,2447] [2022-11-03 01:38:27,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:38:28,010 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:38:28,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:38:28 WrapperNode [2022-11-03 01:38:28,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:38:28,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:38:28,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:38:28,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:38:28,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:38:28" (1/1) ... [2022-11-03 01:38:28,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:38:28" (1/1) ... [2022-11-03 01:38:28,066 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2022-11-03 01:38:28,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:38:28,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:38:28,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:38:28,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:38:28,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:38:28" (1/1) ... [2022-11-03 01:38:28,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:38:28" (1/1) ... [2022-11-03 01:38:28,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:38:28" (1/1) ... [2022-11-03 01:38:28,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:38:28" (1/1) ... [2022-11-03 01:38:28,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:38:28" (1/1) ... [2022-11-03 01:38:28,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:38:28" (1/1) ... [2022-11-03 01:38:28,115 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:38:28" (1/1) ... [2022-11-03 01:38:28,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:38:28" (1/1) ... [2022-11-03 01:38:28,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:38:28,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:38:28,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:38:28,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:38:28,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:38:28" (1/1) ... [2022-11-03 01:38:28,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:38:28,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:28,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:38:28,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:38:28,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:38:28,248 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 01:38:28,248 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 01:38:28,248 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 01:38:28,249 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 01:38:28,249 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 01:38:28,249 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 01:38:28,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:38:28,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:38:28,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 01:38:28,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:38:28,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:38:28,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:38:28,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 01:38:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:38:28,255 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 01:38:28,439 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:38:28,442 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:38:28,861 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:38:28,885 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:38:28,885 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 01:38:28,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:38:28 BoogieIcfgContainer [2022-11-03 01:38:28,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:38:28,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:38:28,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:38:28,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:38:28,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:38:27" (1/3) ... [2022-11-03 01:38:28,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258e1293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:38:28, skipping insertion in model container [2022-11-03 01:38:28,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:38:28" (2/3) ... [2022-11-03 01:38:28,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258e1293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:38:28, skipping insertion in model container [2022-11-03 01:38:28,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:38:28" (3/3) ... [2022-11-03 01:38:28,905 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2022-11-03 01:38:28,915 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 01:38:28,926 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:38:28,926 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:38:28,927 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 01:38:29,064 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-03 01:38:29,111 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 01:38:29,130 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 184 transitions, 392 flow [2022-11-03 01:38:29,140 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 184 transitions, 392 flow [2022-11-03 01:38:29,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 184 transitions, 392 flow [2022-11-03 01:38:29,277 INFO L130 PetriNetUnfolder]: 15/181 cut-off events. [2022-11-03 01:38:29,278 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-03 01:38:29,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 181 events. 15/181 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 196 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-11-03 01:38:29,297 INFO L118 LiptonReduction]: Number of co-enabled transitions 3534 [2022-11-03 01:38:39,747 INFO L133 LiptonReduction]: Checked pairs total: 4234 [2022-11-03 01:38:39,748 INFO L135 LiptonReduction]: Total number of compositions: 187 [2022-11-03 01:38:39,759 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 32 transitions, 88 flow [2022-11-03 01:38:39,804 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 171 states, 170 states have (on average 3.588235294117647) internal successors, (610), 170 states have internal predecessors, (610), 0 states have call successors, (0), 0 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-03 01:38:39,830 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:38:39,838 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;@468addfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:38:39,839 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-03 01:38:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 170 states have (on average 3.588235294117647) internal successors, (610), 170 states have internal predecessors, (610), 0 states have call successors, (0), 0 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-03 01:38:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:38:39,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:39,858 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-03 01:38:39,858 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-03 01:38:39,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:39,865 INFO L85 PathProgramCache]: Analyzing trace with hash 44987973, now seen corresponding path program 1 times [2022-11-03 01:38:39,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:39,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152718714] [2022-11-03 01:38:39,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:39,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:41,025 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-03 01:38:41,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:41,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152718714] [2022-11-03 01:38:41,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152718714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:38:41,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:38:41,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:38:41,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833960164] [2022-11-03 01:38:41,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:41,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:38:41,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:41,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:38:41,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:38:41,083 INFO L87 Difference]: Start difference. First operand has 171 states, 170 states have (on average 3.588235294117647) internal successors, (610), 170 states have internal predecessors, (610), 0 states have call successors, (0), 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), 3 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-03 01:38:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:41,234 INFO L93 Difference]: Finished difference Result 332 states and 1126 transitions. [2022-11-03 01:38:41,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:38:41,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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-03 01:38:41,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:41,261 INFO L225 Difference]: With dead ends: 332 [2022-11-03 01:38:41,262 INFO L226 Difference]: Without dead ends: 325 [2022-11-03 01:38:41,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:38:41,270 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:41,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:38:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-11-03 01:38:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 295. [2022-11-03 01:38:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 3.4863945578231292) internal successors, (1025), 294 states have internal predecessors, (1025), 0 states have call successors, (0), 0 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-03 01:38:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 1025 transitions. [2022-11-03 01:38:41,390 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 1025 transitions. Word has length 20 [2022-11-03 01:38:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:41,392 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 1025 transitions. [2022-11-03 01:38:41,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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-03 01:38:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 1025 transitions. [2022-11-03 01:38:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 01:38:41,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:41,397 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-03 01:38:41,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:38:41,398 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-03 01:38:41,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:41,410 INFO L85 PathProgramCache]: Analyzing trace with hash 517862425, now seen corresponding path program 1 times [2022-11-03 01:38:41,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:41,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119737587] [2022-11-03 01:38:41,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:41,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:41,777 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-03 01:38:41,777 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119737587] [2022-11-03 01:38:41,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119737587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:38:41,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:38:41,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:38:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824634947] [2022-11-03 01:38:41,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:41,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:38:41,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:41,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:38:41,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:38:41,782 INFO L87 Difference]: Start difference. First operand 295 states and 1025 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-03 01:38:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:41,958 INFO L93 Difference]: Finished difference Result 296 states and 1026 transitions. [2022-11-03 01:38:41,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:38:41,959 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-03 01:38:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:41,962 INFO L225 Difference]: With dead ends: 296 [2022-11-03 01:38:41,962 INFO L226 Difference]: Without dead ends: 296 [2022-11-03 01:38:41,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:38:41,964 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:41,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:38:41,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-03 01:38:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-11-03 01:38:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.477966101694915) internal successors, (1026), 295 states have internal predecessors, (1026), 0 states have call successors, (0), 0 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-03 01:38:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 1026 transitions. [2022-11-03 01:38:42,002 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 1026 transitions. Word has length 21 [2022-11-03 01:38:42,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:42,003 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 1026 transitions. [2022-11-03 01:38:42,003 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-03 01:38:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 1026 transitions. [2022-11-03 01:38:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:38:42,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:42,007 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-03 01:38:42,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:38:42,008 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-03 01:38:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1000282230, now seen corresponding path program 1 times [2022-11-03 01:38:42,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:42,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494982938] [2022-11-03 01:38:42,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:42,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:38:42,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:42,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494982938] [2022-11-03 01:38:42,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494982938] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:42,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183601821] [2022-11-03 01:38:42,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:42,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:42,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:42,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:42,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:38:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:42,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 01:38:42,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:38:42,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:38:43,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183601821] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:38:43,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1143190328] [2022-11-03 01:38:43,219 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:38:43,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:38:43,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-03 01:38:43,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412159128] [2022-11-03 01:38:43,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:38:43,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 01:38:43,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:43,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 01:38:43,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:38:43,235 INFO L87 Difference]: Start difference. First operand 296 states and 1026 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-03 01:38:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:43,724 INFO L93 Difference]: Finished difference Result 586 states and 1962 transitions. [2022-11-03 01:38:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:38:43,727 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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-03 01:38:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:43,732 INFO L225 Difference]: With dead ends: 586 [2022-11-03 01:38:43,732 INFO L226 Difference]: Without dead ends: 572 [2022-11-03 01:38:43,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:38:43,737 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 115 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:43,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 37 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:38:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-11-03 01:38:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 502. [2022-11-03 01:38:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 3.4790419161676644) internal successors, (1743), 501 states have internal predecessors, (1743), 0 states have call successors, (0), 0 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-03 01:38:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1743 transitions. [2022-11-03 01:38:43,803 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1743 transitions. Word has length 22 [2022-11-03 01:38:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:43,804 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 1743 transitions. [2022-11-03 01:38:43,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-03 01:38:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1743 transitions. [2022-11-03 01:38:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 01:38:43,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:43,814 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:38:43,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:44,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-03 01:38:44,041 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-03 01:38:44,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:44,042 INFO L85 PathProgramCache]: Analyzing trace with hash -818126279, now seen corresponding path program 2 times [2022-11-03 01:38:44,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:44,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902826879] [2022-11-03 01:38:44,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:44,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:44,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:44,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902826879] [2022-11-03 01:38:44,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902826879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:44,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247510026] [2022-11-03 01:38:44,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:38:44,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:44,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:44,276 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:44,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:38:44,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:38:44,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:38:44,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 01:38:44,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:44,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:44,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247510026] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:44,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:38:44,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2022-11-03 01:38:44,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722897364] [2022-11-03 01:38:44,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:44,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:38:44,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:44,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:38:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:38:44,678 INFO L87 Difference]: Start difference. First operand 502 states and 1743 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:44,914 INFO L93 Difference]: Finished difference Result 556 states and 1917 transitions. [2022-11-03 01:38:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:38:44,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 01:38:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:44,924 INFO L225 Difference]: With dead ends: 556 [2022-11-03 01:38:44,930 INFO L226 Difference]: Without dead ends: 556 [2022-11-03 01:38:44,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:38:44,932 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 64 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:44,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 17 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:38:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-11-03 01:38:44,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 512. [2022-11-03 01:38:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 3.528375733855186) internal successors, (1803), 511 states have internal predecessors, (1803), 0 states have call successors, (0), 0 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-03 01:38:44,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1803 transitions. [2022-11-03 01:38:44,989 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1803 transitions. Word has length 23 [2022-11-03 01:38:44,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:44,990 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 1803 transitions. [2022-11-03 01:38:44,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1803 transitions. [2022-11-03 01:38:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 01:38:44,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:44,993 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-03 01:38:45,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:45,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:45,208 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-03 01:38:45,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:45,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1143255072, now seen corresponding path program 1 times [2022-11-03 01:38:45,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:45,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577253429] [2022-11-03 01:38:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:45,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:38:45,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:45,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577253429] [2022-11-03 01:38:45,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577253429] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:45,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161436914] [2022-11-03 01:38:45,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:45,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:45,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:45,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:45,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:38:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:45,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 01:38:45,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:38:45,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:38:45,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161436914] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:38:45,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1388527523] [2022-11-03 01:38:45,930 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:38:45,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:38:45,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-11-03 01:38:45,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990724298] [2022-11-03 01:38:45,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:38:45,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:38:45,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:45,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:38:45,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:38:45,934 INFO L87 Difference]: Start difference. First operand 512 states and 1803 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:46,382 INFO L93 Difference]: Finished difference Result 486 states and 1579 transitions. [2022-11-03 01:38:46,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:38:46,384 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 01:38:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:46,388 INFO L225 Difference]: With dead ends: 486 [2022-11-03 01:38:46,388 INFO L226 Difference]: Without dead ends: 456 [2022-11-03 01:38:46,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:38:46,390 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 130 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:46,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 29 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:38:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-11-03 01:38:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 422. [2022-11-03 01:38:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.3966745843230406) internal successors, (1430), 421 states have internal predecessors, (1430), 0 states have call successors, (0), 0 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-03 01:38:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1430 transitions. [2022-11-03 01:38:46,420 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1430 transitions. Word has length 23 [2022-11-03 01:38:46,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:46,421 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 1430 transitions. [2022-11-03 01:38:46,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1430 transitions. [2022-11-03 01:38:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 01:38:46,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:46,424 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-03 01:38:46,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:46,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:46,649 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-03 01:38:46,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash -119804464, now seen corresponding path program 1 times [2022-11-03 01:38:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:46,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667005833] [2022-11-03 01:38:46,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:46,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:38:46,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:46,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667005833] [2022-11-03 01:38:46,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667005833] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:46,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257965450] [2022-11-03 01:38:46,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:46,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:46,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:46,830 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:46,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:38:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:46,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 01:38:46,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:38:47,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:38:47,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257965450] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:38:47,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1633501839] [2022-11-03 01:38:47,146 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:38:47,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:38:47,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-03 01:38:47,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091190594] [2022-11-03 01:38:47,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:38:47,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 01:38:47,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:47,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 01:38:47,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:38:47,152 INFO L87 Difference]: Start difference. First operand 422 states and 1430 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-03 01:38:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:47,359 INFO L93 Difference]: Finished difference Result 334 states and 1134 transitions. [2022-11-03 01:38:47,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:38:47,360 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 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-03 01:38:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:47,362 INFO L225 Difference]: With dead ends: 334 [2022-11-03 01:38:47,362 INFO L226 Difference]: Without dead ends: 281 [2022-11-03 01:38:47,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:38:47,364 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:47,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 22 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:38:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-03 01:38:47,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2022-11-03 01:38:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 3.6285714285714286) internal successors, (1016), 280 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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-03 01:38:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 1016 transitions. [2022-11-03 01:38:47,385 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 1016 transitions. Word has length 23 [2022-11-03 01:38:47,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:47,386 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 1016 transitions. [2022-11-03 01:38:47,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-03 01:38:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 1016 transitions. [2022-11-03 01:38:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:38:47,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:47,388 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:38:47,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:47,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:47,613 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-03 01:38:47,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:47,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1232062721, now seen corresponding path program 2 times [2022-11-03 01:38:47,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:47,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885627387] [2022-11-03 01:38:47,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:47,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:47,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:47,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885627387] [2022-11-03 01:38:47,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885627387] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:47,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201407123] [2022-11-03 01:38:47,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:38:47,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:47,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:47,824 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:47,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:38:47,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:38:47,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:38:47,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 01:38:47,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:48,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:48,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201407123] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:48,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:38:48,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 15 [2022-11-03 01:38:48,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981837186] [2022-11-03 01:38:48,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:48,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:38:48,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:48,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:38:48,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:38:48,264 INFO L87 Difference]: Start difference. First operand 281 states and 1016 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:48,528 INFO L93 Difference]: Finished difference Result 417 states and 1520 transitions. [2022-11-03 01:38:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:38:48,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 01:38:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:48,534 INFO L225 Difference]: With dead ends: 417 [2022-11-03 01:38:48,534 INFO L226 Difference]: Without dead ends: 417 [2022-11-03 01:38:48,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-11-03 01:38:48,536 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 104 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:48,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 16 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:38:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-11-03 01:38:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 325. [2022-11-03 01:38:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 3.6018518518518516) internal successors, (1167), 324 states have internal predecessors, (1167), 0 states have call successors, (0), 0 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-03 01:38:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 1167 transitions. [2022-11-03 01:38:48,555 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 1167 transitions. Word has length 24 [2022-11-03 01:38:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:48,555 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 1167 transitions. [2022-11-03 01:38:48,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 1167 transitions. [2022-11-03 01:38:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:38:48,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:48,558 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:38:48,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:48,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 01:38:48,785 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-03 01:38:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1785255867, now seen corresponding path program 1 times [2022-11-03 01:38:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:48,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130343653] [2022-11-03 01:38:48,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:38:48,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:48,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130343653] [2022-11-03 01:38:48,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130343653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:38:48,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:38:48,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:38:48,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359333815] [2022-11-03 01:38:48,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:48,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:38:48,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:48,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:38:48,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:38:48,910 INFO L87 Difference]: Start difference. First operand 325 states and 1167 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:48,994 INFO L93 Difference]: Finished difference Result 359 states and 1256 transitions. [2022-11-03 01:38:48,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:38:48,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 01:38:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:48,998 INFO L225 Difference]: With dead ends: 359 [2022-11-03 01:38:48,998 INFO L226 Difference]: Without dead ends: 359 [2022-11-03 01:38:48,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-03 01:38:49,000 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:49,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:38:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-03 01:38:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 301. [2022-11-03 01:38:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.55) internal successors, (1065), 300 states have internal predecessors, (1065), 0 states have call successors, (0), 0 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-03 01:38:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 1065 transitions. [2022-11-03 01:38:49,017 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 1065 transitions. Word has length 24 [2022-11-03 01:38:49,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:49,018 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 1065 transitions. [2022-11-03 01:38:49,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:49,018 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 1065 transitions. [2022-11-03 01:38:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:38:49,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:49,020 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:38:49,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 01:38:49,021 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-03 01:38:49,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:49,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1441151645, now seen corresponding path program 3 times [2022-11-03 01:38:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:49,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131309262] [2022-11-03 01:38:49,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:49,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:49,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:49,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131309262] [2022-11-03 01:38:49,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131309262] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:49,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893761315] [2022-11-03 01:38:49,212 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:38:49,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:49,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:49,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:49,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:38:49,334 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:38:49,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:38:49,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 01:38:49,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:49,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:49,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893761315] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:49,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:38:49,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 17 [2022-11-03 01:38:49,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228730118] [2022-11-03 01:38:49,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:49,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:38:49,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:49,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:38:49,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-11-03 01:38:49,573 INFO L87 Difference]: Start difference. First operand 301 states and 1065 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:49,830 INFO L93 Difference]: Finished difference Result 459 states and 1634 transitions. [2022-11-03 01:38:49,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:38:49,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 01:38:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:49,834 INFO L225 Difference]: With dead ends: 459 [2022-11-03 01:38:49,834 INFO L226 Difference]: Without dead ends: 459 [2022-11-03 01:38:49,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2022-11-03 01:38:49,835 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 146 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:49,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 12 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:38:49,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-11-03 01:38:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 329. [2022-11-03 01:38:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 3.643292682926829) internal successors, (1195), 328 states have internal predecessors, (1195), 0 states have call successors, (0), 0 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-03 01:38:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1195 transitions. [2022-11-03 01:38:49,855 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1195 transitions. Word has length 24 [2022-11-03 01:38:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:49,855 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 1195 transitions. [2022-11-03 01:38:49,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1195 transitions. [2022-11-03 01:38:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:38:49,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:49,858 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:38:49,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:50,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-03 01:38:50,085 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-03 01:38:50,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:50,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1038718437, now seen corresponding path program 4 times [2022-11-03 01:38:50,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:50,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349087081] [2022-11-03 01:38:50,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:50,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:50,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:50,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349087081] [2022-11-03 01:38:50,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349087081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:50,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170413612] [2022-11-03 01:38:50,273 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:38:50,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:50,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:50,275 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:50,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:38:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:50,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 01:38:50,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:50,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:50,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170413612] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:50,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:38:50,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2022-11-03 01:38:50,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746459197] [2022-11-03 01:38:50,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:50,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:38:50,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:50,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:38:50,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:38:50,670 INFO L87 Difference]: Start difference. First operand 329 states and 1195 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:50,970 INFO L93 Difference]: Finished difference Result 515 states and 1855 transitions. [2022-11-03 01:38:50,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:38:50,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 01:38:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:50,975 INFO L225 Difference]: With dead ends: 515 [2022-11-03 01:38:50,975 INFO L226 Difference]: Without dead ends: 515 [2022-11-03 01:38:50,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-11-03 01:38:50,976 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 109 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:50,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 13 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:38:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-11-03 01:38:50,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 329. [2022-11-03 01:38:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 3.643292682926829) internal successors, (1195), 328 states have internal predecessors, (1195), 0 states have call successors, (0), 0 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-03 01:38:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1195 transitions. [2022-11-03 01:38:50,998 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1195 transitions. Word has length 24 [2022-11-03 01:38:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:50,998 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 1195 transitions. [2022-11-03 01:38:50,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1195 transitions. [2022-11-03 01:38:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:38:51,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:51,001 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:38:51,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:51,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:51,217 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-03 01:38:51,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash -281223985, now seen corresponding path program 5 times [2022-11-03 01:38:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:51,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961026319] [2022-11-03 01:38:51,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:51,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:51,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:51,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961026319] [2022-11-03 01:38:51,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961026319] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:51,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653514223] [2022-11-03 01:38:51,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:38:51,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:51,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:51,445 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:51,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:38:51,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:38:51,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:38:51,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 01:38:51,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:51,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:51,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653514223] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:51,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:38:51,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 17 [2022-11-03 01:38:51,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454760397] [2022-11-03 01:38:51,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:51,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:38:51,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:51,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:38:51,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-11-03 01:38:51,897 INFO L87 Difference]: Start difference. First operand 329 states and 1195 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:52,182 INFO L93 Difference]: Finished difference Result 499 states and 1774 transitions. [2022-11-03 01:38:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:38:52,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 01:38:52,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:52,187 INFO L225 Difference]: With dead ends: 499 [2022-11-03 01:38:52,188 INFO L226 Difference]: Without dead ends: 499 [2022-11-03 01:38:52,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2022-11-03 01:38:52,189 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 125 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:52,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 14 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:38:52,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-11-03 01:38:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 345. [2022-11-03 01:38:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 3.73546511627907) internal successors, (1285), 344 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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-03 01:38:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1285 transitions. [2022-11-03 01:38:52,210 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1285 transitions. Word has length 24 [2022-11-03 01:38:52,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:52,210 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 1285 transitions. [2022-11-03 01:38:52,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:52,211 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1285 transitions. [2022-11-03 01:38:52,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:38:52,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:52,212 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:38:52,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:52,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 01:38:52,429 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-03 01:38:52,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:52,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1533873229, now seen corresponding path program 6 times [2022-11-03 01:38:52,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:52,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355925389] [2022-11-03 01:38:52,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:52,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:52,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:52,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355925389] [2022-11-03 01:38:52,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355925389] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:52,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355297128] [2022-11-03 01:38:52,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:38:52,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:52,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:52,614 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:52,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 01:38:52,761 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:38:52,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:38:52,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 01:38:52,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:52,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:53,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355297128] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:53,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:38:53,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2022-11-03 01:38:53,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102066379] [2022-11-03 01:38:53,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:53,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:38:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:53,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:38:53,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:38:53,023 INFO L87 Difference]: Start difference. First operand 345 states and 1285 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:53,383 INFO L93 Difference]: Finished difference Result 543 states and 1952 transitions. [2022-11-03 01:38:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:38:53,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 01:38:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:53,388 INFO L225 Difference]: With dead ends: 543 [2022-11-03 01:38:53,388 INFO L226 Difference]: Without dead ends: 543 [2022-11-03 01:38:53,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2022-11-03 01:38:53,389 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 95 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:53,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 16 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:38:53,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-11-03 01:38:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 331. [2022-11-03 01:38:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 3.6333333333333333) internal successors, (1199), 330 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 1199 transitions. [2022-11-03 01:38:53,410 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 1199 transitions. Word has length 24 [2022-11-03 01:38:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:53,410 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 1199 transitions. [2022-11-03 01:38:53,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 1199 transitions. [2022-11-03 01:38:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:38:53,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:53,413 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:38:53,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:53,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 01:38:53,636 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-03 01:38:53,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:53,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1139318205, now seen corresponding path program 7 times [2022-11-03 01:38:53,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:53,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619273420] [2022-11-03 01:38:53,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:53,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:53,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:53,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619273420] [2022-11-03 01:38:53,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619273420] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:53,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622826049] [2022-11-03 01:38:53,831 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:38:53,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:53,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:53,833 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:53,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 01:38:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:53,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 01:38:53,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:54,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:38:54,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622826049] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:54,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:38:54,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 15 [2022-11-03 01:38:54,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942242915] [2022-11-03 01:38:54,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:54,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:38:54,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:54,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:38:54,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:38:54,249 INFO L87 Difference]: Start difference. First operand 331 states and 1199 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:54,596 INFO L93 Difference]: Finished difference Result 425 states and 1535 transitions. [2022-11-03 01:38:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:38:54,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 01:38:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:54,601 INFO L225 Difference]: With dead ends: 425 [2022-11-03 01:38:54,601 INFO L226 Difference]: Without dead ends: 425 [2022-11-03 01:38:54,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-11-03 01:38:54,602 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 96 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:54,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 22 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:38:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-11-03 01:38:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 333. [2022-11-03 01:38:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 3.61144578313253) internal successors, (1199), 332 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1199 transitions. [2022-11-03 01:38:54,620 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1199 transitions. Word has length 24 [2022-11-03 01:38:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:54,621 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 1199 transitions. [2022-11-03 01:38:54,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1199 transitions. [2022-11-03 01:38:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:38:54,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:54,623 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:38:54,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:54,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 01:38:54,833 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-03 01:38:54,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash -826068459, now seen corresponding path program 1 times [2022-11-03 01:38:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:54,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267060319] [2022-11-03 01:38:54,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:54,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:38:58,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:58,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267060319] [2022-11-03 01:38:58,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267060319] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:58,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136610398] [2022-11-03 01:38:58,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:58,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:58,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:58,159 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:58,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 01:38:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:58,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 01:38:58,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:59,585 INFO L356 Elim1Store]: treesize reduction 52, result has 60.9 percent of original size [2022-11-03 01:38:59,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 122 [2022-11-03 01:39:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:39:00,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:39:00,964 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:39:00,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 148 [2022-11-03 01:39:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:39:01,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136610398] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:39:01,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [812178872] [2022-11-03 01:39:01,901 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:39:01,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:39:01,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 33 [2022-11-03 01:39:01,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194105185] [2022-11-03 01:39:01,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:39:01,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 01:39:01,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:01,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 01:39:01,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 01:39:01,906 INFO L87 Difference]: Start difference. First operand 333 states and 1199 transitions. Second operand has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:39:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:57,587 INFO L93 Difference]: Finished difference Result 6357 states and 22197 transitions. [2022-11-03 01:39:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2022-11-03 01:39:57,588 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:39:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:57,630 INFO L225 Difference]: With dead ends: 6357 [2022-11-03 01:39:57,630 INFO L226 Difference]: Without dead ends: 6077 [2022-11-03 01:39:57,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25440 ImplicationChecksByTransitivity, 47.4s TimeCoverageRelationStatistics Valid=7714, Invalid=55036, Unknown=0, NotChecked=0, Total=62750 [2022-11-03 01:39:57,643 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1040 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 6503 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 7092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 6503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:57,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 234 Invalid, 7092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 6503 Invalid, 0 Unknown, 281 Unchecked, 9.1s Time] [2022-11-03 01:39:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6077 states. [2022-11-03 01:39:57,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6077 to 733. [2022-11-03 01:39:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 732 states have (on average 4.116120218579235) internal successors, (3013), 732 states have internal predecessors, (3013), 0 states have call successors, (0), 0 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-03 01:39:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 3013 transitions. [2022-11-03 01:39:57,773 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 3013 transitions. Word has length 25 [2022-11-03 01:39:57,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:57,773 INFO L495 AbstractCegarLoop]: Abstraction has 733 states and 3013 transitions. [2022-11-03 01:39:57,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:39:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 3013 transitions. [2022-11-03 01:39:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:39:57,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:57,779 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:57,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:57,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 01:39:57,997 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-03 01:39:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:57,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1171773339, now seen corresponding path program 2 times [2022-11-03 01:39:57,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:57,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403062891] [2022-11-03 01:39:57,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:57,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:40:00,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:40:00,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403062891] [2022-11-03 01:40:00,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403062891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:40:00,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31187310] [2022-11-03 01:40:00,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:40:00,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:40:00,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:40:00,319 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:40:00,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 01:40:00,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:40:00,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:40:00,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 01:40:00,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:40:01,685 INFO L356 Elim1Store]: treesize reduction 52, result has 60.9 percent of original size [2022-11-03 01:40:01,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 122 [2022-11-03 01:40:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:40:02,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:40:02,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:40:02,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 148 [2022-11-03 01:40:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:40:03,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31187310] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:40:03,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [481679751] [2022-11-03 01:40:03,795 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:40:03,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:40:03,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 33 [2022-11-03 01:40:03,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454307512] [2022-11-03 01:40:03,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:40:03,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 01:40:03,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:40:03,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 01:40:03,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 01:40:03,798 INFO L87 Difference]: Start difference. First operand 733 states and 3013 transitions. Second operand has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:40:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:40:19,529 INFO L93 Difference]: Finished difference Result 3487 states and 12962 transitions. [2022-11-03 01:40:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-11-03 01:40:19,530 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:40:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:40:19,560 INFO L225 Difference]: With dead ends: 3487 [2022-11-03 01:40:19,560 INFO L226 Difference]: Without dead ends: 3467 [2022-11-03 01:40:19,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2981 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=1441, Invalid=8261, Unknown=0, NotChecked=0, Total=9702 [2022-11-03 01:40:19,562 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 729 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 3107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 350 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:40:19,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 155 Invalid, 3107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 2608 Invalid, 0 Unknown, 350 Unchecked, 3.6s Time] [2022-11-03 01:40:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2022-11-03 01:40:19,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 737. [2022-11-03 01:40:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 4.118206521739131) internal successors, (3031), 736 states have internal predecessors, (3031), 0 states have call successors, (0), 0 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-03 01:40:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 3031 transitions. [2022-11-03 01:40:19,629 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 3031 transitions. Word has length 25 [2022-11-03 01:40:19,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:40:19,630 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 3031 transitions. [2022-11-03 01:40:19,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:40:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 3031 transitions. [2022-11-03 01:40:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:40:19,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:19,634 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:40:19,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-03 01:40:19,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 01:40:19,849 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-03 01:40:19,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:19,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1559585947, now seen corresponding path program 3 times [2022-11-03 01:40:19,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:19,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9761226] [2022-11-03 01:40:19,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:19,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:40:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:40:22,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:40:22,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9761226] [2022-11-03 01:40:22,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9761226] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:40:22,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114682942] [2022-11-03 01:40:22,016 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:40:22,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:40:22,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:40:22,018 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:40:22,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 01:40:22,215 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:40:22,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:40:22,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 01:40:22,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:40:22,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:40:22,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:40:22,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:40:22,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:40:23,564 INFO L356 Elim1Store]: treesize reduction 52, result has 60.9 percent of original size [2022-11-03 01:40:23,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 122 [2022-11-03 01:40:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:40:24,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:40:25,368 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod c_~sorted1~0 256) 0) (let ((.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse2 (+ c_~A~0.offset 4)) (.cse0 (not (< (+ c_~M~0 1) c_~N~0)))) (and (or .cse0 (forall ((v_ArrVal_681 (Array Int Int))) (not (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (< (select .cse1 c_~A~0.offset) (select .cse1 .cse2))))) (not .cse3)) (or .cse3 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse7 (= (mod c_~sorted2~0 256) 0)) (.cse5 (+ c_~A~0.offset .cse10)) (.cse6 (+ c_~A~0.offset .cse10 4))) (and (or (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (or (< (select .cse4 c_~A~0.offset) (select .cse4 .cse2)) (not (< (select .cse4 .cse5) (select .cse4 .cse6)))))) .cse7) (or (not .cse7) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (or (not (< (select .cse8 c_~A~0.offset) (select .cse8 .cse2))) (not (< (select .cse8 .cse5) (select .cse8 .cse6))))))) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (or (not (< (select .cse9 c_~A~0.offset) (select .cse9 .cse2))) (< (select .cse9 .cse5) (select .cse9 .cse6)))))))) .cse0)))) is different from false [2022-11-03 01:40:25,466 WARN L833 $PredicateComparison]: unable to prove that (or (< c_thread2Thread1of1ForFork2_~i~1 c_~M~0) (= (mod c_~sorted1~0 256) 0) (let ((.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse2 (+ c_~A~0.offset 4)) (.cse0 (not (< (+ c_~M~0 1) c_~N~0)))) (and (or .cse0 (forall ((v_ArrVal_681 (Array Int Int))) (not (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (< (select .cse1 c_~A~0.offset) (select .cse1 .cse2))))) (not .cse3)) (or .cse3 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse7 (= (mod c_~sorted2~0 256) 0)) (.cse5 (+ c_~A~0.offset .cse10)) (.cse6 (+ c_~A~0.offset .cse10 4))) (and (or (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (or (< (select .cse4 c_~A~0.offset) (select .cse4 .cse2)) (not (< (select .cse4 .cse5) (select .cse4 .cse6)))))) .cse7) (or (not .cse7) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (or (not (< (select .cse8 c_~A~0.offset) (select .cse8 .cse2))) (not (< (select .cse8 .cse5) (select .cse8 .cse6))))))) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (or (not (< (select .cse9 c_~A~0.offset) (select .cse9 .cse2))) (< (select .cse9 .cse5) (select .cse9 .cse6)))))))) .cse0)))) is different from false [2022-11-03 01:40:25,562 WARN L833 $PredicateComparison]: unable to prove that (or (< 0 c_~M~0) (= (mod c_~sorted1~0 256) 0) (let ((.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse2 (+ c_~A~0.offset 4)) (.cse0 (not (< (+ c_~M~0 1) c_~N~0)))) (and (or .cse0 (forall ((v_ArrVal_681 (Array Int Int))) (not (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (< (select .cse1 c_~A~0.offset) (select .cse1 .cse2))))) (not .cse3)) (or .cse3 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse7 (= (mod c_~sorted2~0 256) 0)) (.cse5 (+ c_~A~0.offset .cse10)) (.cse6 (+ c_~A~0.offset .cse10 4))) (and (or (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (or (< (select .cse4 c_~A~0.offset) (select .cse4 .cse2)) (not (< (select .cse4 .cse5) (select .cse4 .cse6)))))) .cse7) (or (not .cse7) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (or (not (< (select .cse8 c_~A~0.offset) (select .cse8 .cse2))) (not (< (select .cse8 .cse5) (select .cse8 .cse6))))))) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (or (not (< (select .cse9 c_~A~0.offset) (select .cse9 .cse2))) (< (select .cse9 .cse5) (select .cse9 .cse6)))))))) .cse0)))) is different from false [2022-11-03 01:40:25,760 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse2 (not (< (+ c_~M~0 1) c_~N~0))) (.cse1 (+ c_~A~0.offset 4))) (and (or (forall ((v_ArrVal_681 (Array Int Int)) (v_ArrVal_680 (Array Int Int))) (not (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (< (select .cse0 c_~A~0.offset) (select .cse0 .cse1))))) .cse2 (not .cse3)) (or .cse3 .cse2 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse4 (= (mod c_~sorted2~0 256) 0)) (.cse6 (+ c_~A~0.offset .cse10)) (.cse7 (+ c_~A~0.offset .cse10 4))) (and (or (not .cse4) (forall ((v_ArrVal_681 (Array Int Int)) (v_ArrVal_680 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (or (not (< (select .cse5 .cse6) (select .cse5 .cse7))) (not (< (select .cse5 c_~A~0.offset) (select .cse5 .cse1))))))) (or (forall ((v_ArrVal_681 (Array Int Int)) (v_ArrVal_680 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (or (< (select .cse8 c_~A~0.offset) (select .cse8 .cse1)) (not (< (select .cse8 .cse6) (select .cse8 .cse7)))))) .cse4) (forall ((v_ArrVal_681 (Array Int Int)) (v_ArrVal_680 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~A~0.base))) (or (< (select .cse9 .cse6) (select .cse9 .cse7)) (not (< (select .cse9 c_~A~0.offset) (select .cse9 .cse1)))))))))))) (< 0 c_~M~0) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:40:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:40:25,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114682942] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:40:25,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1677346850] [2022-11-03 01:40:25,949 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:40:25,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:40:25,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 36 [2022-11-03 01:40:25,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056925603] [2022-11-03 01:40:25,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:40:25,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 01:40:25,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:40:25,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 01:40:25,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=943, Unknown=4, NotChecked=260, Total=1332 [2022-11-03 01:40:25,958 INFO L87 Difference]: Start difference. First operand 737 states and 3031 transitions. Second operand has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:40:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:40:53,717 INFO L93 Difference]: Finished difference Result 3480 states and 12261 transitions. [2022-11-03 01:40:53,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-11-03 01:40:53,718 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:40:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:40:53,736 INFO L225 Difference]: With dead ends: 3480 [2022-11-03 01:40:53,737 INFO L226 Difference]: Without dead ends: 3424 [2022-11-03 01:40:53,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 136 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6431 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=2344, Invalid=15490, Unknown=4, NotChecked=1068, Total=18906 [2022-11-03 01:40:53,740 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 709 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 4135 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 5834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 4135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1558 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:40:53,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 234 Invalid, 5834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 4135 Invalid, 0 Unknown, 1558 Unchecked, 5.3s Time] [2022-11-03 01:40:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3424 states. [2022-11-03 01:40:53,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3424 to 862. [2022-11-03 01:40:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 861 states have (on average 4.1277584204413476) internal successors, (3554), 861 states have internal predecessors, (3554), 0 states have call successors, (0), 0 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-03 01:40:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 3554 transitions. [2022-11-03 01:40:53,838 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 3554 transitions. Word has length 25 [2022-11-03 01:40:53,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:40:53,839 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 3554 transitions. [2022-11-03 01:40:53,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:40:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 3554 transitions. [2022-11-03 01:40:53,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:40:53,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:53,843 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:40:53,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-03 01:40:54,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 01:40:54,062 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-03 01:40:54,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:54,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1337754477, now seen corresponding path program 4 times [2022-11-03 01:40:54,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:54,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266526888] [2022-11-03 01:40:54,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:54,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:40:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:40:56,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:40:56,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266526888] [2022-11-03 01:40:56,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266526888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:40:56,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773665290] [2022-11-03 01:40:56,739 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:40:56,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:40:56,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:40:56,742 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:40:56,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 01:40:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:56,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 01:40:56,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:40:58,027 INFO L356 Elim1Store]: treesize reduction 64, result has 51.9 percent of original size [2022-11-03 01:40:58,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 110 [2022-11-03 01:40:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:40:58,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:40:59,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:40:59,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 148 [2022-11-03 01:41:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:41:00,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773665290] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:00,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1048606167] [2022-11-03 01:41:00,745 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:41:00,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:00,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 33 [2022-11-03 01:41:00,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666253900] [2022-11-03 01:41:00,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:00,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 01:41:00,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:00,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 01:41:00,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 01:41:00,748 INFO L87 Difference]: Start difference. First operand 862 states and 3554 transitions. Second operand has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:41:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:27,727 INFO L93 Difference]: Finished difference Result 3458 states and 12648 transitions. [2022-11-03 01:41:27,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-11-03 01:41:27,728 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:41:27,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:27,742 INFO L225 Difference]: With dead ends: 3458 [2022-11-03 01:41:27,742 INFO L226 Difference]: Without dead ends: 3440 [2022-11-03 01:41:27,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8166 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=2770, Invalid=20182, Unknown=0, NotChecked=0, Total=22952 [2022-11-03 01:41:27,746 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 504 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 5727 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 6549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 5727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 692 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:27,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 323 Invalid, 6549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 5727 Invalid, 0 Unknown, 692 Unchecked, 6.4s Time] [2022-11-03 01:41:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2022-11-03 01:41:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 862. [2022-11-03 01:41:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 861 states have (on average 4.1173054587688735) internal successors, (3545), 861 states have internal predecessors, (3545), 0 states have call successors, (0), 0 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-03 01:41:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 3545 transitions. [2022-11-03 01:41:27,816 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 3545 transitions. Word has length 25 [2022-11-03 01:41:27,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:27,816 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 3545 transitions. [2022-11-03 01:41:27,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:41:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 3545 transitions. [2022-11-03 01:41:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:41:27,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:27,820 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:27,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-03 01:41:28,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:28,027 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-03 01:41:28,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:28,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1061326589, now seen corresponding path program 5 times [2022-11-03 01:41:28,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:28,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636261714] [2022-11-03 01:41:28,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:28,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:29,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:29,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636261714] [2022-11-03 01:41:29,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636261714] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:29,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117626333] [2022-11-03 01:41:29,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:41:29,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:29,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:29,618 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:29,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 01:41:29,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:41:29,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:41:29,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 01:41:29,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:29,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:41:30,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:41:30,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:41:30,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:41:30,956 INFO L356 Elim1Store]: treesize reduction 64, result has 51.9 percent of original size [2022-11-03 01:41:30,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 110 [2022-11-03 01:41:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:31,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:32,798 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse1 (= (mod c_~sorted3~0 256) 0)) (.cse3 (+ c_~A~0.offset 4)) (.cse0 (not (< (+ c_~M~0 1) c_~N~0)))) (and (or .cse0 (not .cse1) (forall ((v_ArrVal_782 (Array Int Int))) (not (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (< (select .cse2 c_~A~0.offset) (select .cse2 .cse3)))))) (or .cse1 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse6 (+ c_~A~0.offset .cse10)) (.cse7 (+ c_~A~0.offset .cse10 4)) (.cse4 (= (mod c_~sorted2~0 256) 0))) (and (or (not .cse4) (forall ((v_ArrVal_782 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (or (not (< (select .cse5 c_~A~0.offset) (select .cse5 .cse3))) (not (< (select .cse5 .cse6) (select .cse5 .cse7))))))) (forall ((v_ArrVal_782 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (or (not (< (select .cse8 c_~A~0.offset) (select .cse8 .cse3))) (< (select .cse8 .cse6) (select .cse8 .cse7))))) (or (forall ((v_ArrVal_782 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (or (< (select .cse9 c_~A~0.offset) (select .cse9 .cse3)) (not (< (select .cse9 .cse6) (select .cse9 .cse7)))))) .cse4)))) .cse0))) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:41:32,880 WARN L833 $PredicateComparison]: unable to prove that (or (< c_thread2Thread1of1ForFork2_~i~1 c_~M~0) (let ((.cse1 (= (mod c_~sorted3~0 256) 0)) (.cse3 (+ c_~A~0.offset 4)) (.cse0 (not (< (+ c_~M~0 1) c_~N~0)))) (and (or .cse0 (not .cse1) (forall ((v_ArrVal_782 (Array Int Int))) (not (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (< (select .cse2 c_~A~0.offset) (select .cse2 .cse3)))))) (or .cse1 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse6 (+ c_~A~0.offset .cse10)) (.cse7 (+ c_~A~0.offset .cse10 4)) (.cse4 (= (mod c_~sorted2~0 256) 0))) (and (or (not .cse4) (forall ((v_ArrVal_782 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (or (not (< (select .cse5 c_~A~0.offset) (select .cse5 .cse3))) (not (< (select .cse5 .cse6) (select .cse5 .cse7))))))) (forall ((v_ArrVal_782 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (or (not (< (select .cse8 c_~A~0.offset) (select .cse8 .cse3))) (< (select .cse8 .cse6) (select .cse8 .cse7))))) (or (forall ((v_ArrVal_782 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (or (< (select .cse9 c_~A~0.offset) (select .cse9 .cse3)) (not (< (select .cse9 .cse6) (select .cse9 .cse7)))))) .cse4)))) .cse0))) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:41:32,970 WARN L833 $PredicateComparison]: unable to prove that (or (< 0 c_~M~0) (let ((.cse1 (= (mod c_~sorted3~0 256) 0)) (.cse3 (+ c_~A~0.offset 4)) (.cse0 (not (< (+ c_~M~0 1) c_~N~0)))) (and (or .cse0 (not .cse1) (forall ((v_ArrVal_782 (Array Int Int))) (not (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (< (select .cse2 c_~A~0.offset) (select .cse2 .cse3)))))) (or .cse1 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse6 (+ c_~A~0.offset .cse10)) (.cse7 (+ c_~A~0.offset .cse10 4)) (.cse4 (= (mod c_~sorted2~0 256) 0))) (and (or (not .cse4) (forall ((v_ArrVal_782 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (or (not (< (select .cse5 c_~A~0.offset) (select .cse5 .cse3))) (not (< (select .cse5 .cse6) (select .cse5 .cse7))))))) (forall ((v_ArrVal_782 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (or (not (< (select .cse8 c_~A~0.offset) (select .cse8 .cse3))) (< (select .cse8 .cse6) (select .cse8 .cse7))))) (or (forall ((v_ArrVal_782 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (or (< (select .cse9 c_~A~0.offset) (select .cse9 .cse3)) (not (< (select .cse9 .cse6) (select .cse9 .cse7)))))) .cse4)))) .cse0))) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:41:33,116 WARN L833 $PredicateComparison]: unable to prove that (or (< 0 c_~M~0) (= (mod c_~sorted1~0 256) 0) (let ((.cse9 (not (< (+ c_~M~0 1) c_~N~0))) (.cse0 (= (mod c_~sorted3~0 256) 0)) (.cse5 (+ c_~A~0.offset 4))) (and (or .cse0 (let ((.cse8 (* 4 c_~M~0))) (let ((.cse3 (+ c_~A~0.offset .cse8)) (.cse4 (+ c_~A~0.offset .cse8 4)) (.cse1 (= (mod c_~sorted2~0 256) 0))) (and (or .cse1 (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_781 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (or (not (< (select .cse2 .cse3) (select .cse2 .cse4))) (< (select .cse2 c_~A~0.offset) (select .cse2 .cse5)))))) (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_781 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (or (< (select .cse6 .cse3) (select .cse6 .cse4)) (not (< (select .cse6 c_~A~0.offset) (select .cse6 .cse5)))))) (or (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_781 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (or (not (< (select .cse7 .cse3) (select .cse7 .cse4))) (not (< (select .cse7 c_~A~0.offset) (select .cse7 .cse5)))))) (not .cse1))))) .cse9) (or .cse9 (not .cse0) (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_781 (Array Int Int))) (not (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_782) c_~A~0.base))) (< (select .cse10 c_~A~0.offset) (select .cse10 .cse5))))))))) is different from false [2022-11-03 01:41:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:41:33,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117626333] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:33,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1053367304] [2022-11-03 01:41:33,263 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:41:33,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:33,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 36 [2022-11-03 01:41:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409321210] [2022-11-03 01:41:33,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:33,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 01:41:33,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:33,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 01:41:33,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=939, Unknown=4, NotChecked=260, Total=1332 [2022-11-03 01:41:33,266 INFO L87 Difference]: Start difference. First operand 862 states and 3545 transitions. Second operand has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:42:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:42:00,648 INFO L93 Difference]: Finished difference Result 3047 states and 11202 transitions. [2022-11-03 01:42:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-11-03 01:42:00,648 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:42:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:42:00,665 INFO L225 Difference]: With dead ends: 3047 [2022-11-03 01:42:00,665 INFO L226 Difference]: Without dead ends: 2985 [2022-11-03 01:42:00,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4657 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=2021, Invalid=11797, Unknown=4, NotChecked=940, Total=14762 [2022-11-03 01:42:00,667 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 638 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 3435 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 4933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 3435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1388 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:42:00,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 165 Invalid, 4933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 3435 Invalid, 0 Unknown, 1388 Unchecked, 4.1s Time] [2022-11-03 01:42:00,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2022-11-03 01:42:00,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 895. [2022-11-03 01:42:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 4.218120805369128) internal successors, (3771), 894 states have internal predecessors, (3771), 0 states have call successors, (0), 0 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-03 01:42:00,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 3771 transitions. [2022-11-03 01:42:00,721 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 3771 transitions. Word has length 25 [2022-11-03 01:42:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:42:00,721 INFO L495 AbstractCegarLoop]: Abstraction has 895 states and 3771 transitions. [2022-11-03 01:42:00,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:42:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 3771 transitions. [2022-11-03 01:42:00,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:42:00,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:42:00,725 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:42:00,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 01:42:00,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 01:42:00,931 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-03 01:42:00,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:42:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1328994859, now seen corresponding path program 6 times [2022-11-03 01:42:00,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:42:00,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563756023] [2022-11-03 01:42:00,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:42:00,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:42:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:42:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:42:02,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:42:02,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563756023] [2022-11-03 01:42:02,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563756023] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:42:02,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669772781] [2022-11-03 01:42:02,462 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:42:02,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:42:02,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:42:02,463 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:42:02,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 01:42:02,710 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:42:02,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:42:02,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 01:42:02,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:42:02,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:42:02,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:42:02,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:42:03,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:42:03,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:42:03,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:42:03,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:42:03,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:42:03,434 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:42:03,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 36 [2022-11-03 01:42:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:42:03,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:42:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:42:05,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669772781] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:42:05,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1655952421] [2022-11-03 01:42:05,651 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:42:05,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:42:05,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 34 [2022-11-03 01:42:05,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827153217] [2022-11-03 01:42:05,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:42:05,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 01:42:05,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:42:05,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 01:42:05,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1026, Unknown=17, NotChecked=0, Total=1190 [2022-11-03 01:42:05,656 INFO L87 Difference]: Start difference. First operand 895 states and 3771 transitions. Second operand has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 35 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:42:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:42:47,373 INFO L93 Difference]: Finished difference Result 6661 states and 25229 transitions. [2022-11-03 01:42:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-11-03 01:42:47,373 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 35 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:42:47,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:42:47,394 INFO L225 Difference]: With dead ends: 6661 [2022-11-03 01:42:47,395 INFO L226 Difference]: Without dead ends: 6563 [2022-11-03 01:42:47,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8741 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=3763, Invalid=19782, Unknown=17, NotChecked=0, Total=23562 [2022-11-03 01:42:47,397 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 979 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 4573 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 5708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 4573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 899 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:42:47,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 350 Invalid, 5708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 4573 Invalid, 0 Unknown, 899 Unchecked, 6.1s Time] [2022-11-03 01:42:47,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6563 states. [2022-11-03 01:42:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6563 to 1304. [2022-11-03 01:42:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1303 states have (on average 4.472755180353031) internal successors, (5828), 1303 states have internal predecessors, (5828), 0 states have call successors, (0), 0 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-03 01:42:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 5828 transitions. [2022-11-03 01:42:47,507 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 5828 transitions. Word has length 25 [2022-11-03 01:42:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:42:47,507 INFO L495 AbstractCegarLoop]: Abstraction has 1304 states and 5828 transitions. [2022-11-03 01:42:47,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 35 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:42:47,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 5828 transitions. [2022-11-03 01:42:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:42:47,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:42:47,513 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:42:47,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 01:42:47,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:42:47,727 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-03 01:42:47,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:42:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1352405703, now seen corresponding path program 7 times [2022-11-03 01:42:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:42:47,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731203862] [2022-11-03 01:42:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:42:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:42:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:42:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:42:49,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:42:49,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731203862] [2022-11-03 01:42:49,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731203862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:42:49,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666608378] [2022-11-03 01:42:49,669 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:42:49,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:42:49,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:42:49,671 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:42:49,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 01:42:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:42:49,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 01:42:49,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:42:50,443 INFO L356 Elim1Store]: treesize reduction 58, result has 56.4 percent of original size [2022-11-03 01:42:50,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 116 [2022-11-03 01:42:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:42:50,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:42:51,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:42:51,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 4 [2022-11-03 01:42:51,356 INFO L356 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2022-11-03 01:42:51,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 43 [2022-11-03 01:42:51,409 INFO L356 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-03 01:42:51,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 34 [2022-11-03 01:42:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:42:51,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666608378] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:42:51,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1934567945] [2022-11-03 01:42:51,880 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:42:51,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:42:51,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 33 [2022-11-03 01:42:51,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47878238] [2022-11-03 01:42:51,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:42:51,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 01:42:51,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:42:51,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 01:42:51,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 01:42:51,884 INFO L87 Difference]: Start difference. First operand 1304 states and 5828 transitions. Second operand has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:43:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:10,344 INFO L93 Difference]: Finished difference Result 3366 states and 13068 transitions. [2022-11-03 01:43:10,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-03 01:43:10,345 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:43:10,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:10,357 INFO L225 Difference]: With dead ends: 3366 [2022-11-03 01:43:10,357 INFO L226 Difference]: Without dead ends: 3317 [2022-11-03 01:43:10,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=1811, Invalid=9319, Unknown=0, NotChecked=0, Total=11130 [2022-11-03 01:43:10,359 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 701 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 3855 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 4212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 3855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:10,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 194 Invalid, 4212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 3855 Invalid, 0 Unknown, 224 Unchecked, 3.8s Time] [2022-11-03 01:43:10,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-11-03 01:43:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 1382. [2022-11-03 01:43:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1381 states have (on average 4.55032585083273) internal successors, (6284), 1381 states have internal predecessors, (6284), 0 states have call successors, (0), 0 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-03 01:43:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 6284 transitions. [2022-11-03 01:43:10,426 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 6284 transitions. Word has length 25 [2022-11-03 01:43:10,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:10,426 INFO L495 AbstractCegarLoop]: Abstraction has 1382 states and 6284 transitions. [2022-11-03 01:43:10,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:43:10,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 6284 transitions. [2022-11-03 01:43:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:43:10,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:10,431 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:10,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:10,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:10,657 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-03 01:43:10,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:10,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1124773715, now seen corresponding path program 8 times [2022-11-03 01:43:10,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:10,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133810574] [2022-11-03 01:43:10,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:10,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:11,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:11,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133810574] [2022-11-03 01:43:11,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133810574] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:43:11,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786273624] [2022-11-03 01:43:11,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:43:11,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:11,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:11,909 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:43:11,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 01:43:12,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:43:12,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:43:12,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 01:43:12,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:12,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:43:12,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:43:12,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:43:12,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:43:12,969 INFO L356 Elim1Store]: treesize reduction 64, result has 51.9 percent of original size [2022-11-03 01:43:12,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 110 [2022-11-03 01:43:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:13,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:14,357 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse1 (not (< (+ c_~M~0 1) c_~N~0))) (.cse0 (= (mod c_~sorted3~0 256) 0)) (.cse3 (+ c_~A~0.offset 4))) (and (or .cse0 .cse1 (let ((.cse9 (* 4 c_~M~0))) (let ((.cse4 (+ c_~A~0.offset .cse9)) (.cse5 (+ c_~A~0.offset .cse9 4)) (.cse6 (= (mod c_~sorted2~0 256) 0))) (and (or (forall ((v_ArrVal_936 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (or (not (< (select .cse2 c_~A~0.offset) (select .cse2 .cse3))) (not (< (select .cse2 .cse4) (select .cse2 .cse5)))))) (not .cse6)) (forall ((v_ArrVal_936 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (or (not (< (select .cse7 c_~A~0.offset) (select .cse7 .cse3))) (< (select .cse7 .cse4) (select .cse7 .cse5))))) (or (forall ((v_ArrVal_936 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (or (not (< (select .cse8 .cse4) (select .cse8 .cse5))) (< (select .cse8 c_~A~0.offset) (select .cse8 .cse3))))) .cse6))))) (or .cse1 (not .cse0) (forall ((v_ArrVal_936 (Array Int Int))) (not (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (< (select .cse10 c_~A~0.offset) (select .cse10 .cse3)))))))) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:43:14,417 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse1 (not (< (+ c_~M~0 1) c_~N~0))) (.cse0 (= (mod c_~sorted3~0 256) 0)) (.cse3 (+ c_~A~0.offset 4))) (and (or .cse0 .cse1 (let ((.cse9 (* 4 c_~M~0))) (let ((.cse4 (+ c_~A~0.offset .cse9)) (.cse5 (+ c_~A~0.offset .cse9 4)) (.cse6 (= (mod c_~sorted2~0 256) 0))) (and (or (forall ((v_ArrVal_936 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (or (not (< (select .cse2 c_~A~0.offset) (select .cse2 .cse3))) (not (< (select .cse2 .cse4) (select .cse2 .cse5)))))) (not .cse6)) (forall ((v_ArrVal_936 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (or (not (< (select .cse7 c_~A~0.offset) (select .cse7 .cse3))) (< (select .cse7 .cse4) (select .cse7 .cse5))))) (or (forall ((v_ArrVal_936 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (or (not (< (select .cse8 .cse4) (select .cse8 .cse5))) (< (select .cse8 c_~A~0.offset) (select .cse8 .cse3))))) .cse6))))) (or .cse1 (not .cse0) (forall ((v_ArrVal_936 (Array Int Int))) (not (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (< (select .cse10 c_~A~0.offset) (select .cse10 .cse3)))))))) (< c_thread2Thread1of1ForFork2_~i~1 c_~M~0) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:43:14,474 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse1 (not (< (+ c_~M~0 1) c_~N~0))) (.cse0 (= (mod c_~sorted3~0 256) 0)) (.cse3 (+ c_~A~0.offset 4))) (and (or .cse0 .cse1 (let ((.cse9 (* 4 c_~M~0))) (let ((.cse4 (+ c_~A~0.offset .cse9)) (.cse5 (+ c_~A~0.offset .cse9 4)) (.cse6 (= (mod c_~sorted2~0 256) 0))) (and (or (forall ((v_ArrVal_936 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (or (not (< (select .cse2 c_~A~0.offset) (select .cse2 .cse3))) (not (< (select .cse2 .cse4) (select .cse2 .cse5)))))) (not .cse6)) (forall ((v_ArrVal_936 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (or (not (< (select .cse7 c_~A~0.offset) (select .cse7 .cse3))) (< (select .cse7 .cse4) (select .cse7 .cse5))))) (or (forall ((v_ArrVal_936 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (or (not (< (select .cse8 .cse4) (select .cse8 .cse5))) (< (select .cse8 c_~A~0.offset) (select .cse8 .cse3))))) .cse6))))) (or .cse1 (not .cse0) (forall ((v_ArrVal_936 (Array Int Int))) (not (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (< (select .cse10 c_~A~0.offset) (select .cse10 .cse3)))))))) (< 0 c_~M~0) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:43:14,597 WARN L833 $PredicateComparison]: unable to prove that (or (< 0 c_~M~0) (let ((.cse2 (+ c_~A~0.offset 4)) (.cse9 (not (< (+ c_~M~0 1) c_~N~0))) (.cse0 (= (mod c_~sorted3~0 256) 0))) (and (or .cse0 (let ((.cse8 (* 4 c_~M~0))) (let ((.cse3 (+ c_~A~0.offset .cse8)) (.cse4 (+ c_~A~0.offset .cse8 4)) (.cse5 (= (mod c_~sorted2~0 256) 0))) (and (forall ((v_ArrVal_935 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_935) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (or (not (< (select .cse1 c_~A~0.offset) (select .cse1 .cse2))) (< (select .cse1 .cse3) (select .cse1 .cse4))))) (or .cse5 (forall ((v_ArrVal_935 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_935) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (or (not (< (select .cse6 .cse3) (select .cse6 .cse4))) (< (select .cse6 c_~A~0.offset) (select .cse6 .cse2)))))) (or (forall ((v_ArrVal_935 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_935) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (or (not (< (select .cse7 c_~A~0.offset) (select .cse7 .cse2))) (not (< (select .cse7 .cse3) (select .cse7 .cse4)))))) (not .cse5))))) .cse9) (or (forall ((v_ArrVal_935 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (not (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_935) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_936) c_~A~0.base))) (< (select .cse10 c_~A~0.offset) (select .cse10 .cse2))))) .cse9 (not .cse0)))) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:43:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:43:14,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786273624] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:14,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1089803661] [2022-11-03 01:43:14,698 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:43:14,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:43:14,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 36 [2022-11-03 01:43:14,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732454478] [2022-11-03 01:43:14,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:43:14,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 01:43:14,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:14,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 01:43:14,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=942, Unknown=4, NotChecked=260, Total=1332 [2022-11-03 01:43:14,701 INFO L87 Difference]: Start difference. First operand 1382 states and 6284 transitions. Second operand has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:43:29,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:29,717 INFO L93 Difference]: Finished difference Result 3231 states and 12915 transitions. [2022-11-03 01:43:29,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-03 01:43:29,717 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:43:29,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:29,725 INFO L225 Difference]: With dead ends: 3231 [2022-11-03 01:43:29,725 INFO L226 Difference]: Without dead ends: 3191 [2022-11-03 01:43:29,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2755 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=1328, Invalid=7240, Unknown=4, NotChecked=740, Total=9312 [2022-11-03 01:43:29,726 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 495 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 2826 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 3763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 854 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:29,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 212 Invalid, 3763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2826 Invalid, 0 Unknown, 854 Unchecked, 2.7s Time] [2022-11-03 01:43:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3191 states. [2022-11-03 01:43:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3191 to 1414. [2022-11-03 01:43:29,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 4.565463552724699) internal successors, (6451), 1413 states have internal predecessors, (6451), 0 states have call successors, (0), 0 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-03 01:43:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 6451 transitions. [2022-11-03 01:43:29,789 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 6451 transitions. Word has length 25 [2022-11-03 01:43:29,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:29,790 INFO L495 AbstractCegarLoop]: Abstraction has 1414 states and 6451 transitions. [2022-11-03 01:43:29,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:43:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 6451 transitions. [2022-11-03 01:43:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:43:29,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:29,796 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:29,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:30,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:30,002 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-03 01:43:30,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:30,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1501303887, now seen corresponding path program 9 times [2022-11-03 01:43:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:30,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061813710] [2022-11-03 01:43:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:31,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:31,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061813710] [2022-11-03 01:43:31,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061813710] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:43:31,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123061685] [2022-11-03 01:43:31,344 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:43:31,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:31,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:31,345 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:43:31,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 01:43:31,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:43:31,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:43:31,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-03 01:43:31,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:31,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:43:31,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:43:31,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:43:31,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:43:32,463 INFO L356 Elim1Store]: treesize reduction 58, result has 56.4 percent of original size [2022-11-03 01:43:32,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 116 [2022-11-03 01:43:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:32,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:36,453 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_thread3Thread1of1ForFork0_~i~2_108 Int) (v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_989 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_988) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_989) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 v_thread3Thread1of1ForFork0_~i~2_108) (not (< (+ v_thread3Thread1of1ForFork0_~i~2_108 1) c_~N~0)) (not (< (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse0 .cse1))) (< (+ 2 v_thread3Thread1of1ForFork0_~i~2_108) c_~N~0) (let ((.cse2 (* v_thread3Thread1of1ForFork0_~i~2_108 4))) (< (select .cse0 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse0 (+ .cse2 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_thread3Thread1of1ForFork0_~i~2_108 Int) (v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_989 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_988) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_989) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 v_thread3Thread1of1ForFork0_~i~2_108) (not (< (+ v_thread3Thread1of1ForFork0_~i~2_108 1) c_~N~0)) (< (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse3 .cse1)) (not (let ((.cse4 (* v_thread3Thread1of1ForFork0_~i~2_108 4))) (< (select .cse3 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse3 (+ .cse4 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< (+ 2 v_thread3Thread1of1ForFork0_~i~2_108) c_~N~0)))))) is different from false [2022-11-03 01:43:36,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:43:36,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 119 treesize of output 83 [2022-11-03 01:43:36,521 INFO L356 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2022-11-03 01:43:36,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1484 treesize of output 1393 [2022-11-03 01:43:36,559 INFO L356 Elim1Store]: treesize reduction 31, result has 27.9 percent of original size [2022-11-03 01:43:36,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1376 treesize of output 1084 [2022-11-03 01:43:36,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:36,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:36,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:36,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:43:36,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 818 treesize of output 754 [2022-11-03 01:43:36,671 INFO L356 Elim1Store]: treesize reduction 31, result has 27.9 percent of original size [2022-11-03 01:43:36,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 996 treesize of output 856 [2022-11-03 01:43:37,218 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 01:43:37,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 119 treesize of output 1 [2022-11-03 01:43:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:43:37,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123061685] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:37,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [983164260] [2022-11-03 01:43:37,325 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:43:37,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:43:37,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 40 [2022-11-03 01:43:37,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847058840] [2022-11-03 01:43:37,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:43:37,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-03 01:43:37,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:37,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-03 01:43:37,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1416, Unknown=10, NotChecked=78, Total=1722 [2022-11-03 01:43:37,331 INFO L87 Difference]: Start difference. First operand 1414 states and 6451 transitions. Second operand has 42 states, 41 states have (on average 1.829268292682927) internal successors, (75), 41 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-03 01:43:54,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:54,211 INFO L93 Difference]: Finished difference Result 3059 states and 11935 transitions. [2022-11-03 01:43:54,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-03 01:43:54,212 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.829268292682927) internal successors, (75), 41 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:43:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:54,217 INFO L225 Difference]: With dead ends: 3059 [2022-11-03 01:43:54,217 INFO L226 Difference]: Without dead ends: 3009 [2022-11-03 01:43:54,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2713 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=1311, Invalid=6869, Unknown=14, NotChecked=178, Total=8372 [2022-11-03 01:43:54,218 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 493 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 1977 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 3710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1682 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:54,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 183 Invalid, 3710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1977 Invalid, 0 Unknown, 1682 Unchecked, 2.1s Time] [2022-11-03 01:43:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2022-11-03 01:43:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 1446. [2022-11-03 01:43:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1445 states have (on average 4.555017301038062) internal successors, (6582), 1445 states have internal predecessors, (6582), 0 states have call successors, (0), 0 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-03 01:43:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 6582 transitions. [2022-11-03 01:43:54,277 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 6582 transitions. Word has length 25 [2022-11-03 01:43:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:54,277 INFO L495 AbstractCegarLoop]: Abstraction has 1446 states and 6582 transitions. [2022-11-03 01:43:54,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.829268292682927) internal successors, (75), 41 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-03 01:43:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 6582 transitions. [2022-11-03 01:43:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:43:54,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:54,282 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:54,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:54,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:54,493 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 01:43:54,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:54,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1175546781, now seen corresponding path program 10 times [2022-11-03 01:43:54,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:54,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791321193] [2022-11-03 01:43:54,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:54,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:55,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:55,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791321193] [2022-11-03 01:43:55,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791321193] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:43:55,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143040436] [2022-11-03 01:43:55,876 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:43:55,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:55,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:55,877 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:43:55,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 01:43:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:56,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 01:43:56,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:56,714 INFO L356 Elim1Store]: treesize reduction 64, result has 51.9 percent of original size [2022-11-03 01:43:56,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 110 [2022-11-03 01:43:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:43:57,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:57,552 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:43:57,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 4 [2022-11-03 01:43:57,589 INFO L356 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2022-11-03 01:43:57,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 43 [2022-11-03 01:43:57,628 INFO L356 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-03 01:43:57,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 34 [2022-11-03 01:43:58,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:43:58,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143040436] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:58,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1136711142] [2022-11-03 01:43:58,059 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:43:58,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:43:58,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2022-11-03 01:43:58,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173644204] [2022-11-03 01:43:58,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:43:58,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 01:43:58,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:58,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 01:43:58,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2022-11-03 01:43:58,061 INFO L87 Difference]: Start difference. First operand 1446 states and 6582 transitions. Second operand has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 30 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:44:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:23,729 INFO L93 Difference]: Finished difference Result 6965 states and 27388 transitions. [2022-11-03 01:44:23,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2022-11-03 01:44:23,730 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 30 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:44:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:23,744 INFO L225 Difference]: With dead ends: 6965 [2022-11-03 01:44:23,744 INFO L226 Difference]: Without dead ends: 6795 [2022-11-03 01:44:23,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12249 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=4645, Invalid=25111, Unknown=0, NotChecked=0, Total=29756 [2022-11-03 01:44:23,746 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 921 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 4398 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 4710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 4398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:23,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 302 Invalid, 4710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 4398 Invalid, 0 Unknown, 80 Unchecked, 4.5s Time] [2022-11-03 01:44:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6795 states. [2022-11-03 01:44:23,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6795 to 1603. [2022-11-03 01:44:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1602 states have (on average 4.640449438202247) internal successors, (7434), 1602 states have internal predecessors, (7434), 0 states have call successors, (0), 0 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-03 01:44:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 7434 transitions. [2022-11-03 01:44:23,823 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 7434 transitions. Word has length 25 [2022-11-03 01:44:23,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:23,823 INFO L495 AbstractCegarLoop]: Abstraction has 1603 states and 7434 transitions. [2022-11-03 01:44:23,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 30 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:44:23,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 7434 transitions. [2022-11-03 01:44:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:44:23,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:23,829 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:23,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:24,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-03 01:44:24,030 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 01:44:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1923676571, now seen corresponding path program 11 times [2022-11-03 01:44:24,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:24,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514423606] [2022-11-03 01:44:24,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:24,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:44:25,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:25,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514423606] [2022-11-03 01:44:25,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514423606] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:44:25,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333853723] [2022-11-03 01:44:25,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:44:25,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:25,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:44:25,358 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:44:25,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-03 01:44:25,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:44:25,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:44:25,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 01:44:25,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:26,376 INFO L356 Elim1Store]: treesize reduction 58, result has 56.4 percent of original size [2022-11-03 01:44:26,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 116 [2022-11-03 01:44:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:44:26,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:44:27,108 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:27,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 158 [2022-11-03 01:44:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:44:27,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333853723] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:44:27,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [11491643] [2022-11-03 01:44:27,928 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:44:27,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:44:27,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 31 [2022-11-03 01:44:27,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848806452] [2022-11-03 01:44:27,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:44:27,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:44:27,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:44:27,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2022-11-03 01:44:27,931 INFO L87 Difference]: Start difference. First operand 1603 states and 7434 transitions. Second operand has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:44:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:43,222 INFO L93 Difference]: Finished difference Result 4828 states and 19049 transitions. [2022-11-03 01:44:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-11-03 01:44:43,223 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:44:43,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:43,233 INFO L225 Difference]: With dead ends: 4828 [2022-11-03 01:44:43,233 INFO L226 Difference]: Without dead ends: 4772 [2022-11-03 01:44:43,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6560 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2758, Invalid=15874, Unknown=0, NotChecked=0, Total=18632 [2022-11-03 01:44:43,234 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 740 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 3447 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 3717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 3447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:43,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 141 Invalid, 3717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 3447 Invalid, 0 Unknown, 107 Unchecked, 3.3s Time] [2022-11-03 01:44:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2022-11-03 01:44:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 1693. [2022-11-03 01:44:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1692 states have (on average 4.6873522458628845) internal successors, (7931), 1692 states have internal predecessors, (7931), 0 states have call successors, (0), 0 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-03 01:44:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 7931 transitions. [2022-11-03 01:44:43,314 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 7931 transitions. Word has length 25 [2022-11-03 01:44:43,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:43,314 INFO L495 AbstractCegarLoop]: Abstraction has 1693 states and 7931 transitions. [2022-11-03 01:44:43,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:44:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 7931 transitions. [2022-11-03 01:44:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:44:43,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:43,319 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:43,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:43,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-03 01:44:43,525 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 01:44:43,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:43,525 INFO L85 PathProgramCache]: Analyzing trace with hash -762975543, now seen corresponding path program 12 times [2022-11-03 01:44:43,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:43,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027359836] [2022-11-03 01:44:43,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:43,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:44:44,793 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:44,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027359836] [2022-11-03 01:44:44,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027359836] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:44:44,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16380633] [2022-11-03 01:44:44,794 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:44:44,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:44,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:44:44,795 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:44:44,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-03 01:44:45,182 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:44:45,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:44:45,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 01:44:45,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:45,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:44:45,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:44:45,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:44:45,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:44:46,043 INFO L356 Elim1Store]: treesize reduction 64, result has 51.9 percent of original size [2022-11-03 01:44:46,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 110 [2022-11-03 01:44:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:44:46,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:44:47,622 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse2 (not (< (+ c_~M~0 1) c_~N~0))) (.cse1 (+ c_~A~0.offset 4))) (and (or (forall ((v_ArrVal_1138 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (< (select .cse0 c_~A~0.offset) (select .cse0 .cse1))))) .cse2 (not .cse3)) (or .cse3 .cse2 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse5 (+ c_~A~0.offset .cse10)) (.cse6 (+ c_~A~0.offset .cse10 4)) (.cse8 (= (mod c_~sorted2~0 256) 0))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (or (not (< (select .cse4 c_~A~0.offset) (select .cse4 .cse1))) (< (select .cse4 .cse5) (select .cse4 .cse6))))) (or (forall ((v_ArrVal_1138 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (or (not (< (select .cse7 c_~A~0.offset) (select .cse7 .cse1))) (not (< (select .cse7 .cse5) (select .cse7 .cse6)))))) (not .cse8)) (or (forall ((v_ArrVal_1138 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (or (not (< (select .cse9 .cse5) (select .cse9 .cse6))) (< (select .cse9 c_~A~0.offset) (select .cse9 .cse1))))) .cse8))))))) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:44:47,682 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse2 (not (< (+ c_~M~0 1) c_~N~0))) (.cse1 (+ c_~A~0.offset 4))) (and (or (forall ((v_ArrVal_1138 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (< (select .cse0 c_~A~0.offset) (select .cse0 .cse1))))) .cse2 (not .cse3)) (or .cse3 .cse2 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse5 (+ c_~A~0.offset .cse10)) (.cse6 (+ c_~A~0.offset .cse10 4)) (.cse8 (= (mod c_~sorted2~0 256) 0))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (or (not (< (select .cse4 c_~A~0.offset) (select .cse4 .cse1))) (< (select .cse4 .cse5) (select .cse4 .cse6))))) (or (forall ((v_ArrVal_1138 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (or (not (< (select .cse7 c_~A~0.offset) (select .cse7 .cse1))) (not (< (select .cse7 .cse5) (select .cse7 .cse6)))))) (not .cse8)) (or (forall ((v_ArrVal_1138 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (or (not (< (select .cse9 .cse5) (select .cse9 .cse6))) (< (select .cse9 c_~A~0.offset) (select .cse9 .cse1))))) .cse8))))))) (< c_thread2Thread1of1ForFork2_~i~1 c_~M~0) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:44:47,742 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse2 (not (< (+ c_~M~0 1) c_~N~0))) (.cse1 (+ c_~A~0.offset 4))) (and (or (forall ((v_ArrVal_1138 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (< (select .cse0 c_~A~0.offset) (select .cse0 .cse1))))) .cse2 (not .cse3)) (or .cse3 .cse2 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse5 (+ c_~A~0.offset .cse10)) (.cse6 (+ c_~A~0.offset .cse10 4)) (.cse8 (= (mod c_~sorted2~0 256) 0))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (or (not (< (select .cse4 c_~A~0.offset) (select .cse4 .cse1))) (< (select .cse4 .cse5) (select .cse4 .cse6))))) (or (forall ((v_ArrVal_1138 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (or (not (< (select .cse7 c_~A~0.offset) (select .cse7 .cse1))) (not (< (select .cse7 .cse5) (select .cse7 .cse6)))))) (not .cse8)) (or (forall ((v_ArrVal_1138 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (or (not (< (select .cse9 .cse5) (select .cse9 .cse6))) (< (select .cse9 c_~A~0.offset) (select .cse9 .cse1))))) .cse8))))))) (< 0 c_~M~0) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:44:47,866 WARN L833 $PredicateComparison]: unable to prove that (or (< 0 c_~M~0) (= (mod c_~sorted1~0 256) 0) (let ((.cse1 (= (mod c_~sorted3~0 256) 0)) (.cse3 (+ c_~A~0.offset 4)) (.cse0 (not (< (+ c_~M~0 1) c_~N~0)))) (and (or .cse0 (not .cse1) (forall ((v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int))) (not (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (< (select .cse2 c_~A~0.offset) (select .cse2 .cse3)))))) (or .cse1 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse5 (+ c_~A~0.offset .cse10)) (.cse6 (+ c_~A~0.offset .cse10 4)) (.cse8 (= (mod c_~sorted2~0 256) 0))) (and (forall ((v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (or (< (select .cse4 .cse5) (select .cse4 .cse6)) (not (< (select .cse4 c_~A~0.offset) (select .cse4 .cse3)))))) (or (forall ((v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (or (not (< (select .cse7 .cse5) (select .cse7 .cse6))) (< (select .cse7 c_~A~0.offset) (select .cse7 .cse3))))) .cse8) (or (forall ((v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~A~0.base))) (or (not (< (select .cse9 .cse5) (select .cse9 .cse6))) (not (< (select .cse9 c_~A~0.offset) (select .cse9 .cse3)))))) (not .cse8))))) .cse0)))) is different from false [2022-11-03 01:44:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:44:47,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16380633] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:44:47,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1701656973] [2022-11-03 01:44:47,962 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:44:47,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:44:47,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 36 [2022-11-03 01:44:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569121193] [2022-11-03 01:44:47,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:44:47,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 01:44:47,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:47,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 01:44:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=947, Unknown=4, NotChecked=260, Total=1332 [2022-11-03 01:44:47,964 INFO L87 Difference]: Start difference. First operand 1693 states and 7931 transitions. Second operand has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:45:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:04,574 INFO L93 Difference]: Finished difference Result 4297 states and 17745 transitions. [2022-11-03 01:45:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-11-03 01:45:04,574 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:45:04,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:04,584 INFO L225 Difference]: With dead ends: 4297 [2022-11-03 01:45:04,584 INFO L226 Difference]: Without dead ends: 4247 [2022-11-03 01:45:04,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3085 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=1369, Invalid=8345, Unknown=4, NotChecked=788, Total=10506 [2022-11-03 01:45:04,585 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 593 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 3597 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 4893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1189 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:04,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 163 Invalid, 4893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 3597 Invalid, 0 Unknown, 1189 Unchecked, 3.6s Time] [2022-11-03 01:45:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4247 states. [2022-11-03 01:45:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4247 to 1692. [2022-11-03 01:45:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1691 states have (on average 4.704316972205795) internal successors, (7955), 1691 states have internal predecessors, (7955), 0 states have call successors, (0), 0 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-03 01:45:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 7955 transitions. [2022-11-03 01:45:04,664 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 7955 transitions. Word has length 25 [2022-11-03 01:45:04,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:04,664 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 7955 transitions. [2022-11-03 01:45:04,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:45:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 7955 transitions. [2022-11-03 01:45:04,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:45:04,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:04,670 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:04,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:04,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-03 01:45:04,875 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 01:45:04,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:04,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1030643813, now seen corresponding path program 13 times [2022-11-03 01:45:04,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:45:04,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269792019] [2022-11-03 01:45:04,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:04,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:45:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:45:06,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:06,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269792019] [2022-11-03 01:45:06,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269792019] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:45:06,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446762023] [2022-11-03 01:45:06,255 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:45:06,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:45:06,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:45:06,257 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:45:06,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 01:45:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:06,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 01:45:06,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:06,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:06,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:06,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:45:06,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 36 [2022-11-03 01:45:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:45:07,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:07,626 INFO L356 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2022-11-03 01:45:07,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 43 [2022-11-03 01:45:07,672 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:45:07,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 88 [2022-11-03 01:45:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:45:08,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446762023] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:45:08,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1201010478] [2022-11-03 01:45:08,270 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:45:08,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:45:08,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 31 [2022-11-03 01:45:08,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458669384] [2022-11-03 01:45:08,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:45:08,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:45:08,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:08,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:45:08,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2022-11-03 01:45:08,273 INFO L87 Difference]: Start difference. First operand 1692 states and 7955 transitions. Second operand has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:45:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:33,372 INFO L93 Difference]: Finished difference Result 5113 states and 20809 transitions. [2022-11-03 01:45:33,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-11-03 01:45:33,372 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:45:33,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:33,383 INFO L225 Difference]: With dead ends: 5113 [2022-11-03 01:45:33,383 INFO L226 Difference]: Without dead ends: 5064 [2022-11-03 01:45:33,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5460 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=2869, Invalid=13643, Unknown=0, NotChecked=0, Total=16512 [2022-11-03 01:45:33,385 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 668 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 5654 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 5802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 5654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:33,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 222 Invalid, 5802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 5654 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-11-03 01:45:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2022-11-03 01:45:33,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 1783. [2022-11-03 01:45:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 4.736812570145903) internal successors, (8441), 1782 states have internal predecessors, (8441), 0 states have call successors, (0), 0 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-03 01:45:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 8441 transitions. [2022-11-03 01:45:33,502 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 8441 transitions. Word has length 25 [2022-11-03 01:45:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:33,502 INFO L495 AbstractCegarLoop]: Abstraction has 1783 states and 8441 transitions. [2022-11-03 01:45:33,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:45:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 8441 transitions. [2022-11-03 01:45:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:45:33,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:33,513 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:33,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:33,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-03 01:45:33,721 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 01:45:33,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:33,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1650756749, now seen corresponding path program 14 times [2022-11-03 01:45:33,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:45:33,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557133138] [2022-11-03 01:45:33,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:33,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:45:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:45:35,605 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:35,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557133138] [2022-11-03 01:45:35,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557133138] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:45:35,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59438676] [2022-11-03 01:45:35,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:45:35,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:45:35,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:45:35,606 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:45:35,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 01:45:35,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:45:35,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:45:35,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 01:45:35,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:36,535 INFO L356 Elim1Store]: treesize reduction 58, result has 56.4 percent of original size [2022-11-03 01:45:36,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 116 [2022-11-03 01:45:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:45:36,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:37,359 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:45:37,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 4 [2022-11-03 01:45:37,396 INFO L356 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2022-11-03 01:45:37,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 43 [2022-11-03 01:45:37,433 INFO L356 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-03 01:45:37,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 34 [2022-11-03 01:45:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:45:37,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59438676] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:45:37,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [965990557] [2022-11-03 01:45:37,895 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:45:37,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:45:37,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 33 [2022-11-03 01:45:37,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507930480] [2022-11-03 01:45:37,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:45:37,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 01:45:37,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:37,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 01:45:37,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 01:45:37,897 INFO L87 Difference]: Start difference. First operand 1783 states and 8441 transitions. Second operand has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:46:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:02,096 INFO L93 Difference]: Finished difference Result 6230 states and 24813 transitions. [2022-11-03 01:46:02,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-11-03 01:46:02,097 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:46:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:02,110 INFO L225 Difference]: With dead ends: 6230 [2022-11-03 01:46:02,110 INFO L226 Difference]: Without dead ends: 6048 [2022-11-03 01:46:02,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9617 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=3071, Invalid=22689, Unknown=0, NotChecked=0, Total=25760 [2022-11-03 01:46:02,111 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 918 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 4463 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 4772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 4463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:02,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 222 Invalid, 4772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 4463 Invalid, 0 Unknown, 122 Unchecked, 4.6s Time] [2022-11-03 01:46:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2022-11-03 01:46:02,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 1791. [2022-11-03 01:46:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1790 states have (on average 4.76145251396648) internal successors, (8523), 1790 states have internal predecessors, (8523), 0 states have call successors, (0), 0 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-03 01:46:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 8523 transitions. [2022-11-03 01:46:02,226 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 8523 transitions. Word has length 25 [2022-11-03 01:46:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:02,226 INFO L495 AbstractCegarLoop]: Abstraction has 1791 states and 8523 transitions. [2022-11-03 01:46:02,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:46:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 8523 transitions. [2022-11-03 01:46:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:46:02,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:02,231 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:02,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:02,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-03 01:46:02,441 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 01:46:02,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:02,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1968812541, now seen corresponding path program 15 times [2022-11-03 01:46:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:02,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16195749] [2022-11-03 01:46:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:04,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:04,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16195749] [2022-11-03 01:46:04,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16195749] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:04,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601862407] [2022-11-03 01:46:04,454 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:46:04,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:04,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:04,455 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:04,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-03 01:46:04,608 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:46:04,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:46:04,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 01:46:04,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:05,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:05,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:05,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:05,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:05,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:46:05,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 36 [2022-11-03 01:46:05,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:46:05,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:05,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:46:05,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 88 [2022-11-03 01:46:05,903 INFO L356 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-03 01:46:05,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-11-03 01:46:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:46:06,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601862407] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:06,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [287126841] [2022-11-03 01:46:06,341 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:46:06,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:46:06,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 33 [2022-11-03 01:46:06,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594524985] [2022-11-03 01:46:06,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:46:06,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 01:46:06,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:06,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 01:46:06,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 01:46:06,344 INFO L87 Difference]: Start difference. First operand 1791 states and 8523 transitions. Second operand has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:46:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:43,238 INFO L93 Difference]: Finished difference Result 4721 states and 18515 transitions. [2022-11-03 01:46:43,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-11-03 01:46:43,238 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:46:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:43,248 INFO L225 Difference]: With dead ends: 4721 [2022-11-03 01:46:43,248 INFO L226 Difference]: Without dead ends: 4658 [2022-11-03 01:46:43,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8808 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=3967, Invalid=21155, Unknown=0, NotChecked=0, Total=25122 [2022-11-03 01:46:43,249 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 777 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 5501 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 5675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 5501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:43,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 269 Invalid, 5675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 5501 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-03 01:46:43,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4658 states. [2022-11-03 01:46:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4658 to 1884. [2022-11-03 01:46:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1883 states have (on average 4.778544875199151) internal successors, (8998), 1883 states have internal predecessors, (8998), 0 states have call successors, (0), 0 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-03 01:46:43,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 8998 transitions. [2022-11-03 01:46:43,308 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 8998 transitions. Word has length 25 [2022-11-03 01:46:43,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:43,308 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 8998 transitions. [2022-11-03 01:46:43,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:46:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 8998 transitions. [2022-11-03 01:46:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:46:43,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:43,313 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:43,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:43,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:43,537 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 01:46:43,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:43,537 INFO L85 PathProgramCache]: Analyzing trace with hash 712588021, now seen corresponding path program 16 times [2022-11-03 01:46:43,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:43,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385286070] [2022-11-03 01:46:43,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:43,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:45,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:45,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385286070] [2022-11-03 01:46:45,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385286070] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:45,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947626230] [2022-11-03 01:46:45,071 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:46:45,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:45,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:45,072 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:45,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-03 01:46:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:45,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 01:46:45,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:45,923 INFO L356 Elim1Store]: treesize reduction 64, result has 51.9 percent of original size [2022-11-03 01:46:45,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 110 [2022-11-03 01:46:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:46:46,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:47,011 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:46:47,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 78 [2022-11-03 01:46:47,066 INFO L356 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-03 01:46:47,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-11-03 01:46:47,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:46:47,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 4 [2022-11-03 01:46:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:46:47,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947626230] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:47,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1757636379] [2022-11-03 01:46:47,510 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:46:47,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:46:47,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 31 [2022-11-03 01:46:47,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704297388] [2022-11-03 01:46:47,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:46:47,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:46:47,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:47,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:46:47,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2022-11-03 01:46:47,513 INFO L87 Difference]: Start difference. First operand 1884 states and 8998 transitions. Second operand has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:47:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:08,289 INFO L93 Difference]: Finished difference Result 3928 states and 15614 transitions. [2022-11-03 01:47:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-03 01:47:08,289 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:47:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:08,298 INFO L225 Difference]: With dead ends: 3928 [2022-11-03 01:47:08,298 INFO L226 Difference]: Without dead ends: 3837 [2022-11-03 01:47:08,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4798 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=2215, Invalid=12065, Unknown=0, NotChecked=0, Total=14280 [2022-11-03 01:47:08,299 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 617 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 3344 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 3542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 3344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:08,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 197 Invalid, 3542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 3344 Invalid, 0 Unknown, 80 Unchecked, 3.8s Time] [2022-11-03 01:47:08,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2022-11-03 01:47:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 1886. [2022-11-03 01:47:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1885 states have (on average 4.797347480106101) internal successors, (9043), 1885 states have internal predecessors, (9043), 0 states have call successors, (0), 0 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-03 01:47:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 9043 transitions. [2022-11-03 01:47:08,379 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 9043 transitions. Word has length 25 [2022-11-03 01:47:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:08,380 INFO L495 AbstractCegarLoop]: Abstraction has 1886 states and 9043 transitions. [2022-11-03 01:47:08,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:47:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 9043 transitions. [2022-11-03 01:47:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:47:08,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:08,385 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:47:08,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:08,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-03 01:47:08,613 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 01:47:08,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:08,614 INFO L85 PathProgramCache]: Analyzing trace with hash 147562915, now seen corresponding path program 17 times [2022-11-03 01:47:08,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:47:08,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377806908] [2022-11-03 01:47:08,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:08,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:47:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:10,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:47:10,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377806908] [2022-11-03 01:47:10,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377806908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:47:10,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752493388] [2022-11-03 01:47:10,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:47:10,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:10,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:47:10,090 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:47:10,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-03 01:47:10,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:47:10,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:47:10,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 01:47:10,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:10,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:10,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:10,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:10,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:10,889 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:47:10,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 36 [2022-11-03 01:47:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:47:11,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:11,621 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:47:11,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 88 [2022-11-03 01:47:11,680 INFO L356 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-03 01:47:11,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-11-03 01:47:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:47:12,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752493388] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:12,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [519378927] [2022-11-03 01:47:12,095 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:47:12,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:47:12,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 31 [2022-11-03 01:47:12,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369530142] [2022-11-03 01:47:12,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:47:12,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:47:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:47:12,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:47:12,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2022-11-03 01:47:12,096 INFO L87 Difference]: Start difference. First operand 1886 states and 9043 transitions. Second operand has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:47:34,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:34,979 INFO L93 Difference]: Finished difference Result 6002 states and 24149 transitions. [2022-11-03 01:47:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-11-03 01:47:34,980 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:47:34,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:34,992 INFO L225 Difference]: With dead ends: 6002 [2022-11-03 01:47:34,992 INFO L226 Difference]: Without dead ends: 5946 [2022-11-03 01:47:34,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7575 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=3509, Invalid=18543, Unknown=0, NotChecked=0, Total=22052 [2022-11-03 01:47:34,994 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 795 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 5009 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 5200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 5009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:34,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 268 Invalid, 5200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 5009 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-03 01:47:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2022-11-03 01:47:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 2174. [2022-11-03 01:47:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2174 states, 2173 states have (on average 4.782788771283939) internal successors, (10393), 2173 states have internal predecessors, (10393), 0 states have call successors, (0), 0 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-03 01:47:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 10393 transitions. [2022-11-03 01:47:35,070 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 10393 transitions. Word has length 25 [2022-11-03 01:47:35,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:35,071 INFO L495 AbstractCegarLoop]: Abstraction has 2174 states and 10393 transitions. [2022-11-03 01:47:35,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:47:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 10393 transitions. [2022-11-03 01:47:35,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:47:35,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:35,075 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:47:35,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:35,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:35,275 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 01:47:35,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:35,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1600791083, now seen corresponding path program 18 times [2022-11-03 01:47:35,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:47:35,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881851847] [2022-11-03 01:47:35,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:35,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:47:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:36,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:47:36,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881851847] [2022-11-03 01:47:36,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881851847] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:47:36,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744053996] [2022-11-03 01:47:36,933 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:47:36,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:36,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:47:36,934 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:47:36,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-03 01:47:37,162 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:47:37,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:47:37,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 01:47:37,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:37,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:47:37,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:47:37,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:47:37,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:37,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2022-11-03 01:47:37,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:37,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:37,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:37,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:37,944 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:47:37,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 36 [2022-11-03 01:47:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:38,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:39,896 WARN L833 $PredicateComparison]: unable to prove that (or (< 0 c_~M~0) (= (mod c_~sorted1~0 256) 0) (let ((.cse13 (* 4 c_~M~0)) (.cse8 (+ c_~A~0.offset 4))) (let ((.cse2 (forall ((v_ArrVal_1430 (Array Int Int))) (not (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1430) c_~A~0.base))) (< (select .cse14 c_~A~0.offset) (select .cse14 .cse8)))))) (.cse1 (= (mod c_~sorted3~0 256) 0)) (.cse0 (not (< (+ c_~M~0 1) c_~N~0))) (.cse4 (+ c_~A~0.offset .cse13)) (.cse5 (+ c_~A~0.offset .cse13 4)) (.cse9 (= (mod c_~sorted2~0 256) 0))) (and (or .cse0 (not .cse1) .cse2) (or .cse0 (and (forall ((v_ArrVal_1430 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1430))) (or (forall ((v_ArrVal_1431 (Array Int Int))) (let ((.cse3 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1431) c_~A~0.base))) (< (select .cse3 .cse4) (select .cse3 .cse5)))) (not (let ((.cse7 (select .cse6 c_~A~0.base))) (< (select .cse7 c_~A~0.offset) (select .cse7 .cse8))))))) (or (not .cse9) .cse2))) (or .cse1 .cse0 (forall ((v_ArrVal_1431 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1430))) (or (let ((.cse10 (select .cse11 c_~A~0.base))) (< (select .cse10 c_~A~0.offset) (select .cse10 .cse8))) (not (let ((.cse12 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1431) c_~A~0.base))) (< (select .cse12 .cse4) (select .cse12 .cse5))))))) .cse9))))) is different from false [2022-11-03 01:47:40,002 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_1431 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1429) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1430))) (or (let ((.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse0 .cse1))) (not (let ((.cse3 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1431) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse4 (* ~M~0 4))) (< (select .cse3 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse3 (+ .cse4 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1431 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1429) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1430))) (or (let ((.cse5 (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1431) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse6 (* ~M~0 4))) (< (select .cse5 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse5 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (let ((.cse8 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse8 .cse1))))))) (< 0 ~M~0) (< ~M~0 0))))) is different from false [2022-11-03 01:47:40,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:47:40,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 113 treesize of output 77 [2022-11-03 01:47:40,043 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-03 01:47:40,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 572 treesize of output 526 [2022-11-03 01:47:40,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 380 treesize of output 276 [2022-11-03 01:47:40,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:40,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 239 [2022-11-03 01:47:40,090 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-03 01:47:40,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 376 treesize of output 308 [2022-11-03 01:47:40,223 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 01:47:40,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 1 [2022-11-03 01:47:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 01:47:40,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744053996] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:40,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [394558264] [2022-11-03 01:47:40,260 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:47:40,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:47:40,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 37 [2022-11-03 01:47:40,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232479982] [2022-11-03 01:47:40,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:47:40,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 01:47:40,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:47:40,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 01:47:40,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1173, Unknown=18, NotChecked=142, Total=1482 [2022-11-03 01:47:40,263 INFO L87 Difference]: Start difference. First operand 2174 states and 10393 transitions. Second operand has 39 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-03 01:48:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:48:00,139 INFO L93 Difference]: Finished difference Result 3789 states and 16552 transitions. [2022-11-03 01:48:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-11-03 01:48:00,139 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:48:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:48:00,148 INFO L225 Difference]: With dead ends: 3789 [2022-11-03 01:48:00,148 INFO L226 Difference]: Without dead ends: 3749 [2022-11-03 01:48:00,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 35 SyntacticMatches, 18 SemanticMatches, 137 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 6938 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=2663, Invalid=15958, Unknown=19, NotChecked=542, Total=19182 [2022-11-03 01:48:00,150 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 652 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 4806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1968 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:48:00,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 283 Invalid, 4806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2696 Invalid, 0 Unknown, 1968 Unchecked, 2.6s Time] [2022-11-03 01:48:00,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2022-11-03 01:48:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 2280. [2022-11-03 01:48:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 2279 states have (on average 4.784554629223344) internal successors, (10904), 2279 states have internal predecessors, (10904), 0 states have call successors, (0), 0 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-03 01:48:00,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 10904 transitions. [2022-11-03 01:48:00,232 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 10904 transitions. Word has length 25 [2022-11-03 01:48:00,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:48:00,233 INFO L495 AbstractCegarLoop]: Abstraction has 2280 states and 10904 transitions. [2022-11-03 01:48:00,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-03 01:48:00,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 10904 transitions. [2022-11-03 01:48:00,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:48:00,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:48:00,241 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:48:00,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-03 01:48:00,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:48:00,469 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 01:48:00,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:48:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1941359635, now seen corresponding path program 19 times [2022-11-03 01:48:00,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:48:00,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815766367] [2022-11-03 01:48:00,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:00,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:48:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:48:02,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:48:02,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815766367] [2022-11-03 01:48:02,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815766367] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:48:02,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871019345] [2022-11-03 01:48:02,412 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:48:02,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:48:02,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:48:02,414 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:48:02,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-03 01:48:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:02,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 01:48:02,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:48:03,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:03,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2022-11-03 01:48:03,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:03,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:03,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:03,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:03,444 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:48:03,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 36 [2022-11-03 01:48:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:48:03,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:48:04,628 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:48:04,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 114 [2022-11-03 01:48:04,636 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:48:04,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 44 [2022-11-03 01:48:04,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:04,770 INFO L356 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-03 01:48:04,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-11-03 01:48:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:48:05,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871019345] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:48:05,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1543516679] [2022-11-03 01:48:05,272 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:48:05,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:48:05,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 35 [2022-11-03 01:48:05,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798065141] [2022-11-03 01:48:05,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:48:05,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 01:48:05,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:48:05,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 01:48:05,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1186, Unknown=10, NotChecked=0, Total=1332 [2022-11-03 01:48:05,274 INFO L87 Difference]: Start difference. First operand 2280 states and 10904 transitions. Second operand has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:49:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:07,360 INFO L93 Difference]: Finished difference Result 7147 states and 27455 transitions. [2022-11-03 01:49:07,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2022-11-03 01:49:07,361 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:49:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:07,377 INFO L225 Difference]: With dead ends: 7147 [2022-11-03 01:49:07,377 INFO L226 Difference]: Without dead ends: 7084 [2022-11-03 01:49:07,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 45 SyntacticMatches, 38 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 6 DeprecatedPredicates, 18609 ImplicationChecksByTransitivity, 58.1s TimeCoverageRelationStatistics Valid=6715, Invalid=33046, Unknown=39, NotChecked=0, Total=39800 [2022-11-03 01:49:07,379 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1239 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 4019 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 6421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 4019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2083 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:07,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 248 Invalid, 6421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 4019 Invalid, 0 Unknown, 2083 Unchecked, 5.0s Time] [2022-11-03 01:49:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7084 states. [2022-11-03 01:49:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7084 to 2537. [2022-11-03 01:49:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2536 states have (on average 4.689668769716088) internal successors, (11893), 2536 states have internal predecessors, (11893), 0 states have call successors, (0), 0 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-03 01:49:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 11893 transitions. [2022-11-03 01:49:07,474 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 11893 transitions. Word has length 25 [2022-11-03 01:49:07,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:07,474 INFO L495 AbstractCegarLoop]: Abstraction has 2537 states and 11893 transitions. [2022-11-03 01:49:07,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:49:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 11893 transitions. [2022-11-03 01:49:07,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:49:07,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:07,482 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:07,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:07,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:07,688 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 01:49:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:07,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1218222995, now seen corresponding path program 20 times [2022-11-03 01:49:07,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:07,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606138521] [2022-11-03 01:49:07,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:07,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:09,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:09,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606138521] [2022-11-03 01:49:09,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606138521] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:09,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516919474] [2022-11-03 01:49:09,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:49:09,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:09,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:09,458 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:09,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-03 01:49:09,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:49:09,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:49:09,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 01:49:09,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:10,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:10,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2022-11-03 01:49:10,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:10,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:49:10,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:10,424 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:49:10,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:10,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 36 [2022-11-03 01:49:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:49:10,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:49:11,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:11,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 87 [2022-11-03 01:49:11,566 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:11,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 18 [2022-11-03 01:49:11,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:11,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 114 [2022-11-03 01:49:11,655 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:11,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 44 [2022-11-03 01:49:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:49:12,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516919474] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:49:12,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [861651336] [2022-11-03 01:49:12,227 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:49:12,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:49:12,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 34 [2022-11-03 01:49:12,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995888869] [2022-11-03 01:49:12,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:49:12,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 01:49:12,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:12,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 01:49:12,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1125, Unknown=6, NotChecked=0, Total=1260 [2022-11-03 01:49:12,229 INFO L87 Difference]: Start difference. First operand 2537 states and 11893 transitions. Second operand has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 35 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:50:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:03,440 INFO L93 Difference]: Finished difference Result 6228 states and 24778 transitions. [2022-11-03 01:50:03,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2022-11-03 01:50:03,441 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 35 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:50:03,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:03,454 INFO L225 Difference]: With dead ends: 6228 [2022-11-03 01:50:03,454 INFO L226 Difference]: Without dead ends: 6196 [2022-11-03 01:50:03,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 32 SyntacticMatches, 14 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12387 ImplicationChecksByTransitivity, 47.2s TimeCoverageRelationStatistics Valid=5272, Invalid=27258, Unknown=50, NotChecked=0, Total=32580 [2022-11-03 01:50:03,456 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 752 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 4553 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 7976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 4553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3270 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:03,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 343 Invalid, 7976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 4553 Invalid, 0 Unknown, 3270 Unchecked, 5.1s Time] [2022-11-03 01:50:03,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6196 states. [2022-11-03 01:50:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6196 to 2460. [2022-11-03 01:50:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 2459 states have (on average 4.6978446522976816) internal successors, (11552), 2459 states have internal predecessors, (11552), 0 states have call successors, (0), 0 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-03 01:50:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 11552 transitions. [2022-11-03 01:50:03,576 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 11552 transitions. Word has length 25 [2022-11-03 01:50:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:03,576 INFO L495 AbstractCegarLoop]: Abstraction has 2460 states and 11552 transitions. [2022-11-03 01:50:03,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 35 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 01:50:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 11552 transitions. [2022-11-03 01:50:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:50:03,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:03,581 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:03,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:03,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:03,781 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 01:50:03,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash 165206157, now seen corresponding path program 21 times [2022-11-03 01:50:03,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:03,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344497395] [2022-11-03 01:50:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:03,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:05,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:05,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344497395] [2022-11-03 01:50:05,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344497395] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:05,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228042329] [2022-11-03 01:50:05,748 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:50:05,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:05,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:50:05,749 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:50:05,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-03 01:50:06,025 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:50:06,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:50:06,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-03 01:50:06,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:06,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:50:06,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:06,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:06,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:06,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 01:50:06,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:06,780 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:06,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 60 [2022-11-03 01:50:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:07,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:08,100 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4)) (.cse0 (= (mod c_~sorted3~0 256) 0))) (and (or .cse0 (let ((.cse4 (= (mod c_~sorted2~0 256) 0))) (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_156 Int) (v_ArrVal_1582 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1582) c_~A~0.base))) (or (< (+ 2 v_thread3Thread1of1ForFork0_~i~2_156) c_~N~0) (< |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse1 .cse2)) (not (< (+ v_thread3Thread1of1ForFork0_~i~2_156 1) c_~N~0)) (not (let ((.cse3 (* v_thread3Thread1of1ForFork0_~i~2_156 4))) (< (select .cse1 (+ c_~A~0.offset .cse3)) (select .cse1 (+ c_~A~0.offset .cse3 4))))) (not (<= v_thread3Thread1of1ForFork0_~i~2_156 c_~M~0))))) .cse4) (or (not .cse4) (forall ((v_thread3Thread1of1ForFork0_~i~2_156 Int) (v_ArrVal_1582 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1582) c_~A~0.base))) (or (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse5 .cse2))) (< (+ 2 v_thread3Thread1of1ForFork0_~i~2_156) c_~N~0) (not (< (+ v_thread3Thread1of1ForFork0_~i~2_156 1) c_~N~0)) (not (let ((.cse6 (* v_thread3Thread1of1ForFork0_~i~2_156 4))) (< (select .cse5 (+ c_~A~0.offset .cse6)) (select .cse5 (+ c_~A~0.offset .cse6 4))))) (not (<= v_thread3Thread1of1ForFork0_~i~2_156 c_~M~0)))))) (forall ((v_ArrVal_1582 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1582) c_~A~0.base))) (or (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse7 .cse2))) (forall ((v_thread3Thread1of1ForFork0_~i~2_156 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork0_~i~2_156) c_~N~0) (let ((.cse8 (* v_thread3Thread1of1ForFork0_~i~2_156 4))) (< (select .cse7 (+ c_~A~0.offset .cse8)) (select .cse7 (+ c_~A~0.offset .cse8 4)))) (not (< (+ v_thread3Thread1of1ForFork0_~i~2_156 1) c_~N~0)) (not (<= v_thread3Thread1of1ForFork0_~i~2_156 c_~M~0)))))))))) (or (forall ((v_ArrVal_1582 (Array Int Int))) (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1582) c_~A~0.base) .cse2)))) (not .cse0) (< (+ 2 c_~M~0) c_~N~0)))) is different from false [2022-11-03 01:50:10,103 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_thread3Thread1of1ForFork0_~i~2_156 Int) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1581 (Array Int Int)) (v_ArrVal_1580 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1581))) (let ((.cse0 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1582) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (+ 2 v_thread3Thread1of1ForFork0_~i~2_156) c_~N~0) (not (let ((.cse1 (* v_thread3Thread1of1ForFork0_~i~2_156 4))) (< (select .cse0 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse0 (+ .cse1 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (< (+ v_thread3Thread1of1ForFork0_~i~2_156 1) c_~N~0)) (< 0 v_thread3Thread1of1ForFork0_~i~2_156) (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse0 .cse3)))))) (forall ((v_thread3Thread1of1ForFork0_~i~2_156 Int) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1581 (Array Int Int)) (v_ArrVal_1580 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1581))) (let ((.cse4 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1582) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (+ 2 v_thread3Thread1of1ForFork0_~i~2_156) c_~N~0) (not (< (+ v_thread3Thread1of1ForFork0_~i~2_156 1) c_~N~0)) (< 0 v_thread3Thread1of1ForFork0_~i~2_156) (let ((.cse5 (* v_thread3Thread1of1ForFork0_~i~2_156 4))) (< (select .cse4 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse4 (+ .cse5 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (< (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse4 .cse3))))))))) is different from false [2022-11-03 01:50:10,137 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:10,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 116 treesize of output 80 [2022-11-03 01:50:10,191 INFO L356 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2022-11-03 01:50:10,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6140 treesize of output 5656 [2022-11-03 01:50:10,254 INFO L356 Elim1Store]: treesize reduction 11, result has 47.6 percent of original size [2022-11-03 01:50:10,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5624 treesize of output 4914 [2022-11-03 01:50:10,349 INFO L356 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2022-11-03 01:50:10,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4904 treesize of output 4320 [2022-11-03 01:50:10,448 INFO L356 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2022-11-03 01:50:10,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4288 treesize of output 4012 [2022-11-03 01:50:12,760 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 01:50:12,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 116 treesize of output 1 [2022-11-03 01:50:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:50:12,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228042329] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:50:12,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [114759786] [2022-11-03 01:50:12,877 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:50:12,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:50:12,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-11-03 01:50:12,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962942491] [2022-11-03 01:50:12,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:50:12,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 01:50:12,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:12,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 01:50:12,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1520, Unknown=21, NotChecked=162, Total=1892 [2022-11-03 01:50:12,879 INFO L87 Difference]: Start difference. First operand 2460 states and 11552 transitions. Second operand has 44 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-03 01:50:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:25,458 INFO L93 Difference]: Finished difference Result 4496 states and 19583 transitions. [2022-11-03 01:50:25,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-03 01:50:25,458 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:50:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:25,469 INFO L225 Difference]: With dead ends: 4496 [2022-11-03 01:50:25,469 INFO L226 Difference]: Without dead ends: 4468 [2022-11-03 01:50:25,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 21 SyntacticMatches, 11 SemanticMatches, 105 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3774 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=1822, Invalid=9085, Unknown=21, NotChecked=414, Total=11342 [2022-11-03 01:50:25,470 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 707 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1547 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:25,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 105 Invalid, 3346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1685 Invalid, 0 Unknown, 1547 Unchecked, 1.9s Time] [2022-11-03 01:50:25,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2022-11-03 01:50:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 2465. [2022-11-03 01:50:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2465 states, 2464 states have (on average 4.694805194805195) internal successors, (11568), 2464 states have internal predecessors, (11568), 0 states have call successors, (0), 0 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-03 01:50:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 11568 transitions. [2022-11-03 01:50:25,542 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 11568 transitions. Word has length 25 [2022-11-03 01:50:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:25,543 INFO L495 AbstractCegarLoop]: Abstraction has 2465 states and 11568 transitions. [2022-11-03 01:50:25,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-03 01:50:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 11568 transitions. [2022-11-03 01:50:25,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:50:25,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:25,547 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:25,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:25,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-03 01:50:25,748 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 01:50:25,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:25,748 INFO L85 PathProgramCache]: Analyzing trace with hash 682055527, now seen corresponding path program 22 times [2022-11-03 01:50:25,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:25,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70587107] [2022-11-03 01:50:25,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:25,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:27,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:27,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70587107] [2022-11-03 01:50:27,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70587107] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:27,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060847185] [2022-11-03 01:50:27,497 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:50:27,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:27,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:50:27,498 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:50:27,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-03 01:50:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:27,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 01:50:27,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:27,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:50:27,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:27,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:28,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:28,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 01:50:28,594 INFO L356 Elim1Store]: treesize reduction 64, result has 51.9 percent of original size [2022-11-03 01:50:28,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 110 [2022-11-03 01:50:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:29,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:29,904 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (not (< (+ c_~M~0 1) c_~N~0))) (.cse8 (= (mod c_~sorted3~0 256) 0)) (.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))) (and (or (let ((.cse7 (* 4 c_~M~0))) (let ((.cse4 (= c_~sorted2~0 (* 256 (div c_~sorted2~0 256)))) (.cse1 (+ c_~A~0.offset .cse7)) (.cse2 (+ c_~A~0.offset .cse7 4))) (and (or (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (not (< (select .cse0 .cse1) (select .cse0 .cse2))) (< |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse0 .cse3))))) .cse4) (or (not .cse4) (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (not (< (select .cse5 .cse1) (select .cse5 .cse2))) (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse5 .cse3))))))) (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (< (select .cse6 .cse1) (select .cse6 .cse2)) (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse6 .cse3))))))))) .cse8 .cse9) (or .cse9 (not .cse8) (forall ((v_ArrVal_1635 (Array Int Int))) (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base) .cse3))))))) is different from false [2022-11-03 01:50:29,977 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod c_~sorted1~0 256) 0) (let ((.cse11 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse0 (not (< (+ c_~M~0 1) c_~N~0))) (.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse11))) (.cse2 (+ c_~A~0.offset .cse11 4))) (and (or .cse0 (forall ((v_ArrVal_1635 (Array Int Int))) (not (< .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base) .cse2)))) (not .cse3)) (or .cse3 .cse0 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse5 (+ c_~A~0.offset .cse10)) (.cse6 (+ c_~A~0.offset .cse10 4)) (.cse7 (= c_~sorted2~0 (* 256 (div c_~sorted2~0 256))))) (and (or (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (not (< (select .cse4 .cse5) (select .cse4 .cse6))) (not (< .cse1 (select .cse4 .cse2)))))) (not .cse7)) (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (not (< .cse1 (select .cse8 .cse2))) (< (select .cse8 .cse5) (select .cse8 .cse6))))) (or (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (not (< (select .cse9 .cse5) (select .cse9 .cse6))) (< .cse1 (select .cse9 .cse2))))) .cse7))))))))) is different from false [2022-11-03 01:50:30,048 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse1 (not (< (+ c_~M~0 1) c_~N~0))) (.cse0 (= (mod c_~sorted3~0 256) 0)) (.cse5 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse6 (+ c_~A~0.offset 4))) (and (or .cse0 .cse1 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse8 (= c_~sorted2~0 (* 256 (div c_~sorted2~0 256)))) (.cse3 (+ c_~A~0.offset .cse10)) (.cse4 (+ c_~A~0.offset .cse10 4))) (and (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (< (select .cse2 .cse3) (select .cse2 .cse4)) (not (< .cse5 (select .cse2 .cse6)))))) (or (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (not (< (select .cse7 .cse3) (select .cse7 .cse4))) (< .cse5 (select .cse7 .cse6))))) .cse8) (or (not .cse8) (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (not (< (select .cse9 .cse3) (select .cse9 .cse4))) (not (< .cse5 (select .cse9 .cse6))))))))))) (or .cse1 (not .cse0) (forall ((v_ArrVal_1635 (Array Int Int))) (not (< .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base) .cse6))))))) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:50:30,123 WARN L833 $PredicateComparison]: unable to prove that (or (< c_thread2Thread1of1ForFork2_~i~1 c_~M~0) (let ((.cse1 (not (< (+ c_~M~0 1) c_~N~0))) (.cse0 (= (mod c_~sorted3~0 256) 0)) (.cse5 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse6 (+ c_~A~0.offset 4))) (and (or .cse0 .cse1 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse8 (= c_~sorted2~0 (* 256 (div c_~sorted2~0 256)))) (.cse3 (+ c_~A~0.offset .cse10)) (.cse4 (+ c_~A~0.offset .cse10 4))) (and (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (< (select .cse2 .cse3) (select .cse2 .cse4)) (not (< .cse5 (select .cse2 .cse6)))))) (or (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (not (< (select .cse7 .cse3) (select .cse7 .cse4))) (< .cse5 (select .cse7 .cse6))))) .cse8) (or (not .cse8) (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (not (< (select .cse9 .cse3) (select .cse9 .cse4))) (not (< .cse5 (select .cse9 .cse6))))))))))) (or .cse1 (not .cse0) (forall ((v_ArrVal_1635 (Array Int Int))) (not (< .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base) .cse6))))))) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:50:30,198 WARN L833 $PredicateComparison]: unable to prove that (or (< 0 c_~M~0) (let ((.cse1 (not (< (+ c_~M~0 1) c_~N~0))) (.cse0 (= (mod c_~sorted3~0 256) 0)) (.cse5 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse6 (+ c_~A~0.offset 4))) (and (or .cse0 .cse1 (let ((.cse10 (* 4 c_~M~0))) (let ((.cse8 (= c_~sorted2~0 (* 256 (div c_~sorted2~0 256)))) (.cse3 (+ c_~A~0.offset .cse10)) (.cse4 (+ c_~A~0.offset .cse10 4))) (and (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (< (select .cse2 .cse3) (select .cse2 .cse4)) (not (< .cse5 (select .cse2 .cse6)))))) (or (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (not (< (select .cse7 .cse3) (select .cse7 .cse4))) (< .cse5 (select .cse7 .cse6))))) .cse8) (or (not .cse8) (forall ((v_ArrVal_1635 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (not (< (select .cse9 .cse3) (select .cse9 .cse4))) (not (< .cse5 (select .cse9 .cse6))))))))))) (or .cse1 (not .cse0) (forall ((v_ArrVal_1635 (Array Int Int))) (not (< .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base) .cse6))))))) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:50:30,348 WARN L833 $PredicateComparison]: unable to prove that (or (< 0 c_~M~0) (= (mod c_~sorted1~0 256) 0) (let ((.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse0 (not (< (+ c_~M~0 1) c_~N~0))) (.cse2 (+ c_~A~0.offset 4))) (and (or .cse0 (forall ((v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int))) (not (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1634))) (< (select (select .cse1 c_~A~0.base) c_~A~0.offset) (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base) .cse2))))) (not .cse3)) (or .cse3 .cse0 (let ((.cse13 (* 4 c_~M~0))) (let ((.cse8 (= c_~sorted2~0 (* 256 (div c_~sorted2~0 256)))) (.cse5 (+ c_~A~0.offset .cse13)) (.cse6 (+ c_~A~0.offset .cse13 4))) (and (or (forall ((v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1634))) (let ((.cse4 (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (not (< (select .cse4 .cse5) (select .cse4 .cse6))) (< (select (select .cse7 c_~A~0.base) c_~A~0.offset) (select .cse4 .cse2)))))) .cse8) (forall ((v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1634))) (let ((.cse10 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (not (< (select (select .cse9 c_~A~0.base) c_~A~0.offset) (select .cse10 .cse2))) (< (select .cse10 .cse5) (select .cse10 .cse6)))))) (or (not .cse8) (forall ((v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1634))) (let ((.cse11 (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) c_~A~0.base))) (or (not (< (select .cse11 .cse5) (select .cse11 .cse6))) (not (< (select (select .cse12 c_~A~0.base) c_~A~0.offset) (select .cse11 .cse2))))))))))))))) is different from false [2022-11-03 01:50:30,464 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1633) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1634))) (let ((.cse0 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (let ((.cse1 (* ~M~0 4))) (< (select .cse0 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse0 (+ .cse1 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse0 .cse3))))))))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1633) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1634))) (let ((.cse4 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (let ((.cse5 (* ~M~0 4))) (< (select .cse4 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse4 (+ .cse5 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse4 .cse3)))))) (< 0 ~M~0) (< ~M~0 0))))) is different from false [2022-11-03 01:50:30,487 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:30,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 116 treesize of output 80 [2022-11-03 01:50:30,515 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-03 01:50:30,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3388 treesize of output 3104 [2022-11-03 01:50:30,581 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-03 01:50:30,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3096 treesize of output 2744 [2022-11-03 01:50:30,636 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 01:50:30,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2736 treesize of output 2276 [2022-11-03 01:50:30,721 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-03 01:50:30,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2272 treesize of output 2100 [2022-11-03 01:50:30,981 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 01:50:30,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 1 [2022-11-03 01:50:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 01:50:31,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060847185] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:50:31,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1263561533] [2022-11-03 01:50:31,015 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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-03 01:50:31,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:50:31,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 38 [2022-11-03 01:50:31,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930976328] [2022-11-03 01:50:31,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:50:31,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 01:50:31,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:31,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 01:50:31,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=960, Unknown=7, NotChecked=476, Total=1560 [2022-11-03 01:50:31,017 INFO L87 Difference]: Start difference. First operand 2465 states and 11568 transitions. Second operand has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-03 01:50:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:35,502 INFO L93 Difference]: Finished difference Result 2820 states and 12578 transitions. [2022-11-03 01:50:35,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 01:50:35,502 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:50:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:35,509 INFO L225 Difference]: With dead ends: 2820 [2022-11-03 01:50:35,509 INFO L226 Difference]: Without dead ends: 2813 [2022-11-03 01:50:35,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=484, Invalid=2617, Unknown=7, NotChecked=798, Total=3906 [2022-11-03 01:50:35,510 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 282 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 564 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:35,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 79 Invalid, 2188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1590 Invalid, 0 Unknown, 564 Unchecked, 1.4s Time] [2022-11-03 01:50:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2022-11-03 01:50:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2462. [2022-11-03 01:50:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2462 states, 2461 states have (on average 4.696058512799675) internal successors, (11557), 2461 states have internal predecessors, (11557), 0 states have call successors, (0), 0 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-03 01:50:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 11557 transitions. [2022-11-03 01:50:35,578 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 11557 transitions. Word has length 25 [2022-11-03 01:50:35,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:35,578 INFO L495 AbstractCegarLoop]: Abstraction has 2462 states and 11557 transitions. [2022-11-03 01:50:35,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-03 01:50:35,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 11557 transitions. [2022-11-03 01:50:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:50:35,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:35,582 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:35,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:35,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-03 01:50:35,783 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 01:50:35,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:35,783 INFO L85 PathProgramCache]: Analyzing trace with hash -239139029, now seen corresponding path program 23 times [2022-11-03 01:50:35,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:35,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432151538] [2022-11-03 01:50:35,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:35,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:37,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:37,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432151538] [2022-11-03 01:50:37,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432151538] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:37,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881100509] [2022-11-03 01:50:37,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:50:37,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:37,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:50:37,590 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:50:37,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816ae5d0-7902-481c-8976-7d6b3db91eed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-03 01:50:37,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:50:37,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:50:37,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 01:50:37,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:37,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:50:37,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:38,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:38,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:38,784 INFO L356 Elim1Store]: treesize reduction 52, result has 62.0 percent of original size [2022-11-03 01:50:38,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 126 [2022-11-03 01:50:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:39,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:40,281 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse5 (+ c_~A~0.offset 4)) (.cse1 (not (< (+ c_~M~0 1) c_~N~0))) (.cse0 (= (mod c_~sorted3~0 256) 0))) (and (or .cse0 .cse1 (let ((.cse9 (* 4 c_~M~0))) (let ((.cse3 (+ c_~A~0.offset .cse9)) (.cse4 (+ c_~A~0.offset .cse9 4)) (.cse6 (= (mod c_~sorted2~0 256) 0))) (and (forall ((v_ArrVal_1688 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1688) c_~A~0.base))) (or (< (select .cse2 .cse3) (select .cse2 .cse4)) (not (< (select .cse2 c_~A~0.offset) (select .cse2 .cse5)))))) (or (not .cse6) (forall ((v_ArrVal_1688 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1688) c_~A~0.base))) (or (not (< (select .cse7 c_~A~0.offset) (select .cse7 .cse5))) (not (< (select .cse7 .cse3) (select .cse7 .cse4))))))) (or (forall ((v_ArrVal_1688 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1688) c_~A~0.base))) (or (< (select .cse8 c_~A~0.offset) (select .cse8 .cse5)) (not (< (select .cse8 .cse3) (select .cse8 .cse4)))))) .cse6))))) (or (forall ((v_ArrVal_1688 (Array Int Int))) (not (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1688) c_~A~0.base))) (< (select .cse10 c_~A~0.offset) (select .cse10 .cse5))))) .cse1 (not .cse0)))) (< c_thread2Thread1of1ForFork2_~i~1 c_~M~0) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:50:40,341 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse5 (+ c_~A~0.offset 4)) (.cse1 (not (< (+ c_~M~0 1) c_~N~0))) (.cse0 (= (mod c_~sorted3~0 256) 0))) (and (or .cse0 .cse1 (let ((.cse9 (* 4 c_~M~0))) (let ((.cse3 (+ c_~A~0.offset .cse9)) (.cse4 (+ c_~A~0.offset .cse9 4)) (.cse6 (= (mod c_~sorted2~0 256) 0))) (and (forall ((v_ArrVal_1688 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1688) c_~A~0.base))) (or (< (select .cse2 .cse3) (select .cse2 .cse4)) (not (< (select .cse2 c_~A~0.offset) (select .cse2 .cse5)))))) (or (not .cse6) (forall ((v_ArrVal_1688 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1688) c_~A~0.base))) (or (not (< (select .cse7 c_~A~0.offset) (select .cse7 .cse5))) (not (< (select .cse7 .cse3) (select .cse7 .cse4))))))) (or (forall ((v_ArrVal_1688 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1688) c_~A~0.base))) (or (< (select .cse8 c_~A~0.offset) (select .cse8 .cse5)) (not (< (select .cse8 .cse3) (select .cse8 .cse4)))))) .cse6))))) (or (forall ((v_ArrVal_1688 (Array Int Int))) (not (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1688) c_~A~0.base))) (< (select .cse10 c_~A~0.offset) (select .cse10 .cse5))))) .cse1 (not .cse0)))) (< 0 c_~M~0) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:50:40,460 WARN L833 $PredicateComparison]: unable to prove that (or (< 0 c_~M~0) (let ((.cse1 (not (< (+ c_~M~0 1) c_~N~0))) (.cse0 (= (mod c_~sorted3~0 256) 0)) (.cse3 (+ c_~A~0.offset 4))) (and (or .cse0 .cse1 (let ((.cse9 (* 4 c_~M~0))) (let ((.cse6 (= (mod c_~sorted2~0 256) 0)) (.cse4 (+ c_~A~0.offset .cse9)) (.cse5 (+ c_~A~0.offset .cse9 4))) (and (or (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1687) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1688) c_~A~0.base))) (or (< (select .cse2 c_~A~0.offset) (select .cse2 .cse3)) (not (< (select .cse2 .cse4) (select .cse2 .cse5)))))) .cse6) (or (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1687) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1688) c_~A~0.base))) (or (not (< (select .cse7 c_~A~0.offset) (select .cse7 .cse3))) (not (< (select .cse7 .cse4) (select .cse7 .cse5)))))) (not .cse6)) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1687) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1688) c_~A~0.base))) (or (not (< (select .cse8 c_~A~0.offset) (select .cse8 .cse3))) (< (select .cse8 .cse4) (select .cse8 .cse5))))))))) (or .cse1 (not .cse0) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int))) (not (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1687) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1688) c_~A~0.base))) (< (select .cse10 c_~A~0.offset) (select .cse10 .cse3)))))))) (= (mod c_~sorted1~0 256) 0)) is different from false [2022-11-03 01:50:40,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:50:40,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881100509] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:50:40,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1109755594] [2022-11-03 01:50:40,562 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 01:50:40,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:50:40,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 38 [2022-11-03 01:50:40,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642606654] [2022-11-03 01:50:40,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:50:40,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 01:50:40,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:40,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 01:50:40,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1121, Unknown=3, NotChecked=210, Total=1482 [2022-11-03 01:50:40,567 INFO L87 Difference]: Start difference. First operand 2462 states and 11557 transitions. Second operand has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 39 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)