./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7fdb1595c27c144c3bf111946260cb3946663200a2d53f7fba5455031291c4f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 06:58:46,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 06:58:46,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 06:58:46,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 06:58:46,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 06:58:46,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 06:58:46,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 06:58:46,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 06:58:46,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 06:58:46,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 06:58:46,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 06:58:46,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 06:58:46,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 06:58:46,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 06:58:46,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 06:58:46,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 06:58:46,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 06:58:46,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 06:58:46,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 06:58:46,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 06:58:46,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 06:58:46,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 06:58:46,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 06:58:46,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 06:58:46,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 06:58:46,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 06:58:46,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 06:58:46,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 06:58:46,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 06:58:46,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 06:58:46,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 06:58:46,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 06:58:46,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 06:58:46,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 06:58:46,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 06:58:46,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 06:58:46,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 06:58:46,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 06:58:46,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 06:58:46,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 06:58:46,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 06:58:46,476 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 06:58:46,491 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 06:58:46,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 06:58:46,492 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 06:58:46,492 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 06:58:46,492 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 06:58:46,492 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 06:58:46,492 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 06:58:46,493 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 06:58:46,493 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 06:58:46,493 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 06:58:46,493 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 06:58:46,493 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 06:58:46,493 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 06:58:46,493 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 06:58:46,493 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 06:58:46,494 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 06:58:46,494 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 06:58:46,494 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 06:58:46,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 06:58:46,494 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 06:58:46,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 06:58:46,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 06:58:46,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 06:58:46,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 06:58:46,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 06:58:46,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 06:58:46,495 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 06:58:46,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 06:58:46,496 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 06:58:46,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 06:58:46,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 06:58:46,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 06:58:46,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:58:46,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 06:58:46,496 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 06:58:46,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 06:58:46,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 06:58:46,497 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 06:58:46,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 06:58:46,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 06:58:46,497 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 06:58:46,497 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_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7fdb1595c27c144c3bf111946260cb3946663200a2d53f7fba5455031291c4f [2022-12-14 06:58:46,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 06:58:46,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 06:58:46,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 06:58:46,686 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 06:58:46,686 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 06:58:46,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2022-12-14 06:58:49,229 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 06:58:49,352 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 06:58:49,352 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2022-12-14 06:58:49,357 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/data/d29d2b11c/55d00fdd34e4436db84af1f309afe07c/FLAGd3dfcc39b [2022-12-14 06:58:49,367 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/data/d29d2b11c/55d00fdd34e4436db84af1f309afe07c [2022-12-14 06:58:49,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 06:58:49,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 06:58:49,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 06:58:49,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 06:58:49,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 06:58:49,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:58:49" (1/1) ... [2022-12-14 06:58:49,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325e90bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:58:49, skipping insertion in model container [2022-12-14 06:58:49,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:58:49" (1/1) ... [2022-12-14 06:58:49,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 06:58:49,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:58:49,512 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c[2695,2708] [2022-12-14 06:58:49,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:58:49,526 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 06:58:49,542 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c[2695,2708] [2022-12-14 06:58:49,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:58:49,556 INFO L208 MainTranslator]: Completed translation [2022-12-14 06:58:49,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:58:49 WrapperNode [2022-12-14 06:58:49,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 06:58:49,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 06:58:49,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 06:58:49,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 06:58:49,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:58:49" (1/1) ... [2022-12-14 06:58:49,570 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:58:49" (1/1) ... [2022-12-14 06:58:49,597 INFO L138 Inliner]: procedures = 25, calls = 37, calls flagged for inlining = 15, calls inlined = 19, statements flattened = 194 [2022-12-14 06:58:49,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 06:58:49,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 06:58:49,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 06:58:49,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 06:58:49,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:58:49" (1/1) ... [2022-12-14 06:58:49,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:58:49" (1/1) ... [2022-12-14 06:58:49,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:58:49" (1/1) ... [2022-12-14 06:58:49,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:58:49" (1/1) ... [2022-12-14 06:58:49,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:58:49" (1/1) ... [2022-12-14 06:58:49,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:58:49" (1/1) ... [2022-12-14 06:58:49,619 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:58:49" (1/1) ... [2022-12-14 06:58:49,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:58:49" (1/1) ... [2022-12-14 06:58:49,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 06:58:49,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 06:58:49,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 06:58:49,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 06:58:49,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:58:49" (1/1) ... [2022-12-14 06:58:49,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:58:49,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:58:49,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 06:58:49,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 06:58:49,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 06:58:49,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 06:58:49,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 06:58:49,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 06:58:49,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 06:58:49,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 06:58:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 06:58:49,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 06:58:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 06:58:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 06:58:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 06:58:49,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 06:58:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 06:58:49,684 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 06:58:49,768 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 06:58:49,770 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 06:58:50,066 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 06:58:50,076 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 06:58:50,076 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 06:58:50,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:58:50 BoogieIcfgContainer [2022-12-14 06:58:50,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 06:58:50,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 06:58:50,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 06:58:50,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 06:58:50,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 06:58:49" (1/3) ... [2022-12-14 06:58:50,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fda8311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:58:50, skipping insertion in model container [2022-12-14 06:58:50,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:58:49" (2/3) ... [2022-12-14 06:58:50,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fda8311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:58:50, skipping insertion in model container [2022-12-14 06:58:50,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:58:50" (3/3) ... [2022-12-14 06:58:50,085 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2022-12-14 06:58:50,091 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 06:58:50,099 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 06:58:50,100 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 06:58:50,100 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 06:58:50,167 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 06:58:50,194 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 06:58:50,205 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 262 transitions, 540 flow [2022-12-14 06:58:50,207 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 262 transitions, 540 flow [2022-12-14 06:58:50,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 262 transitions, 540 flow [2022-12-14 06:58:50,281 INFO L130 PetriNetUnfolder]: 21/260 cut-off events. [2022-12-14 06:58:50,281 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 06:58:50,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 260 events. 21/260 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 293 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 166. Up to 2 conditions per place. [2022-12-14 06:58:50,289 INFO L119 LiptonReduction]: Number of co-enabled transitions 7208 [2022-12-14 06:58:55,153 INFO L134 LiptonReduction]: Checked pairs total: 6805 [2022-12-14 06:58:55,154 INFO L136 LiptonReduction]: Total number of compositions: 304 [2022-12-14 06:58:55,159 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 23 transitions, 62 flow [2022-12-14 06:58:55,169 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 44 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 43 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:55,181 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 06:58:55,185 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;@61e4a9ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 06:58:55,185 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-14 06:58:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 43 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 06:58:55,190 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:58:55,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:58:55,191 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:58:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:58:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1856805890, now seen corresponding path program 1 times [2022-12-14 06:58:55,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:58:55,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629813104] [2022-12-14 06:58:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:58:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:58:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:58:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:58:55,438 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:58:55,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629813104] [2022-12-14 06:58:55,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629813104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:58:55,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:58:55,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:58:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881481586] [2022-12-14 06:58:55,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:58:55,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:58:55,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:58:55,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:58:55,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:58:55,469 INFO L87 Difference]: Start difference. First operand has 44 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 43 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:58:55,517 INFO L93 Difference]: Finished difference Result 46 states and 98 transitions. [2022-12-14 06:58:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:58:55,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-12-14 06:58:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:58:55,526 INFO L225 Difference]: With dead ends: 46 [2022-12-14 06:58:55,526 INFO L226 Difference]: Without dead ends: 46 [2022-12-14 06:58:55,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:58:55,529 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:58:55,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:58:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-12-14 06:58:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-12-14 06:58:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 45 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 98 transitions. [2022-12-14 06:58:55,556 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 98 transitions. Word has length 15 [2022-12-14 06:58:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:58:55,557 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 98 transitions. [2022-12-14 06:58:55,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 98 transitions. [2022-12-14 06:58:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 06:58:55,558 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:58:55,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:58:55,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 06:58:55,559 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:58:55,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:58:55,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1788450018, now seen corresponding path program 1 times [2022-12-14 06:58:55,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:58:55,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550138244] [2022-12-14 06:58:55,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:58:55,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:58:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:58:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:58:55,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:58:55,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550138244] [2022-12-14 06:58:55,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550138244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:58:55,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956495432] [2022-12-14 06:58:55,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:58:55,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:58:55,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:58:55,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:58:55,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 06:58:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:58:55,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 06:58:55,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:58:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:58:55,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:58:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:58:55,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956495432] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:58:55,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1569367364] [2022-12-14 06:58:55,871 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:58:55,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:58:55,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-14 06:58:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073266985] [2022-12-14 06:58:55,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:58:55,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:58:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:58:55,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:58:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:58:55,876 INFO L87 Difference]: Start difference. First operand 46 states and 98 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:58:55,934 INFO L93 Difference]: Finished difference Result 52 states and 104 transitions. [2022-12-14 06:58:55,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:58:55,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 17 [2022-12-14 06:58:55,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:58:55,936 INFO L225 Difference]: With dead ends: 52 [2022-12-14 06:58:55,936 INFO L226 Difference]: Without dead ends: 52 [2022-12-14 06:58:55,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:58:55,937 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:58:55,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:58:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-14 06:58:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-12-14 06:58:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 104 transitions. [2022-12-14 06:58:55,944 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 104 transitions. Word has length 17 [2022-12-14 06:58:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:58:55,945 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 104 transitions. [2022-12-14 06:58:55,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 104 transitions. [2022-12-14 06:58:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 06:58:55,946 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:58:55,946 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:58:55,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 06:58:56,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-12-14 06:58:56,147 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:58:56,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:58:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash -703272962, now seen corresponding path program 2 times [2022-12-14 06:58:56,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:58:56,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877290647] [2022-12-14 06:58:56,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:58:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:58:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:58:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 06:58:56,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:58:56,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877290647] [2022-12-14 06:58:56,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877290647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:58:56,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124209146] [2022-12-14 06:58:56,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:58:56,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:58:56,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:58:56,314 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:58:56,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 06:58:56,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 06:58:56,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:58:56,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 06:58:56,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:58:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 06:58:56,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:58:56,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124209146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:58:56,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:58:56,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2022-12-14 06:58:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696970489] [2022-12-14 06:58:56,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:58:56,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:58:56,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:58:56,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:58:56,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-14 06:58:56,428 INFO L87 Difference]: Start difference. First operand 52 states and 104 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:58:56,498 INFO L93 Difference]: Finished difference Result 60 states and 124 transitions. [2022-12-14 06:58:56,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:58:56,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 06:58:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:58:56,500 INFO L225 Difference]: With dead ends: 60 [2022-12-14 06:58:56,500 INFO L226 Difference]: Without dead ends: 60 [2022-12-14 06:58:56,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:58:56,502 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:58:56,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:58:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-14 06:58:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2022-12-14 06:58:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 55 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 114 transitions. [2022-12-14 06:58:56,506 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 114 transitions. Word has length 23 [2022-12-14 06:58:56,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:58:56,507 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 114 transitions. [2022-12-14 06:58:56,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2022-12-14 06:58:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 06:58:56,508 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:58:56,508 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:58:56,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 06:58:56,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:58:56,708 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:58:56,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:58:56,709 INFO L85 PathProgramCache]: Analyzing trace with hash -268197796, now seen corresponding path program 3 times [2022-12-14 06:58:56,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:58:56,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094449213] [2022-12-14 06:58:56,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:58:56,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:58:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:58:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 06:58:56,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:58:56,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094449213] [2022-12-14 06:58:56,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094449213] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:58:56,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747227357] [2022-12-14 06:58:56,817 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 06:58:56,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:58:56,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:58:56,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:58:56,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 06:58:56,905 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 06:58:56,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:58:56,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 06:58:56,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:58:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 06:58:56,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:58:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 06:58:57,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747227357] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:58:57,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [850025255] [2022-12-14 06:58:57,002 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:58:57,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:58:57,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-14 06:58:57,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492980511] [2022-12-14 06:58:57,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:58:57,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 06:58:57,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:58:57,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 06:58:57,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-12-14 06:58:57,004 INFO L87 Difference]: Start difference. First operand 56 states and 114 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:58:57,075 INFO L93 Difference]: Finished difference Result 58 states and 116 transitions. [2022-12-14 06:58:57,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 06:58:57,076 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 06:58:57,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:58:57,076 INFO L225 Difference]: With dead ends: 58 [2022-12-14 06:58:57,076 INFO L226 Difference]: Without dead ends: 58 [2022-12-14 06:58:57,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-12-14 06:58:57,078 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:58:57,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:58:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-14 06:58:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-12-14 06:58:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.0350877192982457) internal successors, (116), 57 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 116 transitions. [2022-12-14 06:58:57,085 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 116 transitions. Word has length 23 [2022-12-14 06:58:57,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:58:57,085 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 116 transitions. [2022-12-14 06:58:57,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 116 transitions. [2022-12-14 06:58:57,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 06:58:57,086 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:58:57,086 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:58:57,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 06:58:57,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:58:57,287 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:58:57,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:58:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash 130455420, now seen corresponding path program 4 times [2022-12-14 06:58:57,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:58:57,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365171718] [2022-12-14 06:58:57,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:58:57,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:58:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:58:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:58:57,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:58:57,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365171718] [2022-12-14 06:58:57,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365171718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:58:57,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:58:57,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:58:57,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429150313] [2022-12-14 06:58:57,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:58:57,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:58:57,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:58:57,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:58:57,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:58:57,552 INFO L87 Difference]: Start difference. First operand 58 states and 116 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:58:57,625 INFO L93 Difference]: Finished difference Result 66 states and 135 transitions. [2022-12-14 06:58:57,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:58:57,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 06:58:57,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:58:57,626 INFO L225 Difference]: With dead ends: 66 [2022-12-14 06:58:57,626 INFO L226 Difference]: Without dead ends: 66 [2022-12-14 06:58:57,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:58:57,627 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:58:57,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:58:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-14 06:58:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-12-14 06:58:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.076923076923077) internal successors, (135), 65 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 135 transitions. [2022-12-14 06:58:57,631 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 135 transitions. Word has length 25 [2022-12-14 06:58:57,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:58:57,632 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 135 transitions. [2022-12-14 06:58:57,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 135 transitions. [2022-12-14 06:58:57,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 06:58:57,632 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:58:57,633 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:58:57,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 06:58:57,633 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:58:57,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:58:57,633 INFO L85 PathProgramCache]: Analyzing trace with hash -475209943, now seen corresponding path program 1 times [2022-12-14 06:58:57,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:58:57,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942457443] [2022-12-14 06:58:57,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:58:57,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:58:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:58:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 06:58:57,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:58:57,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942457443] [2022-12-14 06:58:57,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942457443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:58:57,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:58:57,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:58:57,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798807242] [2022-12-14 06:58:57,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:58:57,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:58:57,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:58:57,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:58:57,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:58:57,830 INFO L87 Difference]: Start difference. First operand 66 states and 135 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:57,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:58:57,898 INFO L93 Difference]: Finished difference Result 106 states and 219 transitions. [2022-12-14 06:58:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:58:57,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 06:58:57,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:58:57,899 INFO L225 Difference]: With dead ends: 106 [2022-12-14 06:58:57,899 INFO L226 Difference]: Without dead ends: 106 [2022-12-14 06:58:57,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:58:57,900 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:58:57,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:58:57,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-14 06:58:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 72. [2022-12-14 06:58:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 2.1549295774647885) internal successors, (153), 71 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 153 transitions. [2022-12-14 06:58:57,908 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 153 transitions. Word has length 26 [2022-12-14 06:58:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:58:57,908 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 153 transitions. [2022-12-14 06:58:57,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 153 transitions. [2022-12-14 06:58:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 06:58:57,909 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:58:57,909 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:58:57,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 06:58:57,910 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:58:57,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:58:57,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1982749913, now seen corresponding path program 2 times [2022-12-14 06:58:57,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:58:57,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607942787] [2022-12-14 06:58:57,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:58:57,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:58:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:58:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 06:58:58,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:58:58,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607942787] [2022-12-14 06:58:58,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607942787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:58:58,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:58:58,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:58:58,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952076030] [2022-12-14 06:58:58,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:58:58,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:58:58,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:58:58,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:58:58,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:58:58,148 INFO L87 Difference]: Start difference. First operand 72 states and 153 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:58:58,195 INFO L93 Difference]: Finished difference Result 88 states and 182 transitions. [2022-12-14 06:58:58,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:58:58,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 06:58:58,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:58:58,196 INFO L225 Difference]: With dead ends: 88 [2022-12-14 06:58:58,196 INFO L226 Difference]: Without dead ends: 82 [2022-12-14 06:58:58,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:58:58,197 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:58:58,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:58:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-14 06:58:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2022-12-14 06:58:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 2.0985915492957745) internal successors, (149), 71 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 149 transitions. [2022-12-14 06:58:58,203 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 149 transitions. Word has length 26 [2022-12-14 06:58:58,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:58:58,203 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 149 transitions. [2022-12-14 06:58:58,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 149 transitions. [2022-12-14 06:58:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 06:58:58,204 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:58:58,205 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:58:58,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 06:58:58,205 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:58:58,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:58:58,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1864784594, now seen corresponding path program 1 times [2022-12-14 06:58:58,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:58:58,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409467357] [2022-12-14 06:58:58,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:58:58,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:58:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:58:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 06:58:58,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:58:58,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409467357] [2022-12-14 06:58:58,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409467357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:58:58,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:58:58,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:58:58,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344054055] [2022-12-14 06:58:58,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:58:58,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:58:58,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:58:58,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:58:58,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:58:58,366 INFO L87 Difference]: Start difference. First operand 72 states and 149 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:58,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:58:58,433 INFO L93 Difference]: Finished difference Result 98 states and 207 transitions. [2022-12-14 06:58:58,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:58:58,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 06:58:58,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:58:58,435 INFO L225 Difference]: With dead ends: 98 [2022-12-14 06:58:58,435 INFO L226 Difference]: Without dead ends: 96 [2022-12-14 06:58:58,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:58:58,436 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:58:58,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:58:58,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-14 06:58:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2022-12-14 06:58:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.1095890410958904) internal successors, (154), 73 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 154 transitions. [2022-12-14 06:58:58,440 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 154 transitions. Word has length 27 [2022-12-14 06:58:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:58:58,440 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 154 transitions. [2022-12-14 06:58:58,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:58,440 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 154 transitions. [2022-12-14 06:58:58,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 06:58:58,441 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:58:58,441 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:58:58,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 06:58:58,441 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:58:58,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:58:58,441 INFO L85 PathProgramCache]: Analyzing trace with hash -920576644, now seen corresponding path program 2 times [2022-12-14 06:58:58,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:58:58,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606969166] [2022-12-14 06:58:58,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:58:58,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:58:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:58:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:58:58,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:58:58,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606969166] [2022-12-14 06:58:58,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606969166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:58:58,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:58:58,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:58:58,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899636160] [2022-12-14 06:58:58,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:58:58,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:58:58,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:58:58,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:58:58,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:58:58,650 INFO L87 Difference]: Start difference. First operand 74 states and 154 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:58:58,710 INFO L93 Difference]: Finished difference Result 84 states and 178 transitions. [2022-12-14 06:58:58,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:58:58,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 06:58:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:58:58,711 INFO L225 Difference]: With dead ends: 84 [2022-12-14 06:58:58,712 INFO L226 Difference]: Without dead ends: 84 [2022-12-14 06:58:58,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:58:58,713 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:58:58,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:58:58,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-14 06:58:58,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2022-12-14 06:58:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.1095890410958904) internal successors, (154), 73 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 154 transitions. [2022-12-14 06:58:58,717 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 154 transitions. Word has length 27 [2022-12-14 06:58:58,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:58:58,718 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 154 transitions. [2022-12-14 06:58:58,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:58:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 154 transitions. [2022-12-14 06:58:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:58:58,719 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:58:58,719 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:58:58,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 06:58:58,719 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:58:58,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:58:58,719 INFO L85 PathProgramCache]: Analyzing trace with hash 469733659, now seen corresponding path program 1 times [2022-12-14 06:58:58,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:58:58,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69337661] [2022-12-14 06:58:58,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:58:58,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:58:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:58:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:58:59,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:58:59,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69337661] [2022-12-14 06:58:59,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69337661] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:58:59,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062666619] [2022-12-14 06:58:59,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:58:59,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:58:59,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:58:59,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:58:59,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 06:59:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:00,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:00,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:00,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:00,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:00,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:00,853 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 06:59:00,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 77 [2022-12-14 06:59:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:00,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062666619] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:00,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1169805021] [2022-12-14 06:59:00,901 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:00,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:00,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 24 [2022-12-14 06:59:00,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006590896] [2022-12-14 06:59:00,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:00,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 06:59:00,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:00,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 06:59:00,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-12-14 06:59:00,903 INFO L87 Difference]: Start difference. First operand 74 states and 154 transitions. Second operand has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:02,075 INFO L93 Difference]: Finished difference Result 133 states and 294 transitions. [2022-12-14 06:59:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 06:59:02,075 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:02,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:02,077 INFO L225 Difference]: With dead ends: 133 [2022-12-14 06:59:02,077 INFO L226 Difference]: Without dead ends: 116 [2022-12-14 06:59:02,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=288, Invalid=1272, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 06:59:02,078 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 138 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:02,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 0 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 06:59:02,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-12-14 06:59:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 82. [2022-12-14 06:59:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.1481481481481484) internal successors, (174), 81 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 174 transitions. [2022-12-14 06:59:02,081 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 174 transitions. Word has length 28 [2022-12-14 06:59:02,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:02,081 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 174 transitions. [2022-12-14 06:59:02,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:02,082 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 174 transitions. [2022-12-14 06:59:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:02,082 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:02,082 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:02,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 06:59:02,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 06:59:02,284 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:02,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:02,285 INFO L85 PathProgramCache]: Analyzing trace with hash -546227557, now seen corresponding path program 2 times [2022-12-14 06:59:02,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:02,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968139686] [2022-12-14 06:59:02,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:02,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:03,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:03,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968139686] [2022-12-14 06:59:03,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968139686] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:03,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237549560] [2022-12-14 06:59:03,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:59:03,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:03,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:03,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:03,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 06:59:03,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 06:59:03,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:59:03,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:03,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:03,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:03,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:03,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:03,878 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 06:59:03,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-14 06:59:03,913 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 06:59:03,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 06:59:03,919 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 06:59:03,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 06:59:03,923 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 06:59:03,931 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 06:59:03,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 06:59:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:03,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237549560] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:03,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [80869279] [2022-12-14 06:59:03,968 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:03,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:03,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-14 06:59:03,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456556688] [2022-12-14 06:59:03,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:03,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 06:59:03,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:03,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 06:59:03,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-12-14 06:59:03,969 INFO L87 Difference]: Start difference. First operand 82 states and 174 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:04,328 INFO L93 Difference]: Finished difference Result 107 states and 233 transitions. [2022-12-14 06:59:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 06:59:04,329 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:04,329 INFO L225 Difference]: With dead ends: 107 [2022-12-14 06:59:04,330 INFO L226 Difference]: Without dead ends: 102 [2022-12-14 06:59:04,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 06:59:04,330 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:04,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:59:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-14 06:59:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2022-12-14 06:59:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.1797752808988764) internal successors, (194), 89 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 194 transitions. [2022-12-14 06:59:04,333 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 194 transitions. Word has length 28 [2022-12-14 06:59:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:04,334 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 194 transitions. [2022-12-14 06:59:04,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 194 transitions. [2022-12-14 06:59:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:04,334 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:04,334 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:04,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 06:59:04,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:04,536 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:04,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:04,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1380721601, now seen corresponding path program 3 times [2022-12-14 06:59:04,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:04,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026328798] [2022-12-14 06:59:04,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:04,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:05,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:05,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026328798] [2022-12-14 06:59:05,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026328798] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:05,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561578103] [2022-12-14 06:59:05,249 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 06:59:05,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:05,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:05,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:05,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 06:59:05,376 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 06:59:05,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:59:05,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:05,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:05,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:05,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:05,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:06,128 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 06:59:06,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-14 06:59:06,172 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 06:59:06,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 06:59:06,180 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 06:59:06,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 06:59:06,185 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 06:59:06,193 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 06:59:06,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 06:59:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:06,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561578103] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:06,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [990026076] [2022-12-14 06:59:06,230 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:06,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:06,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-14 06:59:06,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679832805] [2022-12-14 06:59:06,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:06,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 06:59:06,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:06,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 06:59:06,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-12-14 06:59:06,232 INFO L87 Difference]: Start difference. First operand 90 states and 194 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:06,845 INFO L93 Difference]: Finished difference Result 109 states and 236 transitions. [2022-12-14 06:59:06,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 06:59:06,845 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:06,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:06,846 INFO L225 Difference]: With dead ends: 109 [2022-12-14 06:59:06,846 INFO L226 Difference]: Without dead ends: 104 [2022-12-14 06:59:06,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2022-12-14 06:59:06,846 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:06,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:59:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-14 06:59:06,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2022-12-14 06:59:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.230769230769231) internal successors, (203), 91 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 203 transitions. [2022-12-14 06:59:06,849 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 203 transitions. Word has length 28 [2022-12-14 06:59:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:06,849 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 203 transitions. [2022-12-14 06:59:06,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 203 transitions. [2022-12-14 06:59:06,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:06,850 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:06,850 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:06,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 06:59:07,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 06:59:07,051 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:07,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:07,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1307377371, now seen corresponding path program 4 times [2022-12-14 06:59:07,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:07,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488722094] [2022-12-14 06:59:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:07,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:07,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488722094] [2022-12-14 06:59:07,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488722094] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:07,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591083257] [2022-12-14 06:59:07,981 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 06:59:07,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:07,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:07,982 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:07,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 06:59:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:08,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:08,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:08,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:08,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:08,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:08,781 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 06:59:08,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-14 06:59:08,819 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 06:59:08,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 06:59:08,826 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 06:59:08,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 06:59:08,831 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 06:59:08,838 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 06:59:08,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 06:59:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:08,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591083257] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:08,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1654701761] [2022-12-14 06:59:08,872 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:08,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:08,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-14 06:59:08,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070820985] [2022-12-14 06:59:08,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:08,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 06:59:08,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:08,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 06:59:08,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-12-14 06:59:08,874 INFO L87 Difference]: Start difference. First operand 92 states and 203 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:09,436 INFO L93 Difference]: Finished difference Result 125 states and 273 transitions. [2022-12-14 06:59:09,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 06:59:09,436 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:09,436 INFO L225 Difference]: With dead ends: 125 [2022-12-14 06:59:09,436 INFO L226 Difference]: Without dead ends: 114 [2022-12-14 06:59:09,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 06:59:09,437 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:09,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:59:09,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-14 06:59:09,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2022-12-14 06:59:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.2371134020618557) internal successors, (217), 97 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 217 transitions. [2022-12-14 06:59:09,442 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 217 transitions. Word has length 28 [2022-12-14 06:59:09,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:09,442 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 217 transitions. [2022-12-14 06:59:09,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 217 transitions. [2022-12-14 06:59:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:09,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:09,443 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:09,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 06:59:09,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 06:59:09,645 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:09,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:09,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1018438735, now seen corresponding path program 5 times [2022-12-14 06:59:09,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:09,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851732283] [2022-12-14 06:59:09,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:09,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 06:59:10,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:10,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851732283] [2022-12-14 06:59:10,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851732283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:10,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975325585] [2022-12-14 06:59:10,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:59:10,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:10,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:10,916 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:10,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 06:59:11,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 06:59:11,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:59:11,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:11,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:11,224 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:11,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:11,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:11,712 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-14 06:59:11,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 107 [2022-12-14 06:59:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:11,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975325585] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:11,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1203554848] [2022-12-14 06:59:11,819 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:11,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:11,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 8] total 31 [2022-12-14 06:59:11,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609790679] [2022-12-14 06:59:11,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:11,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 06:59:11,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:11,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 06:59:11,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2022-12-14 06:59:11,821 INFO L87 Difference]: Start difference. First operand 98 states and 217 transitions. Second operand has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:13,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:13,773 INFO L93 Difference]: Finished difference Result 261 states and 575 transitions. [2022-12-14 06:59:13,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 06:59:13,773 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:13,774 INFO L225 Difference]: With dead ends: 261 [2022-12-14 06:59:13,775 INFO L226 Difference]: Without dead ends: 233 [2022-12-14 06:59:13,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=558, Invalid=2864, Unknown=0, NotChecked=0, Total=3422 [2022-12-14 06:59:13,776 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 332 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:13,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 0 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 06:59:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-12-14 06:59:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 104. [2022-12-14 06:59:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.2524271844660193) internal successors, (232), 103 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 232 transitions. [2022-12-14 06:59:13,780 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 232 transitions. Word has length 28 [2022-12-14 06:59:13,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:13,781 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 232 transitions. [2022-12-14 06:59:13,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:13,781 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 232 transitions. [2022-12-14 06:59:13,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:13,782 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:13,782 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:13,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 06:59:13,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 06:59:13,984 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:13,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:13,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1852932779, now seen corresponding path program 6 times [2022-12-14 06:59:13,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:13,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971862376] [2022-12-14 06:59:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:14,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:14,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971862376] [2022-12-14 06:59:14,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971862376] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:14,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391790741] [2022-12-14 06:59:14,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 06:59:14,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:14,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:14,668 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:14,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 06:59:14,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 06:59:14,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:59:14,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:14,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:14,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:14,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2022-12-14 06:59:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:14,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:15,300 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-14 06:59:15,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 107 [2022-12-14 06:59:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:15,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391790741] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:15,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1001752488] [2022-12-14 06:59:15,402 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:15,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:15,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-14 06:59:15,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312617739] [2022-12-14 06:59:15,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:15,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 06:59:15,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:15,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 06:59:15,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-12-14 06:59:15,404 INFO L87 Difference]: Start difference. First operand 104 states and 232 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:15,948 INFO L93 Difference]: Finished difference Result 129 states and 284 transitions. [2022-12-14 06:59:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 06:59:15,948 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:15,949 INFO L225 Difference]: With dead ends: 129 [2022-12-14 06:59:15,949 INFO L226 Difference]: Without dead ends: 124 [2022-12-14 06:59:15,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 06:59:15,949 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:15,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:59:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-12-14 06:59:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 104. [2022-12-14 06:59:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.2524271844660193) internal successors, (232), 103 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 232 transitions. [2022-12-14 06:59:15,952 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 232 transitions. Word has length 28 [2022-12-14 06:59:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:15,952 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 232 transitions. [2022-12-14 06:59:15,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 232 transitions. [2022-12-14 06:59:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:15,953 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:15,953 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:15,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 06:59:16,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:16,154 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:16,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:16,155 INFO L85 PathProgramCache]: Analyzing trace with hash -918549719, now seen corresponding path program 7 times [2022-12-14 06:59:16,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:16,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521997327] [2022-12-14 06:59:16,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:16,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:16,832 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:16,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:16,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521997327] [2022-12-14 06:59:16,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521997327] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:16,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53386065] [2022-12-14 06:59:16,833 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 06:59:16,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:16,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:16,834 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:16,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 06:59:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:16,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:16,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:17,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:17,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:17,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:17,612 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 06:59:17,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 52 [2022-12-14 06:59:17,636 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-14 06:59:17,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-14 06:59:17,642 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-14 06:59:17,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-14 06:59:17,644 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 06:59:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:17,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53386065] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:17,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [297971384] [2022-12-14 06:59:17,661 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:17,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:17,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-14 06:59:17,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480083974] [2022-12-14 06:59:17,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:17,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 06:59:17,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:17,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 06:59:17,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-12-14 06:59:17,662 INFO L87 Difference]: Start difference. First operand 104 states and 232 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:18,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:18,200 INFO L93 Difference]: Finished difference Result 146 states and 330 transitions. [2022-12-14 06:59:18,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 06:59:18,200 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:18,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:18,201 INFO L225 Difference]: With dead ends: 146 [2022-12-14 06:59:18,201 INFO L226 Difference]: Without dead ends: 137 [2022-12-14 06:59:18,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 06:59:18,202 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:18,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:59:18,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-12-14 06:59:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 111. [2022-12-14 06:59:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.2636363636363637) internal successors, (249), 110 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 249 transitions. [2022-12-14 06:59:18,205 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 249 transitions. Word has length 28 [2022-12-14 06:59:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:18,206 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 249 transitions. [2022-12-14 06:59:18,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 249 transitions. [2022-12-14 06:59:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:18,206 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:18,206 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:18,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 06:59:18,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 06:59:18,407 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:18,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:18,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1753043763, now seen corresponding path program 8 times [2022-12-14 06:59:18,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:18,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253783414] [2022-12-14 06:59:18,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:18,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:18,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:18,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253783414] [2022-12-14 06:59:18,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253783414] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:18,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627742940] [2022-12-14 06:59:18,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:59:18,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:18,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:18,981 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:18,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 06:59:19,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 06:59:19,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:59:19,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:19,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:19,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:19,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:19,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:19,790 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 06:59:19,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 52 [2022-12-14 06:59:19,819 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-14 06:59:19,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-14 06:59:19,824 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-14 06:59:19,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-14 06:59:19,826 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 06:59:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:19,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627742940] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:19,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [631369545] [2022-12-14 06:59:19,843 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:19,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:19,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-14 06:59:19,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085438948] [2022-12-14 06:59:19,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:19,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 06:59:19,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:19,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 06:59:19,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2022-12-14 06:59:19,844 INFO L87 Difference]: Start difference. First operand 111 states and 249 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:20,383 INFO L93 Difference]: Finished difference Result 146 states and 330 transitions. [2022-12-14 06:59:20,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 06:59:20,383 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:20,384 INFO L225 Difference]: With dead ends: 146 [2022-12-14 06:59:20,384 INFO L226 Difference]: Without dead ends: 141 [2022-12-14 06:59:20,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2022-12-14 06:59:20,385 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 132 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:20,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 0 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:59:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-12-14 06:59:20,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 109. [2022-12-14 06:59:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.259259259259259) internal successors, (244), 108 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:20,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 244 transitions. [2022-12-14 06:59:20,389 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 244 transitions. Word has length 28 [2022-12-14 06:59:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:20,389 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 244 transitions. [2022-12-14 06:59:20,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 244 transitions. [2022-12-14 06:59:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:20,390 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:20,390 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:20,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 06:59:20,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 06:59:20,592 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:20,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:20,593 INFO L85 PathProgramCache]: Analyzing trace with hash 935055209, now seen corresponding path program 9 times [2022-12-14 06:59:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:20,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282857191] [2022-12-14 06:59:20,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:20,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:21,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:21,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282857191] [2022-12-14 06:59:21,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282857191] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:21,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743825647] [2022-12-14 06:59:21,154 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 06:59:21,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:21,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:21,155 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:21,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 06:59:21,245 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 06:59:21,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:59:21,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:21,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:21,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:21,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:21,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:21,822 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 06:59:21,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 52 [2022-12-14 06:59:21,850 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-14 06:59:21,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-14 06:59:21,855 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-14 06:59:21,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-14 06:59:21,857 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 06:59:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:21,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743825647] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:21,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1932690230] [2022-12-14 06:59:21,873 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:21,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:21,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-14 06:59:21,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240117467] [2022-12-14 06:59:21,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:21,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 06:59:21,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:21,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 06:59:21,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2022-12-14 06:59:21,875 INFO L87 Difference]: Start difference. First operand 109 states and 244 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:22,567 INFO L93 Difference]: Finished difference Result 161 states and 359 transitions. [2022-12-14 06:59:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 06:59:22,568 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:22,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:22,569 INFO L225 Difference]: With dead ends: 161 [2022-12-14 06:59:22,569 INFO L226 Difference]: Without dead ends: 151 [2022-12-14 06:59:22,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=922, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 06:59:22,570 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:22,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:59:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-12-14 06:59:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 111. [2022-12-14 06:59:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.2818181818181817) internal successors, (251), 110 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 251 transitions. [2022-12-14 06:59:22,574 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 251 transitions. Word has length 28 [2022-12-14 06:59:22,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:22,574 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 251 transitions. [2022-12-14 06:59:22,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:22,574 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 251 transitions. [2022-12-14 06:59:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:22,574 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:22,574 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:22,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 06:59:22,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 06:59:22,776 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:22,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1281014733, now seen corresponding path program 10 times [2022-12-14 06:59:22,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:22,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723770391] [2022-12-14 06:59:22,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:22,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:23,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:23,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723770391] [2022-12-14 06:59:23,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723770391] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:23,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722693954] [2022-12-14 06:59:23,322 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 06:59:23,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:23,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:23,323 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:23,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 06:59:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:23,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:23,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:23,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:23,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:23,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:24,120 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 06:59:24,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 52 [2022-12-14 06:59:24,147 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-14 06:59:24,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-14 06:59:24,153 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-14 06:59:24,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-14 06:59:24,156 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 06:59:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:24,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722693954] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:24,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [911059527] [2022-12-14 06:59:24,171 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:24,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:24,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 23 [2022-12-14 06:59:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390783526] [2022-12-14 06:59:24,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:24,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 06:59:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 06:59:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2022-12-14 06:59:24,172 INFO L87 Difference]: Start difference. First operand 111 states and 251 transitions. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:24,865 INFO L93 Difference]: Finished difference Result 203 states and 456 transitions. [2022-12-14 06:59:24,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 06:59:24,865 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:24,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:24,866 INFO L225 Difference]: With dead ends: 203 [2022-12-14 06:59:24,866 INFO L226 Difference]: Without dead ends: 193 [2022-12-14 06:59:24,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 06:59:24,867 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 153 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:24,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 0 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:59:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-12-14 06:59:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 119. [2022-12-14 06:59:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 2.2796610169491527) internal successors, (269), 118 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 269 transitions. [2022-12-14 06:59:24,870 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 269 transitions. Word has length 28 [2022-12-14 06:59:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:24,870 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 269 transitions. [2022-12-14 06:59:24,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 269 transitions. [2022-12-14 06:59:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:24,870 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:24,870 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:24,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 06:59:25,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:25,071 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:25,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:25,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1740900873, now seen corresponding path program 11 times [2022-12-14 06:59:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:25,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26803179] [2022-12-14 06:59:25,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:25,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:25,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:25,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26803179] [2022-12-14 06:59:25,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26803179] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:25,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655150286] [2022-12-14 06:59:25,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:59:25,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:25,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:25,557 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:25,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 06:59:25,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 06:59:25,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:59:25,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:25,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:25,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:25,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:25,828 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:25,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:26,410 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 06:59:26,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-14 06:59:26,446 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 06:59:26,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 06:59:26,454 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 06:59:26,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 06:59:26,458 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 06:59:26,465 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 06:59:26,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 06:59:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:26,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655150286] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:26,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1472860746] [2022-12-14 06:59:26,502 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:26,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:26,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-14 06:59:26,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048703095] [2022-12-14 06:59:26,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:26,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 06:59:26,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:26,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 06:59:26,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2022-12-14 06:59:26,504 INFO L87 Difference]: Start difference. First operand 119 states and 269 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:26,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:26,923 INFO L93 Difference]: Finished difference Result 154 states and 350 transitions. [2022-12-14 06:59:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 06:59:26,923 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:26,925 INFO L225 Difference]: With dead ends: 154 [2022-12-14 06:59:26,925 INFO L226 Difference]: Without dead ends: 149 [2022-12-14 06:59:26,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 06:59:26,926 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:26,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:59:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-12-14 06:59:26,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 123. [2022-12-14 06:59:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.30327868852459) internal successors, (281), 122 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 281 transitions. [2022-12-14 06:59:26,929 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 281 transitions. Word has length 28 [2022-12-14 06:59:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:26,929 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 281 transitions. [2022-12-14 06:59:26,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 281 transitions. [2022-12-14 06:59:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:26,930 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:26,930 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:26,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 06:59:27,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:27,131 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:27,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1719572379, now seen corresponding path program 12 times [2022-12-14 06:59:27,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:27,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636785478] [2022-12-14 06:59:27,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:27,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:27,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:27,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636785478] [2022-12-14 06:59:27,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636785478] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:27,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231502201] [2022-12-14 06:59:27,640 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 06:59:27,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:27,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:27,641 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:27,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 06:59:27,746 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 06:59:27,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:59:27,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:27,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:27,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:27,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:27,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:28,312 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 06:59:28,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-14 06:59:28,339 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 06:59:28,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 06:59:28,344 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 06:59:28,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 06:59:28,348 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 06:59:28,353 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 06:59:28,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 06:59:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:28,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231502201] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:28,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1709582314] [2022-12-14 06:59:28,384 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:28,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:28,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-14 06:59:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370318782] [2022-12-14 06:59:28,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:28,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 06:59:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:28,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 06:59:28,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2022-12-14 06:59:28,385 INFO L87 Difference]: Start difference. First operand 123 states and 281 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:28,885 INFO L93 Difference]: Finished difference Result 158 states and 356 transitions. [2022-12-14 06:59:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 06:59:28,886 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:28,886 INFO L225 Difference]: With dead ends: 158 [2022-12-14 06:59:28,886 INFO L226 Difference]: Without dead ends: 153 [2022-12-14 06:59:28,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2022-12-14 06:59:28,887 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:28,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:59:28,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-12-14 06:59:28,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 121. [2022-12-14 06:59:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.283333333333333) internal successors, (274), 120 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 274 transitions. [2022-12-14 06:59:28,889 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 274 transitions. Word has length 28 [2022-12-14 06:59:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:28,890 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 274 transitions. [2022-12-14 06:59:28,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 274 transitions. [2022-12-14 06:59:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:28,890 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:28,890 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:28,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 06:59:29,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-14 06:59:29,092 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:29,093 INFO L85 PathProgramCache]: Analyzing trace with hash 112704055, now seen corresponding path program 13 times [2022-12-14 06:59:29,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:29,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327967382] [2022-12-14 06:59:29,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:29,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 06:59:30,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:30,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327967382] [2022-12-14 06:59:30,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327967382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:30,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453976880] [2022-12-14 06:59:30,148 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 06:59:30,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:30,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:30,149 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:30,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 06:59:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:30,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:30,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:30,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:30,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2022-12-14 06:59:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:30,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:30,947 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 06:59:30,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-14 06:59:30,974 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 06:59:30,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 06:59:30,980 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 06:59:30,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 06:59:30,985 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 06:59:30,990 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 06:59:30,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 06:59:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:31,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453976880] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:31,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1183684540] [2022-12-14 06:59:31,027 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:31,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:31,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 8] total 31 [2022-12-14 06:59:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592231432] [2022-12-14 06:59:31,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:31,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 06:59:31,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:31,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 06:59:31,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2022-12-14 06:59:31,028 INFO L87 Difference]: Start difference. First operand 121 states and 274 transitions. Second operand has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:32,131 INFO L93 Difference]: Finished difference Result 175 states and 394 transitions. [2022-12-14 06:59:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 06:59:32,131 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:32,132 INFO L225 Difference]: With dead ends: 175 [2022-12-14 06:59:32,132 INFO L226 Difference]: Without dead ends: 165 [2022-12-14 06:59:32,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=369, Invalid=1887, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 06:59:32,133 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:32,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:59:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-12-14 06:59:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 121. [2022-12-14 06:59:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.283333333333333) internal successors, (274), 120 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 274 transitions. [2022-12-14 06:59:32,135 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 274 transitions. Word has length 28 [2022-12-14 06:59:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:32,136 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 274 transitions. [2022-12-14 06:59:32,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 274 transitions. [2022-12-14 06:59:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:32,136 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:32,136 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:32,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 06:59:32,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 06:59:32,338 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:32,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:32,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2081855245, now seen corresponding path program 14 times [2022-12-14 06:59:32,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:32,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104584227] [2022-12-14 06:59:32,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:32,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:32,937 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:32,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:32,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104584227] [2022-12-14 06:59:32,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104584227] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:32,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029088172] [2022-12-14 06:59:32,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:59:32,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:32,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:32,938 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:32,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 06:59:33,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 06:59:33,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:59:33,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:33,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:33,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:33,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:33,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:33,690 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-14 06:59:33,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 107 [2022-12-14 06:59:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:33,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029088172] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:33,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1713401388] [2022-12-14 06:59:33,796 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:33,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:33,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 23 [2022-12-14 06:59:33,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617573686] [2022-12-14 06:59:33,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:33,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 06:59:33,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:33,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 06:59:33,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2022-12-14 06:59:33,798 INFO L87 Difference]: Start difference. First operand 121 states and 274 transitions. Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:34,460 INFO L93 Difference]: Finished difference Result 177 states and 395 transitions. [2022-12-14 06:59:34,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 06:59:34,461 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:34,462 INFO L225 Difference]: With dead ends: 177 [2022-12-14 06:59:34,462 INFO L226 Difference]: Without dead ends: 163 [2022-12-14 06:59:34,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=980, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 06:59:34,462 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:34,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:59:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-12-14 06:59:34,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2022-12-14 06:59:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.306451612903226) internal successors, (286), 124 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 286 transitions. [2022-12-14 06:59:34,465 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 286 transitions. Word has length 28 [2022-12-14 06:59:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:34,465 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 286 transitions. [2022-12-14 06:59:34,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 286 transitions. [2022-12-14 06:59:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:34,466 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:34,466 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:34,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 06:59:34,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 06:59:34,667 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:34,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:34,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1247361201, now seen corresponding path program 15 times [2022-12-14 06:59:34,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:34,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641345534] [2022-12-14 06:59:34,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:34,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:35,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:35,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641345534] [2022-12-14 06:59:35,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641345534] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:35,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832096406] [2022-12-14 06:59:35,299 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 06:59:35,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:35,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:35,300 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:35,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 06:59:35,408 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 06:59:35,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:59:35,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 06:59:35,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:35,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:35,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:35,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:35,973 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-14 06:59:35,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 107 [2022-12-14 06:59:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:36,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832096406] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:36,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1674448369] [2022-12-14 06:59:36,077 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:36,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:36,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 23 [2022-12-14 06:59:36,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092803031] [2022-12-14 06:59:36,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:36,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 06:59:36,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:36,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 06:59:36,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2022-12-14 06:59:36,079 INFO L87 Difference]: Start difference. First operand 125 states and 286 transitions. Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:36,710 INFO L93 Difference]: Finished difference Result 172 states and 383 transitions. [2022-12-14 06:59:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 06:59:36,710 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:36,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:36,710 INFO L225 Difference]: With dead ends: 172 [2022-12-14 06:59:36,710 INFO L226 Difference]: Without dead ends: 161 [2022-12-14 06:59:36,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 06:59:36,711 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:36,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:59:36,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-12-14 06:59:36,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 123. [2022-12-14 06:59:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.30327868852459) internal successors, (281), 122 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 281 transitions. [2022-12-14 06:59:36,714 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 281 transitions. Word has length 28 [2022-12-14 06:59:36,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:36,714 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 281 transitions. [2022-12-14 06:59:36,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:36,714 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 281 transitions. [2022-12-14 06:59:36,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:36,714 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:36,714 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:36,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-14 06:59:36,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:36,915 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:36,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash -491027927, now seen corresponding path program 16 times [2022-12-14 06:59:36,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:36,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314062138] [2022-12-14 06:59:36,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:36,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:37,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:37,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314062138] [2022-12-14 06:59:37,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314062138] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:37,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623830080] [2022-12-14 06:59:37,506 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 06:59:37,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:37,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:37,507 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:37,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 06:59:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:37,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 06:59:37,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:37,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:59:37,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 06:59:37,805 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:37,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:37,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:38,436 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_1473 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1473))) (= (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse0 ~o_2~0.base) c_~o_2~0.offset))))) (forall ((v_ArrVal_1473 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1473))) (let ((.cse3 (select .cse5 ~o_2~0.base))) (let ((.cse2 (select (select .cse5 c_~o_0~0.base) c_~o_0~0.offset)) (.cse1 (select .cse3 c_~o_2~0.offset))) (or (< .cse1 .cse2) (= (select .cse3 .cse4) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse2 .cse1)))))) (forall ((v_ArrVal_1473 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1473))) (let ((.cse8 (select .cse9 ~o_2~0.base))) (let ((.cse7 (select (select .cse9 c_~o_0~0.base) c_~o_0~0.offset)) (.cse6 (select .cse8 c_~o_2~0.offset))) (or (< .cse6 .cse7) (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse8 .cse4)) (= .cse7 .cse6)))))) (forall ((v_ArrVal_1473 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1473))) (let ((.cse10 (select .cse13 ~o_2~0.base))) (let ((.cse11 (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset)) (.cse12 (select .cse10 c_~o_2~0.offset))) (or (< (select .cse10 .cse4) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (= .cse11 .cse12) (< .cse11 .cse12)))))))) is different from false [2022-12-14 06:59:38,452 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 06:59:38,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2022-12-14 06:59:38,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:38,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-12-14 06:59:38,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:38,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 192 [2022-12-14 06:59:38,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:38,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-14 06:59:39,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:59:39,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:59:39,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:59:39,511 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-14 06:59:39,511 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 1 [2022-12-14 06:59:39,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:59:39,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:59:39,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:59:39,518 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-14 06:59:39,518 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 1 [2022-12-14 06:59:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:39,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623830080] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:39,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1298133002] [2022-12-14 06:59:39,571 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:39,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:39,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 30 [2022-12-14 06:59:39,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231754013] [2022-12-14 06:59:39,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:39,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 06:59:39,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:39,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 06:59:39,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=819, Unknown=1, NotChecked=58, Total=992 [2022-12-14 06:59:39,572 INFO L87 Difference]: Start difference. First operand 123 states and 281 transitions. Second operand has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:41,140 INFO L93 Difference]: Finished difference Result 212 states and 489 transitions. [2022-12-14 06:59:41,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 06:59:41,140 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:41,141 INFO L225 Difference]: With dead ends: 212 [2022-12-14 06:59:41,141 INFO L226 Difference]: Without dead ends: 207 [2022-12-14 06:59:41,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=303, Invalid=1506, Unknown=1, NotChecked=82, Total=1892 [2022-12-14 06:59:41,142 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 11 mSolverCounterUnsat, 58 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 58 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:41,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 840 Invalid, 58 Unknown, 68 Unchecked, 1.1s Time] [2022-12-14 06:59:41,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-12-14 06:59:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 131. [2022-12-14 06:59:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 2.3230769230769233) internal successors, (302), 130 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 302 transitions. [2022-12-14 06:59:41,145 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 302 transitions. Word has length 28 [2022-12-14 06:59:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:41,145 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 302 transitions. [2022-12-14 06:59:41,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 302 transitions. [2022-12-14 06:59:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:41,146 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:41,146 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:41,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 06:59:41,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 06:59:41,347 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:41,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1325521971, now seen corresponding path program 17 times [2022-12-14 06:59:41,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:41,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476166301] [2022-12-14 06:59:41,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:41,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:41,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:41,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476166301] [2022-12-14 06:59:41,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476166301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:41,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051538966] [2022-12-14 06:59:41,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:59:41,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:41,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:41,927 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:41,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 06:59:42,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 06:59:42,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:59:42,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 06:59:42,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:42,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:59:42,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 06:59:42,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:42,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:42,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:42,932 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1544 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1544))) (let ((.cse2 (select .cse4 ~o_2~0.base))) (let ((.cse1 (select .cse2 c_~o_2~0.offset)) (.cse0 (select (select .cse4 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse0 .cse1) (= (select .cse2 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse1 .cse0)))))) (forall ((v_ArrVal_1544 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1544))) (let ((.cse7 (select .cse8 ~o_2~0.base))) (let ((.cse5 (select .cse7 c_~o_2~0.offset)) (.cse6 (select (select .cse8 c_~o_0~0.base) c_~o_0~0.offset))) (or (= .cse5 .cse6) (< .cse5 .cse6) (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse7 .cse3))))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_1544 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1544))) (= (select (select .cse9 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse9 c_~o_0~0.base) c_~o_0~0.offset))))) (forall ((v_ArrVal_1544 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1544))) (let ((.cse12 (select .cse13 ~o_2~0.base))) (let ((.cse11 (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset)) (.cse10 (select .cse12 c_~o_2~0.offset))) (or (= .cse10 .cse11) (< .cse11 .cse10) (< (select .cse12 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))))) is different from false [2022-12-14 06:59:42,981 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 06:59:42,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 177 [2022-12-14 06:59:42,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:42,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-14 06:59:43,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:59:43,414 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-14 06:59:43,414 INFO L350 Elim1Store]: Elim1 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 104 treesize of output 1 [2022-12-14 06:59:43,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:59:43,420 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-14 06:59:43,420 INFO L350 Elim1Store]: Elim1 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 104 treesize of output 1 [2022-12-14 06:59:43,422 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 06:59:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:43,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051538966] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:43,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [503533768] [2022-12-14 06:59:43,474 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:43,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:43,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 30 [2022-12-14 06:59:43,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310194756] [2022-12-14 06:59:43,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:43,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 06:59:43,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 06:59:43,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=819, Unknown=1, NotChecked=58, Total=992 [2022-12-14 06:59:43,476 INFO L87 Difference]: Start difference. First operand 131 states and 302 transitions. Second operand has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:44,316 INFO L93 Difference]: Finished difference Result 178 states and 407 transitions. [2022-12-14 06:59:44,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 06:59:44,317 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:44,318 INFO L225 Difference]: With dead ends: 178 [2022-12-14 06:59:44,318 INFO L226 Difference]: Without dead ends: 173 [2022-12-14 06:59:44,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=285, Invalid=1440, Unknown=1, NotChecked=80, Total=1806 [2022-12-14 06:59:44,318 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 18 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:44,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 644 Invalid, 7 Unknown, 47 Unchecked, 0.5s Time] [2022-12-14 06:59:44,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-12-14 06:59:44,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 129. [2022-12-14 06:59:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.3046875) internal successors, (295), 128 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:44,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 295 transitions. [2022-12-14 06:59:44,322 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 295 transitions. Word has length 28 [2022-12-14 06:59:44,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:44,322 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 295 transitions. [2022-12-14 06:59:44,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 295 transitions. [2022-12-14 06:59:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:44,322 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:44,322 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:44,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 06:59:44,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:44,523 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:44,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1362577001, now seen corresponding path program 18 times [2022-12-14 06:59:44,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:44,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147548808] [2022-12-14 06:59:44,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:44,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:45,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:45,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147548808] [2022-12-14 06:59:45,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147548808] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:45,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032157807] [2022-12-14 06:59:45,263 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 06:59:45,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:45,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:45,264 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:45,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 06:59:45,401 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 06:59:45,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:59:45,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 06:59:45,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:45,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:59:45,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 06:59:45,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:45,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:45,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:46,371 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1615 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615))) (let ((.cse2 (select .cse4 ~o_2~0.base))) (let ((.cse0 (select .cse2 c_~o_2~0.offset)) (.cse1 (select (select .cse4 c_~o_0~0.base) c_~o_0~0.offset))) (or (= .cse0 .cse1) (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse2 .cse3)) (< .cse0 .cse1)))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_1615 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615))) (= (select (select .cse5 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse5 c_~o_0~0.base) c_~o_0~0.offset))))) (forall ((v_ArrVal_1615 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615))) (let ((.cse8 (select .cse9 ~o_2~0.base))) (let ((.cse7 (select .cse8 c_~o_2~0.offset)) (.cse6 (select (select .cse9 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse6 .cse7) (= (select .cse8 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse7 .cse6)))))) (forall ((v_ArrVal_1615 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615))) (let ((.cse12 (select .cse13 ~o_2~0.base))) (let ((.cse11 (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset)) (.cse10 (select .cse12 c_~o_2~0.offset))) (or (= .cse10 .cse11) (< .cse11 .cse10) (< (select .cse12 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))))) is different from false [2022-12-14 06:59:46,387 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 06:59:46,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2022-12-14 06:59:46,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:46,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-12-14 06:59:46,468 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 06:59:46,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 177 [2022-12-14 06:59:46,494 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:46,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-14 06:59:46,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:59:46,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:59:46,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:59:46,933 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-14 06:59:46,933 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 1 [2022-12-14 06:59:46,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:59:46,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:59:46,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:59:46,941 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-14 06:59:46,941 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 1 [2022-12-14 06:59:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:47,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032157807] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:47,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [79301301] [2022-12-14 06:59:47,023 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:47,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:47,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 30 [2022-12-14 06:59:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729574193] [2022-12-14 06:59:47,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:47,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 06:59:47,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:47,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 06:59:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=821, Unknown=1, NotChecked=58, Total=992 [2022-12-14 06:59:47,026 INFO L87 Difference]: Start difference. First operand 129 states and 295 transitions. Second operand has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:50,995 INFO L93 Difference]: Finished difference Result 226 states and 509 transitions. [2022-12-14 06:59:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 06:59:50,996 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:50,997 INFO L225 Difference]: With dead ends: 226 [2022-12-14 06:59:50,997 INFO L226 Difference]: Without dead ends: 216 [2022-12-14 06:59:50,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=291, Invalid=1517, Unknown=2, NotChecked=82, Total=1892 [2022-12-14 06:59:50,998 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 226 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 21 mSolverCounterUnsat, 65 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 65 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:50,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 0 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 912 Invalid, 65 Unknown, 65 Unchecked, 1.2s Time] [2022-12-14 06:59:50,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-12-14 06:59:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 127. [2022-12-14 06:59:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.3015873015873014) internal successors, (290), 126 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 290 transitions. [2022-12-14 06:59:51,002 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 290 transitions. Word has length 28 [2022-12-14 06:59:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:51,002 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 290 transitions. [2022-12-14 06:59:51,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 290 transitions. [2022-12-14 06:59:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:51,003 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:51,003 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:51,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-14 06:59:51,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 06:59:51,205 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:51,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1708536525, now seen corresponding path program 19 times [2022-12-14 06:59:51,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:51,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850009119] [2022-12-14 06:59:51,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:51,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:51,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:51,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850009119] [2022-12-14 06:59:51,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850009119] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:51,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640454539] [2022-12-14 06:59:51,802 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 06:59:51,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:51,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:51,802 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:51,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 06:59:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:51,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 06:59:51,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:52,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:59:52,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 06:59:52,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:52,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 06:59:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:52,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:59:52,798 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1686 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1686))) (let ((.cse2 (select .cse4 ~o_2~0.base))) (let ((.cse0 (select .cse2 c_~o_2~0.offset)) (.cse1 (select (select .cse4 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse0 .cse1) (= .cse0 .cse1) (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse2 .cse3))))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_1686 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1686))) (= (select (select .cse5 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse5 c_~o_0~0.base) c_~o_0~0.offset))))) (forall ((v_ArrVal_1686 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1686))) (let ((.cse8 (select .cse9 ~o_2~0.base))) (let ((.cse7 (select (select .cse9 c_~o_0~0.base) c_~o_0~0.offset)) (.cse6 (select .cse8 c_~o_2~0.offset))) (or (< .cse6 .cse7) (= (select .cse8 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse7 .cse6)))))) (forall ((v_ArrVal_1686 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1686))) (let ((.cse10 (select .cse13 ~o_2~0.base))) (let ((.cse12 (select .cse10 c_~o_2~0.offset)) (.cse11 (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset))) (or (< (select .cse10 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse11 .cse12) (= .cse12 .cse11)))))))) is different from false [2022-12-14 06:59:52,866 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 06:59:52,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 177 [2022-12-14 06:59:52,892 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:59:52,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-14 06:59:53,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:59:53,274 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-14 06:59:53,275 INFO L350 Elim1Store]: Elim1 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 104 treesize of output 1 [2022-12-14 06:59:53,277 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 06:59:53,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:59:53,285 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-14 06:59:53,285 INFO L350 Elim1Store]: Elim1 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 104 treesize of output 1 [2022-12-14 06:59:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:53,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640454539] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:59:53,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1730127654] [2022-12-14 06:59:53,355 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:59:53,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:59:53,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 31 [2022-12-14 06:59:53,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458966766] [2022-12-14 06:59:53,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:59:53,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 06:59:53,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:59:53,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 06:59:53,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=863, Unknown=1, NotChecked=60, Total=1056 [2022-12-14 06:59:53,357 INFO L87 Difference]: Start difference. First operand 127 states and 290 transitions. Second operand has 33 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:59:58,911 INFO L93 Difference]: Finished difference Result 252 states and 566 transitions. [2022-12-14 06:59:58,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 06:59:58,911 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 06:59:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:59:58,912 INFO L225 Difference]: With dead ends: 252 [2022-12-14 06:59:58,912 INFO L226 Difference]: Without dead ends: 242 [2022-12-14 06:59:58,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=316, Invalid=1579, Unknown=1, NotChecked=84, Total=1980 [2022-12-14 06:59:58,913 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 211 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 16 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 06:59:58,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 0 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 699 Invalid, 37 Unknown, 50 Unchecked, 0.7s Time] [2022-12-14 06:59:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-12-14 06:59:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 127. [2022-12-14 06:59:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.3015873015873014) internal successors, (290), 126 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 290 transitions. [2022-12-14 06:59:58,916 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 290 transitions. Word has length 28 [2022-12-14 06:59:58,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:59:58,916 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 290 transitions. [2022-12-14 06:59:58,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:59:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 290 transitions. [2022-12-14 06:59:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 06:59:58,917 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:59:58,917 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:59:58,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-14 06:59:59,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 06:59:59,118 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 06:59:59,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:59:59,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1127910693, now seen corresponding path program 20 times [2022-12-14 06:59:59,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:59:59,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263540392] [2022-12-14 06:59:59,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:59:59,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:59:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:59:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:59:59,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:59:59,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263540392] [2022-12-14 06:59:59,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263540392] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:59:59,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760581777] [2022-12-14 06:59:59,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:59:59,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:59:59,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:59:59,778 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:59:59,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 06:59:59,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 06:59:59,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:59:59,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-14 06:59:59,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:59:59,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:59:59,900 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-12-14 06:59:59,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2022-12-14 06:59:59,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:59:59,955 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-14 06:59:59,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:00:00,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:00:00,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-14 07:00:00,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-12-14 07:00:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:00,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:00,625 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (< c_~result_5~0 0)) (.cse0 (forall ((v_ArrVal_1763 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1763))) (= (select (select .cse14 c_~o_2~0.base) c_~o_2~0.offset) (select (select .cse14 c_~o_0~0.base) c_~o_0~0.offset))))) (.cse1 (= c_~result_5~0 0))) (and (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 5) .cse0) (or .cse1 (and (or (forall ((v_ArrVal_1763 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1763))) (< (select (select .cse2 c_~o_2~0.base) c_~o_2~0.offset) (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset)))) .cse3) (forall ((v_ArrVal_1763 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1763))) (let ((.cse5 (select (select .cse6 c_~o_2~0.base) c_~o_2~0.offset)) (.cse4 (select (select .cse6 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse4 .cse5) (< .cse5 .cse4))))))) (or (forall ((v_ArrVal_1763 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1763))) (let ((.cse7 (select (select .cse9 c_~o_2~0.base) c_~o_2~0.offset)) (.cse8 (select (select .cse9 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse7 .cse8) (= .cse7 .cse8))))) .cse3) (or (and (or .cse3 .cse0) (forall ((v_ArrVal_1763 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1763))) (let ((.cse11 (select (select .cse12 c_~o_2~0.base) c_~o_2~0.offset)) (.cse10 (select (select .cse12 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse10 .cse11) (= .cse11 .cse10))))) (or .cse1 (forall ((v_ArrVal_1763 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1763))) (< (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse13 c_~o_2~0.base) c_~o_2~0.offset)))))) (< 0 c_~result_5~0)))) is different from false [2022-12-14 07:00:00,681 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_int| c_~o_2~0.base) (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) (let ((.cse0 (forall ((v_ArrVal_1763 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1763))) (= (select (select .cse15 c_~o_2~0.base) c_~o_2~0.offset) (select (select .cse15 c_~o_0~0.base) c_~o_0~0.offset))))) (.cse4 (< |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse10)) (.cse9 (= .cse10 |c_thread1Thread1of1ForFork0_#t~mem1#1|))) (and (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) .cse0) (or (forall ((v_ArrVal_1763 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1763))) (let ((.cse1 (select (select .cse3 c_~o_2~0.base) c_~o_2~0.offset)) (.cse2 (select (select .cse3 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse1 .cse2) (= .cse1 .cse2))))) .cse4) (or (and (or (forall ((v_ArrVal_1763 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1763))) (< (select (select .cse5 c_~o_2~0.base) c_~o_2~0.offset) (select (select .cse5 c_~o_0~0.base) c_~o_0~0.offset)))) .cse4) (forall ((v_ArrVal_1763 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1763))) (let ((.cse7 (select (select .cse8 c_~o_2~0.base) c_~o_2~0.offset)) (.cse6 (select (select .cse8 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse6 .cse7) (< .cse7 .cse6)))))) .cse9) (or (< .cse10 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (and (or .cse0 .cse4) (or .cse9 (forall ((v_ArrVal_1763 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1763))) (< (select (select .cse11 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse11 c_~o_2~0.base) c_~o_2~0.offset))))) (forall ((v_ArrVal_1763 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1763))) (let ((.cse13 (select (select .cse14 c_~o_2~0.base) c_~o_2~0.offset)) (.cse12 (select (select .cse14 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse12 .cse13) (= .cse13 .cse12)))))))))) is different from false [2022-12-14 07:00:00,756 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:00:00,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 322 treesize of output 267 [2022-12-14 07:00:00,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:00:00,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 207 [2022-12-14 07:00:00,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:00:00,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 199 [2022-12-14 07:00:00,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:00:00,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 183 [2022-12-14 07:00:01,368 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-14 07:00:01,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 1 [2022-12-14 07:00:01,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:00:01,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:00:01,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2022-12-14 07:00:01,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:00:01,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-12-14 07:00:01,404 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-14 07:00:01,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 1 [2022-12-14 07:00:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:01,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760581777] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:01,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [213534466] [2022-12-14 07:00:01,612 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:01,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:01,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 07:00:01,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584922151] [2022-12-14 07:00:01,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:01,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 07:00:01,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:01,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 07:00:01,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=927, Unknown=2, NotChecked=126, Total=1190 [2022-12-14 07:00:01,613 INFO L87 Difference]: Start difference. First operand 127 states and 290 transitions. Second operand has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:06,974 INFO L93 Difference]: Finished difference Result 210 states and 477 transitions. [2022-12-14 07:00:06,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 07:00:06,974 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 07:00:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:06,976 INFO L225 Difference]: With dead ends: 210 [2022-12-14 07:00:06,976 INFO L226 Difference]: Without dead ends: 205 [2022-12-14 07:00:06,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=357, Invalid=1629, Unknown=2, NotChecked=174, Total=2162 [2022-12-14 07:00:06,977 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 313 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:06,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 0 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 430 Invalid, 0 Unknown, 125 Unchecked, 0.4s Time] [2022-12-14 07:00:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-12-14 07:00:06,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 129. [2022-12-14 07:00:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.296875) internal successors, (294), 128 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 294 transitions. [2022-12-14 07:00:06,982 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 294 transitions. Word has length 28 [2022-12-14 07:00:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:06,982 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 294 transitions. [2022-12-14 07:00:06,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 294 transitions. [2022-12-14 07:00:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:06,983 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:06,983 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:06,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 07:00:07,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 07:00:07,184 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:07,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:07,186 INFO L85 PathProgramCache]: Analyzing trace with hash -174644530, now seen corresponding path program 21 times [2022-12-14 07:00:07,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:07,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570588582] [2022-12-14 07:00:07,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:07,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:07,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:07,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570588582] [2022-12-14 07:00:07,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570588582] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:07,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831933928] [2022-12-14 07:00:07,720 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:00:07,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:07,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:07,721 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:07,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 07:00:07,824 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:00:07,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:00:07,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:00:07,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:08,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:08,162 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:00:08,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 72 [2022-12-14 07:00:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:08,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831933928] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:08,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1830828817] [2022-12-14 07:00:08,203 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:08,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:08,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 18 [2022-12-14 07:00:08,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103864886] [2022-12-14 07:00:08,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:08,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 07:00:08,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:08,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 07:00:08,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-12-14 07:00:08,205 INFO L87 Difference]: Start difference. First operand 129 states and 294 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:08,826 INFO L93 Difference]: Finished difference Result 169 states and 384 transitions. [2022-12-14 07:00:08,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 07:00:08,826 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:08,827 INFO L225 Difference]: With dead ends: 169 [2022-12-14 07:00:08,827 INFO L226 Difference]: Without dead ends: 169 [2022-12-14 07:00:08,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2022-12-14 07:00:08,828 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:08,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:00:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-12-14 07:00:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 133. [2022-12-14 07:00:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.3333333333333335) internal successors, (308), 132 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 308 transitions. [2022-12-14 07:00:08,832 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 308 transitions. Word has length 29 [2022-12-14 07:00:08,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:08,833 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 308 transitions. [2022-12-14 07:00:08,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 308 transitions. [2022-12-14 07:00:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:08,833 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:08,833 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:08,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-14 07:00:09,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:09,034 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:09,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:09,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1190605746, now seen corresponding path program 22 times [2022-12-14 07:00:09,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:09,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767638763] [2022-12-14 07:00:09,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:09,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:09,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:09,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767638763] [2022-12-14 07:00:09,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767638763] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:09,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743840613] [2022-12-14 07:00:09,552 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:00:09,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:09,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:09,554 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:09,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 07:00:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:09,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:00:09,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:09,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:10,066 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:00:10,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 72 [2022-12-14 07:00:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:10,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743840613] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:10,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1056988525] [2022-12-14 07:00:10,106 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:10,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:10,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:00:10,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936323023] [2022-12-14 07:00:10,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:10,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:00:10,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:10,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:00:10,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:00:10,107 INFO L87 Difference]: Start difference. First operand 133 states and 308 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:10,919 INFO L93 Difference]: Finished difference Result 191 states and 439 transitions. [2022-12-14 07:00:10,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 07:00:10,920 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:10,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:10,920 INFO L225 Difference]: With dead ends: 191 [2022-12-14 07:00:10,920 INFO L226 Difference]: Without dead ends: 191 [2022-12-14 07:00:10,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 07:00:10,921 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:10,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:00:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-12-14 07:00:10,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 139. [2022-12-14 07:00:10,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.369565217391304) internal successors, (327), 138 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 327 transitions. [2022-12-14 07:00:10,924 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 327 transitions. Word has length 29 [2022-12-14 07:00:10,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:10,924 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 327 transitions. [2022-12-14 07:00:10,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 327 transitions. [2022-12-14 07:00:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:10,924 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:10,925 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:10,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 07:00:11,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:11,126 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:11,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:11,127 INFO L85 PathProgramCache]: Analyzing trace with hash 662999182, now seen corresponding path program 23 times [2022-12-14 07:00:11,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:11,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534507749] [2022-12-14 07:00:11,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:11,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:11,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:11,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534507749] [2022-12-14 07:00:11,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534507749] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:11,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416660082] [2022-12-14 07:00:11,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:00:11,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:11,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:11,727 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:11,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 07:00:11,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:00:11,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:00:11,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:00:11,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:12,041 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:00:12,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2022-12-14 07:00:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:12,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:12,318 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:00:12,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 72 [2022-12-14 07:00:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:12,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416660082] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:12,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [489653563] [2022-12-14 07:00:12,361 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:12,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:12,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-14 07:00:12,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521400292] [2022-12-14 07:00:12,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:12,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 07:00:12,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:12,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 07:00:12,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-12-14 07:00:12,362 INFO L87 Difference]: Start difference. First operand 139 states and 327 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:13,683 INFO L93 Difference]: Finished difference Result 221 states and 500 transitions. [2022-12-14 07:00:13,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 07:00:13,683 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:13,684 INFO L225 Difference]: With dead ends: 221 [2022-12-14 07:00:13,684 INFO L226 Difference]: Without dead ends: 221 [2022-12-14 07:00:13,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=337, Invalid=1303, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 07:00:13,685 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:13,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 07:00:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-12-14 07:00:13,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 143. [2022-12-14 07:00:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.4014084507042255) internal successors, (341), 142 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 341 transitions. [2022-12-14 07:00:13,688 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 341 transitions. Word has length 29 [2022-12-14 07:00:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:13,688 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 341 transitions. [2022-12-14 07:00:13,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 341 transitions. [2022-12-14 07:00:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:13,688 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:13,688 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:13,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 07:00:13,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-14 07:00:13,890 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:13,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:13,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1662816924, now seen corresponding path program 24 times [2022-12-14 07:00:13,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:13,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320290530] [2022-12-14 07:00:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:13,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:14,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:14,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320290530] [2022-12-14 07:00:14,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320290530] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:14,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558235392] [2022-12-14 07:00:14,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:00:14,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:14,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:14,435 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:14,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 07:00:14,544 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:00:14,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:00:14,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:00:14,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:14,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:14,851 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:00:14,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 72 [2022-12-14 07:00:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:14,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558235392] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:14,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [444206331] [2022-12-14 07:00:14,885 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:14,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:14,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 19 [2022-12-14 07:00:14,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848969198] [2022-12-14 07:00:14,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:14,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:00:14,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:14,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:00:14,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:00:14,886 INFO L87 Difference]: Start difference. First operand 143 states and 341 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:15,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:15,585 INFO L93 Difference]: Finished difference Result 197 states and 454 transitions. [2022-12-14 07:00:15,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 07:00:15,585 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:15,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:15,586 INFO L225 Difference]: With dead ends: 197 [2022-12-14 07:00:15,586 INFO L226 Difference]: Without dead ends: 197 [2022-12-14 07:00:15,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=924, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 07:00:15,587 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:15,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:00:15,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-12-14 07:00:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 137. [2022-12-14 07:00:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.338235294117647) internal successors, (318), 136 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 318 transitions. [2022-12-14 07:00:15,589 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 318 transitions. Word has length 29 [2022-12-14 07:00:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:15,590 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 318 transitions. [2022-12-14 07:00:15,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 318 transitions. [2022-12-14 07:00:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:15,590 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:15,590 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:15,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-14 07:00:15,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-14 07:00:15,792 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:15,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1826307748, now seen corresponding path program 25 times [2022-12-14 07:00:15,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:15,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355733085] [2022-12-14 07:00:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:15,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:16,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:16,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355733085] [2022-12-14 07:00:16,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355733085] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:16,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269398403] [2022-12-14 07:00:16,275 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:00:16,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:16,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:16,275 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:16,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 07:00:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:16,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:00:16,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:16,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:16,700 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:00:16,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:00:16,716 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:00:16,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:00:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:16,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269398403] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:16,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [63444948] [2022-12-14 07:00:16,748 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:16,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:16,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 18 [2022-12-14 07:00:16,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929294365] [2022-12-14 07:00:16,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:16,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 07:00:16,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:16,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 07:00:16,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-12-14 07:00:16,750 INFO L87 Difference]: Start difference. First operand 137 states and 318 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:17,183 INFO L93 Difference]: Finished difference Result 157 states and 365 transitions. [2022-12-14 07:00:17,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 07:00:17,183 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:17,184 INFO L225 Difference]: With dead ends: 157 [2022-12-14 07:00:17,184 INFO L226 Difference]: Without dead ends: 157 [2022-12-14 07:00:17,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2022-12-14 07:00:17,184 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:17,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:00:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-12-14 07:00:17,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 139. [2022-12-14 07:00:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.3550724637681157) internal successors, (325), 138 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 325 transitions. [2022-12-14 07:00:17,187 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 325 transitions. Word has length 29 [2022-12-14 07:00:17,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:17,187 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 325 transitions. [2022-12-14 07:00:17,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 325 transitions. [2022-12-14 07:00:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:17,187 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:17,188 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:17,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-14 07:00:17,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-14 07:00:17,389 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:17,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:17,390 INFO L85 PathProgramCache]: Analyzing trace with hash 27297180, now seen corresponding path program 26 times [2022-12-14 07:00:17,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:17,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916283100] [2022-12-14 07:00:17,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:17,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:17,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:17,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916283100] [2022-12-14 07:00:17,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916283100] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:17,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108158067] [2022-12-14 07:00:17,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:00:17,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:17,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:17,955 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:17,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 07:00:18,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:00:18,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:00:18,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:00:18,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:18,271 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:00:18,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-14 07:00:18,280 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:00:18,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-14 07:00:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:18,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:18,569 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:00:18,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:00:18,584 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:00:18,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:00:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:18,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108158067] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:18,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [768773013] [2022-12-14 07:00:18,622 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:18,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:18,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 19 [2022-12-14 07:00:18,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866723460] [2022-12-14 07:00:18,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:18,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:00:18,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:18,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:00:18,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:00:18,623 INFO L87 Difference]: Start difference. First operand 139 states and 325 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:19,527 INFO L93 Difference]: Finished difference Result 191 states and 440 transitions. [2022-12-14 07:00:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 07:00:19,527 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:19,528 INFO L225 Difference]: With dead ends: 191 [2022-12-14 07:00:19,528 INFO L226 Difference]: Without dead ends: 191 [2022-12-14 07:00:19,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 07:00:19,529 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:19,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:00:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-12-14 07:00:19,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 141. [2022-12-14 07:00:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.3857142857142857) internal successors, (334), 140 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 334 transitions. [2022-12-14 07:00:19,533 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 334 transitions. Word has length 29 [2022-12-14 07:00:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:19,534 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 334 transitions. [2022-12-14 07:00:19,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 334 transitions. [2022-12-14 07:00:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:19,534 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:19,534 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:19,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-14 07:00:19,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:19,736 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:19,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:19,736 INFO L85 PathProgramCache]: Analyzing trace with hash 34418844, now seen corresponding path program 27 times [2022-12-14 07:00:19,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:19,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135650722] [2022-12-14 07:00:19,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:19,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:20,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:20,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135650722] [2022-12-14 07:00:20,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135650722] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:20,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271856891] [2022-12-14 07:00:20,319 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:00:20,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:20,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:20,320 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:20,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-14 07:00:20,437 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:00:20,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:00:20,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:00:20,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:20,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:00:20,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2022-12-14 07:00:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:20,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:20,881 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:00:20,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:00:20,898 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:00:20,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:00:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:20,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271856891] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:20,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1823327676] [2022-12-14 07:00:20,935 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:20,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:20,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:00:20,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170040177] [2022-12-14 07:00:20,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:20,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:00:20,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:20,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:00:20,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:00:20,936 INFO L87 Difference]: Start difference. First operand 141 states and 334 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:21,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:21,590 INFO L93 Difference]: Finished difference Result 187 states and 435 transitions. [2022-12-14 07:00:21,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 07:00:21,590 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:21,591 INFO L225 Difference]: With dead ends: 187 [2022-12-14 07:00:21,591 INFO L226 Difference]: Without dead ends: 183 [2022-12-14 07:00:21,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2022-12-14 07:00:21,591 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:21,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:00:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-12-14 07:00:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 137. [2022-12-14 07:00:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.338235294117647) internal successors, (318), 136 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 318 transitions. [2022-12-14 07:00:21,594 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 318 transitions. Word has length 29 [2022-12-14 07:00:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:21,594 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 318 transitions. [2022-12-14 07:00:21,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 318 transitions. [2022-12-14 07:00:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:21,594 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:21,595 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:21,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-14 07:00:21,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-14 07:00:21,795 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:21,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:21,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1753986688, now seen corresponding path program 28 times [2022-12-14 07:00:21,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:21,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251505412] [2022-12-14 07:00:21,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:21,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:00:23,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:23,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251505412] [2022-12-14 07:00:23,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251505412] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:23,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333965026] [2022-12-14 07:00:23,517 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:00:23,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:23,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:23,518 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:23,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-14 07:00:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:23,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 07:00:23,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:23,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:00:23,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 35 [2022-12-14 07:00:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:24,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:24,504 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:00:24,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:00:24,521 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:00:24,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:00:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:24,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333965026] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:24,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1835571100] [2022-12-14 07:00:24,581 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:24,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:24,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 9] total 37 [2022-12-14 07:00:24,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342546316] [2022-12-14 07:00:24,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:24,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 07:00:24,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:24,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 07:00:24,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1171, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 07:00:24,583 INFO L87 Difference]: Start difference. First operand 137 states and 318 transitions. Second operand has 37 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:30,779 INFO L93 Difference]: Finished difference Result 723 states and 1628 transitions. [2022-12-14 07:00:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-12-14 07:00:30,779 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:30,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:30,781 INFO L225 Difference]: With dead ends: 723 [2022-12-14 07:00:30,781 INFO L226 Difference]: Without dead ends: 708 [2022-12-14 07:00:30,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4187 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2123, Invalid=11919, Unknown=0, NotChecked=0, Total=14042 [2022-12-14 07:00:30,783 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 418 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:30,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 0 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 07:00:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-12-14 07:00:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 145. [2022-12-14 07:00:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.375) internal successors, (342), 144 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 342 transitions. [2022-12-14 07:00:30,788 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 342 transitions. Word has length 29 [2022-12-14 07:00:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:30,788 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 342 transitions. [2022-12-14 07:00:30,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 342 transitions. [2022-12-14 07:00:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:30,789 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:30,789 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:30,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-14 07:00:30,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:30,990 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2092036966, now seen corresponding path program 29 times [2022-12-14 07:00:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:30,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389280155] [2022-12-14 07:00:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:30,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:31,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:31,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389280155] [2022-12-14 07:00:31,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389280155] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:31,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586292574] [2022-12-14 07:00:31,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:00:31,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:31,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:31,614 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:31,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 07:00:31,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:00:31,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:00:31,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:00:31,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:31,908 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:00:31,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-12-14 07:00:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:31,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:32,116 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:00:32,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:00:32,135 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:00:32,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:00:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:32,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586292574] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:32,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [954480779] [2022-12-14 07:00:32,164 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:32,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:32,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 19 [2022-12-14 07:00:32,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14807113] [2022-12-14 07:00:32,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:32,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:00:32,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:32,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:00:32,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:00:32,166 INFO L87 Difference]: Start difference. First operand 145 states and 342 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:32,840 INFO L93 Difference]: Finished difference Result 178 states and 411 transitions. [2022-12-14 07:00:32,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 07:00:32,840 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:32,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:32,841 INFO L225 Difference]: With dead ends: 178 [2022-12-14 07:00:32,841 INFO L226 Difference]: Without dead ends: 170 [2022-12-14 07:00:32,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2022-12-14 07:00:32,842 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:32,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:00:32,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-12-14 07:00:32,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 145. [2022-12-14 07:00:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.361111111111111) internal successors, (340), 144 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 340 transitions. [2022-12-14 07:00:32,846 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 340 transitions. Word has length 29 [2022-12-14 07:00:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:32,846 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 340 transitions. [2022-12-14 07:00:32,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 340 transitions. [2022-12-14 07:00:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:32,846 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:32,846 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:32,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-14 07:00:33,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-14 07:00:33,048 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:33,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:33,049 INFO L85 PathProgramCache]: Analyzing trace with hash 715014918, now seen corresponding path program 30 times [2022-12-14 07:00:33,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:33,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53246302] [2022-12-14 07:00:33,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:33,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:33,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:33,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53246302] [2022-12-14 07:00:33,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53246302] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:33,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781999664] [2022-12-14 07:00:33,564 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:00:33,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:33,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:33,565 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:33,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-14 07:00:33,734 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:00:33,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:00:33,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:00:33,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:33,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:34,068 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-14 07:00:34,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 107 [2022-12-14 07:00:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:34,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781999664] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:34,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [932335536] [2022-12-14 07:00:34,169 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:34,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:34,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 19 [2022-12-14 07:00:34,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650662044] [2022-12-14 07:00:34,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:34,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:00:34,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:34,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:00:34,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:00:34,170 INFO L87 Difference]: Start difference. First operand 145 states and 340 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:34,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:34,946 INFO L93 Difference]: Finished difference Result 183 states and 428 transitions. [2022-12-14 07:00:34,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 07:00:34,947 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:34,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:34,948 INFO L225 Difference]: With dead ends: 183 [2022-12-14 07:00:34,948 INFO L226 Difference]: Without dead ends: 183 [2022-12-14 07:00:34,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:00:34,948 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:34,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:00:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-12-14 07:00:34,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 151. [2022-12-14 07:00:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.3933333333333335) internal successors, (359), 150 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 359 transitions. [2022-12-14 07:00:34,951 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 359 transitions. Word has length 29 [2022-12-14 07:00:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:34,951 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 359 transitions. [2022-12-14 07:00:34,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 359 transitions. [2022-12-14 07:00:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:34,951 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:34,951 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:34,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-12-14 07:00:35,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-14 07:00:35,153 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:35,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:35,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1726347450, now seen corresponding path program 31 times [2022-12-14 07:00:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:35,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539429387] [2022-12-14 07:00:35,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:35,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:35,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:35,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539429387] [2022-12-14 07:00:35,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539429387] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:35,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989000702] [2022-12-14 07:00:35,740 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:00:35,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:35,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:35,741 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:35,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-14 07:00:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:35,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:00:35,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:36,034 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:00:36,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-14 07:00:36,043 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:00:36,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-14 07:00:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:36,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:36,302 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-14 07:00:36,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 107 [2022-12-14 07:00:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:36,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989000702] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:36,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1337539682] [2022-12-14 07:00:36,417 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:36,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:36,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:00:36,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113414469] [2022-12-14 07:00:36,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:36,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:00:36,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:36,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:00:36,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:00:36,418 INFO L87 Difference]: Start difference. First operand 151 states and 359 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:37,582 INFO L93 Difference]: Finished difference Result 231 states and 533 transitions. [2022-12-14 07:00:37,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 07:00:37,582 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:37,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:37,583 INFO L225 Difference]: With dead ends: 231 [2022-12-14 07:00:37,583 INFO L226 Difference]: Without dead ends: 231 [2022-12-14 07:00:37,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=298, Invalid=1262, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 07:00:37,584 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:37,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:00:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-12-14 07:00:37,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 155. [2022-12-14 07:00:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.448051948051948) internal successors, (377), 154 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 377 transitions. [2022-12-14 07:00:37,587 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 377 transitions. Word has length 29 [2022-12-14 07:00:37,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:37,587 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 377 transitions. [2022-12-14 07:00:37,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 377 transitions. [2022-12-14 07:00:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:37,587 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:37,588 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:37,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-14 07:00:37,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-14 07:00:37,789 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:37,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:37,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1719225786, now seen corresponding path program 32 times [2022-12-14 07:00:37,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:37,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032522475] [2022-12-14 07:00:37,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:38,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:38,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032522475] [2022-12-14 07:00:38,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032522475] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:38,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977649078] [2022-12-14 07:00:38,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:00:38,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:38,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:38,387 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:38,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-14 07:00:38,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:00:38,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:00:38,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:00:38,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:38,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:00:38,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2022-12-14 07:00:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:38,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:38,945 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-14 07:00:38,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 107 [2022-12-14 07:00:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:39,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977649078] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:39,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1420045541] [2022-12-14 07:00:39,038 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:39,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:39,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 21 [2022-12-14 07:00:39,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349451490] [2022-12-14 07:00:39,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:39,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 07:00:39,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:39,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 07:00:39,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-12-14 07:00:39,039 INFO L87 Difference]: Start difference. First operand 155 states and 377 transitions. Second operand has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:40,070 INFO L93 Difference]: Finished difference Result 225 states and 519 transitions. [2022-12-14 07:00:40,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 07:00:40,070 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:40,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:40,071 INFO L225 Difference]: With dead ends: 225 [2022-12-14 07:00:40,071 INFO L226 Difference]: Without dead ends: 221 [2022-12-14 07:00:40,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=254, Invalid=1078, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 07:00:40,072 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:40,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:00:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-12-14 07:00:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 157. [2022-12-14 07:00:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.4038461538461537) internal successors, (375), 156 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 375 transitions. [2022-12-14 07:00:40,077 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 375 transitions. Word has length 29 [2022-12-14 07:00:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:40,077 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 375 transitions. [2022-12-14 07:00:40,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 375 transitions. [2022-12-14 07:00:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:40,078 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:40,078 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:40,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-14 07:00:40,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:40,279 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:40,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash 242803740, now seen corresponding path program 33 times [2022-12-14 07:00:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:40,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366526246] [2022-12-14 07:00:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:40,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:40,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366526246] [2022-12-14 07:00:40,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366526246] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:40,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630209862] [2022-12-14 07:00:40,802 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:00:40,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:40,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:40,803 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:40,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-14 07:00:40,979 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:00:40,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:00:40,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:00:40,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:41,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:41,263 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-14 07:00:41,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 107 [2022-12-14 07:00:41,327 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:41,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630209862] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:41,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [550375332] [2022-12-14 07:00:41,328 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:41,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:41,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 18 [2022-12-14 07:00:41,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702228257] [2022-12-14 07:00:41,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:41,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 07:00:41,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:41,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 07:00:41,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-12-14 07:00:41,329 INFO L87 Difference]: Start difference. First operand 157 states and 375 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:41,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:41,836 INFO L93 Difference]: Finished difference Result 185 states and 435 transitions. [2022-12-14 07:00:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 07:00:41,836 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:41,837 INFO L225 Difference]: With dead ends: 185 [2022-12-14 07:00:41,838 INFO L226 Difference]: Without dead ends: 185 [2022-12-14 07:00:41,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2022-12-14 07:00:41,838 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:41,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:00:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-12-14 07:00:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 147. [2022-12-14 07:00:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.363013698630137) internal successors, (345), 146 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 345 transitions. [2022-12-14 07:00:41,840 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 345 transitions. Word has length 29 [2022-12-14 07:00:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:41,841 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 345 transitions. [2022-12-14 07:00:41,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 345 transitions. [2022-12-14 07:00:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:41,841 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:41,841 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:41,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-14 07:00:42,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-12-14 07:00:42,042 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:42,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:42,043 INFO L85 PathProgramCache]: Analyzing trace with hash -483392882, now seen corresponding path program 34 times [2022-12-14 07:00:42,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:42,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676643163] [2022-12-14 07:00:42,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:42,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:42,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676643163] [2022-12-14 07:00:42,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676643163] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:42,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906330785] [2022-12-14 07:00:42,543 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:00:42,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:42,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:42,544 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:42,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-14 07:00:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:42,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 07:00:42,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:42,928 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:00:42,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-14 07:00:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:42,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:43,326 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:00:43,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-14 07:00:43,359 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:00:43,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:00:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:43,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906330785] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:43,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1206115429] [2022-12-14 07:00:43,387 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:43,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:43,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 23 [2022-12-14 07:00:43,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652574115] [2022-12-14 07:00:43,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:43,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 07:00:43,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:43,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 07:00:43,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2022-12-14 07:00:43,388 INFO L87 Difference]: Start difference. First operand 147 states and 345 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:43,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:43,993 INFO L93 Difference]: Finished difference Result 201 states and 476 transitions. [2022-12-14 07:00:43,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 07:00:43,993 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:43,994 INFO L225 Difference]: With dead ends: 201 [2022-12-14 07:00:43,994 INFO L226 Difference]: Without dead ends: 201 [2022-12-14 07:00:43,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=1140, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 07:00:43,994 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:43,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:00:43,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-14 07:00:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 147. [2022-12-14 07:00:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.363013698630137) internal successors, (345), 146 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 345 transitions. [2022-12-14 07:00:44,000 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 345 transitions. Word has length 29 [2022-12-14 07:00:44,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:44,000 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 345 transitions. [2022-12-14 07:00:44,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:44,001 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 345 transitions. [2022-12-14 07:00:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:44,001 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:44,001 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:44,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-14 07:00:44,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-14 07:00:44,203 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:44,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:44,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1370212046, now seen corresponding path program 35 times [2022-12-14 07:00:44,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:44,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111553495] [2022-12-14 07:00:44,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:44,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:44,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:44,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111553495] [2022-12-14 07:00:44,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111553495] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:44,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131978595] [2022-12-14 07:00:44,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:00:44,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:44,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:44,703 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:44,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-14 07:00:44,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:00:44,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:00:44,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:00:44,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:45,115 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:00:45,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-14 07:00:45,122 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:00:45,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-14 07:00:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:45,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:45,410 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:00:45,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-14 07:00:45,449 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:00:45,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:00:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:45,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131978595] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:45,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1828363984] [2022-12-14 07:00:45,475 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:45,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:45,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 19 [2022-12-14 07:00:45,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959889995] [2022-12-14 07:00:45,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:45,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:00:45,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:45,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:00:45,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:00:45,476 INFO L87 Difference]: Start difference. First operand 147 states and 345 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:46,226 INFO L93 Difference]: Finished difference Result 211 states and 495 transitions. [2022-12-14 07:00:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 07:00:46,226 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:46,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:46,227 INFO L225 Difference]: With dead ends: 211 [2022-12-14 07:00:46,227 INFO L226 Difference]: Without dead ends: 211 [2022-12-14 07:00:46,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 07:00:46,227 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:46,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:00:46,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-12-14 07:00:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 149. [2022-12-14 07:00:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 2.391891891891892) internal successors, (354), 148 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 354 transitions. [2022-12-14 07:00:46,232 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 354 transitions. Word has length 29 [2022-12-14 07:00:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:46,232 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 354 transitions. [2022-12-14 07:00:46,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 354 transitions. [2022-12-14 07:00:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:46,232 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:46,232 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:46,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-14 07:00:46,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-14 07:00:46,433 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:46,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1377333710, now seen corresponding path program 36 times [2022-12-14 07:00:46,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:46,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949190623] [2022-12-14 07:00:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:46,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:46,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:46,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949190623] [2022-12-14 07:00:46,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949190623] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:46,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082596359] [2022-12-14 07:00:46,988 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:00:46,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:46,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:46,989 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:46,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-14 07:00:47,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:00:47,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:00:47,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:00:47,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:47,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:00:47,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2022-12-14 07:00:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:47,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:47,506 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:00:47,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-14 07:00:47,537 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:00:47,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:00:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:47,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082596359] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:47,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [163039182] [2022-12-14 07:00:47,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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:47,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:47,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:00:47,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799933029] [2022-12-14 07:00:47,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:47,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:00:47,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:47,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:00:47,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:00:47,563 INFO L87 Difference]: Start difference. First operand 149 states and 354 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:48,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:48,123 INFO L93 Difference]: Finished difference Result 199 states and 470 transitions. [2022-12-14 07:00:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 07:00:48,124 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:48,124 INFO L225 Difference]: With dead ends: 199 [2022-12-14 07:00:48,124 INFO L226 Difference]: Without dead ends: 195 [2022-12-14 07:00:48,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2022-12-14 07:00:48,125 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:48,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:00:48,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-12-14 07:00:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 145. [2022-12-14 07:00:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.361111111111111) internal successors, (340), 144 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 340 transitions. [2022-12-14 07:00:48,127 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 340 transitions. Word has length 29 [2022-12-14 07:00:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:48,128 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 340 transitions. [2022-12-14 07:00:48,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 340 transitions. [2022-12-14 07:00:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:48,128 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:48,128 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:48,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-12-14 07:00:48,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:48,329 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:48,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:48,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1198065742, now seen corresponding path program 37 times [2022-12-14 07:00:48,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:48,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364673308] [2022-12-14 07:00:48,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:48,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:48,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:48,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364673308] [2022-12-14 07:00:48,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364673308] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:48,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961056411] [2022-12-14 07:00:48,854 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:00:48,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:48,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:48,855 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:48,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-14 07:00:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:48,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 07:00:48,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:49,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:00:49,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:00:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:49,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:49,649 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:00:49,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-14 07:00:49,681 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:00:49,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:00:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:49,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961056411] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:49,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1253087475] [2022-12-14 07:00:49,716 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:49,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:49,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 23 [2022-12-14 07:00:49,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534564265] [2022-12-14 07:00:49,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:49,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 07:00:49,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:49,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 07:00:49,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2022-12-14 07:00:49,718 INFO L87 Difference]: Start difference. First operand 145 states and 340 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:50,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:50,917 INFO L93 Difference]: Finished difference Result 275 states and 607 transitions. [2022-12-14 07:00:50,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 07:00:50,917 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:50,918 INFO L225 Difference]: With dead ends: 275 [2022-12-14 07:00:50,918 INFO L226 Difference]: Without dead ends: 270 [2022-12-14 07:00:50,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=432, Invalid=1730, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 07:00:50,918 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:50,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 0 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 07:00:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-12-14 07:00:50,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 149. [2022-12-14 07:00:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 2.4054054054054053) internal successors, (356), 148 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 356 transitions. [2022-12-14 07:00:50,921 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 356 transitions. Word has length 29 [2022-12-14 07:00:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:50,921 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 356 transitions. [2022-12-14 07:00:50,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 356 transitions. [2022-12-14 07:00:50,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:50,922 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:50,922 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:50,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-12-14 07:00:51,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-14 07:00:51,123 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:51,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1190944078, now seen corresponding path program 38 times [2022-12-14 07:00:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:51,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711867742] [2022-12-14 07:00:51,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:51,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:51,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:51,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711867742] [2022-12-14 07:00:51,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711867742] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:51,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137949631] [2022-12-14 07:00:51,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:00:51,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:51,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:51,653 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:51,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-14 07:00:51,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:00:51,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:00:51,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:00:51,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:51,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:00:51,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2022-12-14 07:00:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:51,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:52,134 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:00:52,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-14 07:00:52,173 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:00:52,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:00:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:52,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137949631] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:52,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [578610285] [2022-12-14 07:00:52,198 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:52,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:52,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:00:52,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153997856] [2022-12-14 07:00:52,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:52,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:00:52,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:52,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:00:52,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:00:52,199 INFO L87 Difference]: Start difference. First operand 149 states and 356 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:53,017 INFO L93 Difference]: Finished difference Result 222 states and 512 transitions. [2022-12-14 07:00:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 07:00:53,018 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:53,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:53,018 INFO L225 Difference]: With dead ends: 222 [2022-12-14 07:00:53,018 INFO L226 Difference]: Without dead ends: 218 [2022-12-14 07:00:53,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=904, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 07:00:53,019 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:53,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:00:53,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-12-14 07:00:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 149. [2022-12-14 07:00:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 2.391891891891892) internal successors, (354), 148 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 354 transitions. [2022-12-14 07:00:53,021 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 354 transitions. Word has length 29 [2022-12-14 07:00:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:53,022 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 354 transitions. [2022-12-14 07:00:53,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 354 transitions. [2022-12-14 07:00:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:53,022 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:53,022 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:53,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-12-14 07:00:53,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-14 07:00:53,224 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:53,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:53,225 INFO L85 PathProgramCache]: Analyzing trace with hash -749122100, now seen corresponding path program 39 times [2022-12-14 07:00:53,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:53,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223792165] [2022-12-14 07:00:53,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:53,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:53,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:53,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223792165] [2022-12-14 07:00:53,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223792165] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:53,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459089296] [2022-12-14 07:00:53,813 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:00:53,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:53,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:53,814 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:53,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-14 07:00:53,950 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:00:53,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:00:53,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:00:53,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:54,102 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:00:54,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-12-14 07:00:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:54,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:54,271 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:00:54,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-14 07:00:54,306 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:00:54,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:00:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:54,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459089296] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:54,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1674739569] [2022-12-14 07:00:54,333 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:54,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:54,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 19 [2022-12-14 07:00:54,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825569401] [2022-12-14 07:00:54,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:54,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:00:54,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:54,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:00:54,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:00:54,334 INFO L87 Difference]: Start difference. First operand 149 states and 354 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:54,850 INFO L93 Difference]: Finished difference Result 200 states and 471 transitions. [2022-12-14 07:00:54,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 07:00:54,850 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:54,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:54,851 INFO L225 Difference]: With dead ends: 200 [2022-12-14 07:00:54,851 INFO L226 Difference]: Without dead ends: 192 [2022-12-14 07:00:54,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2022-12-14 07:00:54,851 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:54,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:00:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-12-14 07:00:54,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 149. [2022-12-14 07:00:54,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 2.3783783783783785) internal successors, (352), 148 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 352 transitions. [2022-12-14 07:00:54,854 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 352 transitions. Word has length 29 [2022-12-14 07:00:54,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:54,854 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 352 transitions. [2022-12-14 07:00:54,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 352 transitions. [2022-12-14 07:00:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:54,854 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:54,854 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:54,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-12-14 07:00:55,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:55,055 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:55,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:55,056 INFO L85 PathProgramCache]: Analyzing trace with hash 936744910, now seen corresponding path program 40 times [2022-12-14 07:00:55,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:55,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720350622] [2022-12-14 07:00:55,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:55,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:55,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:55,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720350622] [2022-12-14 07:00:55,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720350622] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:55,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147236670] [2022-12-14 07:00:55,639 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:00:55,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:55,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:55,640 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:55,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-14 07:00:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:55,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:00:55,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:55,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:00:55,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:00:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:55,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:56,186 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:00:56,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-14 07:00:56,225 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:00:56,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:00:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:56,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147236670] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:56,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1790638384] [2022-12-14 07:00:56,253 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:56,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:56,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:00:56,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889637406] [2022-12-14 07:00:56,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:56,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:00:56,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:56,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:00:56,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:00:56,254 INFO L87 Difference]: Start difference. First operand 149 states and 352 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:00:56,947 INFO L93 Difference]: Finished difference Result 256 states and 598 transitions. [2022-12-14 07:00:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 07:00:56,947 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:00:56,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:00:56,948 INFO L225 Difference]: With dead ends: 256 [2022-12-14 07:00:56,948 INFO L226 Difference]: Without dead ends: 256 [2022-12-14 07:00:56,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:00:56,949 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 173 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:00:56,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 0 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:00:56,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-12-14 07:00:56,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 156. [2022-12-14 07:00:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.4387096774193546) internal successors, (378), 155 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 378 transitions. [2022-12-14 07:00:56,952 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 378 transitions. Word has length 29 [2022-12-14 07:00:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:00:56,952 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 378 transitions. [2022-12-14 07:00:56,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:00:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 378 transitions. [2022-12-14 07:00:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:00:56,953 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:00:56,953 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:00:56,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-12-14 07:00:57,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-14 07:00:57,154 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:00:57,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:00:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash 943866574, now seen corresponding path program 41 times [2022-12-14 07:00:57,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:00:57,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704099162] [2022-12-14 07:00:57,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:00:57,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:00:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:00:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:57,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:00:57,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704099162] [2022-12-14 07:00:57,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704099162] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:00:57,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691237156] [2022-12-14 07:00:57,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:00:57,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:00:57,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:00:57,726 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:00:57,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-14 07:00:57,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:00:57,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:00:57,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:00:57,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:00:58,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:00:58,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2022-12-14 07:00:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:58,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:00:58,263 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:00:58,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-14 07:00:58,297 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:00:58,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:00:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:00:58,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691237156] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:00:58,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1097915769] [2022-12-14 07:00:58,326 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:00:58,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:00:58,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 21 [2022-12-14 07:00:58,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899227741] [2022-12-14 07:00:58,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:00:58,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 07:00:58,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:00:58,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 07:00:58,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-12-14 07:00:58,327 INFO L87 Difference]: Start difference. First operand 156 states and 378 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:01:00,108 INFO L93 Difference]: Finished difference Result 281 states and 653 transitions. [2022-12-14 07:01:00,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 07:01:00,109 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:01:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:01:00,110 INFO L225 Difference]: With dead ends: 281 [2022-12-14 07:01:00,110 INFO L226 Difference]: Without dead ends: 277 [2022-12-14 07:01:00,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=342, Invalid=1298, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 07:01:00,110 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 223 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:01:00,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 0 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 07:01:00,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-12-14 07:01:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 154. [2022-12-14 07:01:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.411764705882353) internal successors, (369), 153 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 369 transitions. [2022-12-14 07:01:00,113 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 369 transitions. Word has length 29 [2022-12-14 07:01:00,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:01:00,113 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 369 transitions. [2022-12-14 07:01:00,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 369 transitions. [2022-12-14 07:01:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:01:00,113 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:01:00,113 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:01:00,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-14 07:01:00,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-14 07:01:00,314 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:01:00,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:01:00,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1385688552, now seen corresponding path program 42 times [2022-12-14 07:01:00,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:01:00,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032707151] [2022-12-14 07:01:00,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:01:00,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:01:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:01:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:00,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:01:00,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032707151] [2022-12-14 07:01:00,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032707151] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:01:00,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664342347] [2022-12-14 07:01:00,941 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:01:00,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:01:00,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:01:00,942 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:01:00,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-14 07:01:01,083 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:01:01,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:01:01,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 07:01:01,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:01:01,295 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:01:01,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-14 07:01:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:01,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:01:01,562 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:01:01,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-14 07:01:01,605 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:01:01,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:01:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:01,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664342347] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:01:01,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2007567895] [2022-12-14 07:01:01,634 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:01:01,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:01:01,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2022-12-14 07:01:01,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245607262] [2022-12-14 07:01:01,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:01:01,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 07:01:01,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:01:01,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 07:01:01,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2022-12-14 07:01:01,635 INFO L87 Difference]: Start difference. First operand 154 states and 369 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:01:02,335 INFO L93 Difference]: Finished difference Result 264 states and 618 transitions. [2022-12-14 07:01:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 07:01:02,336 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:01:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:01:02,336 INFO L225 Difference]: With dead ends: 264 [2022-12-14 07:01:02,336 INFO L226 Difference]: Without dead ends: 256 [2022-12-14 07:01:02,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=973, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 07:01:02,337 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:01:02,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:01:02,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-12-14 07:01:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 154. [2022-12-14 07:01:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.3986928104575163) internal successors, (367), 153 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 367 transitions. [2022-12-14 07:01:02,340 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 367 transitions. Word has length 29 [2022-12-14 07:01:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:01:02,340 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 367 transitions. [2022-12-14 07:01:02,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 367 transitions. [2022-12-14 07:01:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:01:02,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:01:02,340 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:01:02,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-12-14 07:01:02,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:01:02,542 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:01:02,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:01:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1172407666, now seen corresponding path program 43 times [2022-12-14 07:01:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:01:02,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867301533] [2022-12-14 07:01:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:01:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:01:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:01:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:03,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:01:03,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867301533] [2022-12-14 07:01:03,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867301533] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:01:03,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234831370] [2022-12-14 07:01:03,123 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:01:03,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:01:03,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:01:03,124 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:01:03,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-14 07:01:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:01:03,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:01:03,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:01:03,412 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:01:03,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-12-14 07:01:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:03,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:01:03,552 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:01:03,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-14 07:01:03,587 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:01:03,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:01:03,611 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:03,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234831370] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:01:03,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1151987710] [2022-12-14 07:01:03,612 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:01:03,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:01:03,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:01:03,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221247456] [2022-12-14 07:01:03,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:01:03,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:01:03,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:01:03,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:01:03,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:01:03,613 INFO L87 Difference]: Start difference. First operand 154 states and 367 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:04,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:01:04,065 INFO L93 Difference]: Finished difference Result 232 states and 539 transitions. [2022-12-14 07:01:04,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:01:04,065 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:01:04,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:01:04,066 INFO L225 Difference]: With dead ends: 232 [2022-12-14 07:01:04,066 INFO L226 Difference]: Without dead ends: 219 [2022-12-14 07:01:04,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2022-12-14 07:01:04,066 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:01:04,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:01:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-14 07:01:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 154. [2022-12-14 07:01:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.3790849673202614) internal successors, (364), 153 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:04,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 364 transitions. [2022-12-14 07:01:04,069 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 364 transitions. Word has length 29 [2022-12-14 07:01:04,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:01:04,069 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 364 transitions. [2022-12-14 07:01:04,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 364 transitions. [2022-12-14 07:01:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:01:04,070 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:01:04,070 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:01:04,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-12-14 07:01:04,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:01:04,271 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:01:04,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:01:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash -206474880, now seen corresponding path program 44 times [2022-12-14 07:01:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:01:04,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073199437] [2022-12-14 07:01:04,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:01:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:01:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:01:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:04,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:01:04,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073199437] [2022-12-14 07:01:04,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073199437] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:01:04,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69508523] [2022-12-14 07:01:04,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:01:04,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:01:04,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:01:04,806 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:01:04,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-14 07:01:05,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:01:05,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:01:05,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:01:05,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:01:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:05,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:01:05,377 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:01:05,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:01:05,395 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:01:05,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:01:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:05,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69508523] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:01:05,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1891038724] [2022-12-14 07:01:05,425 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:01:05,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:01:05,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 18 [2022-12-14 07:01:05,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430750310] [2022-12-14 07:01:05,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:01:05,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 07:01:05,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:01:05,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 07:01:05,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-12-14 07:01:05,426 INFO L87 Difference]: Start difference. First operand 154 states and 364 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:06,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:01:06,013 INFO L93 Difference]: Finished difference Result 180 states and 429 transitions. [2022-12-14 07:01:06,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 07:01:06,014 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:01:06,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:01:06,014 INFO L225 Difference]: With dead ends: 180 [2022-12-14 07:01:06,014 INFO L226 Difference]: Without dead ends: 180 [2022-12-14 07:01:06,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2022-12-14 07:01:06,015 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:01:06,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:01:06,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-12-14 07:01:06,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 158. [2022-12-14 07:01:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.394904458598726) internal successors, (376), 157 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 376 transitions. [2022-12-14 07:01:06,017 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 376 transitions. Word has length 29 [2022-12-14 07:01:06,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:01:06,017 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 376 transitions. [2022-12-14 07:01:06,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 376 transitions. [2022-12-14 07:01:06,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:01:06,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:01:06,018 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:01:06,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-12-14 07:01:06,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-12-14 07:01:06,219 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:01:06,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:01:06,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1647130048, now seen corresponding path program 45 times [2022-12-14 07:01:06,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:01:06,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107239834] [2022-12-14 07:01:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:01:06,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:01:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:01:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:06,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:01:06,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107239834] [2022-12-14 07:01:06,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107239834] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:01:06,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836294064] [2022-12-14 07:01:06,797 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:01:06,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:01:06,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:01:06,798 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:01:06,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-14 07:01:06,989 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:01:06,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:01:06,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:01:06,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:01:07,115 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:01:07,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-14 07:01:07,123 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:01:07,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-14 07:01:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:07,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:01:07,338 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:01:07,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:01:07,356 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:01:07,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:01:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:07,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836294064] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:01:07,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1263680937] [2022-12-14 07:01:07,384 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:01:07,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:01:07,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 19 [2022-12-14 07:01:07,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68518052] [2022-12-14 07:01:07,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:01:07,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:01:07,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:01:07,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:01:07,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:01:07,385 INFO L87 Difference]: Start difference. First operand 158 states and 376 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:01:08,167 INFO L93 Difference]: Finished difference Result 214 states and 504 transitions. [2022-12-14 07:01:08,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 07:01:08,167 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:01:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:01:08,168 INFO L225 Difference]: With dead ends: 214 [2022-12-14 07:01:08,168 INFO L226 Difference]: Without dead ends: 214 [2022-12-14 07:01:08,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=934, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 07:01:08,168 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:01:08,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:01:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-12-14 07:01:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 160. [2022-12-14 07:01:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.4213836477987423) internal successors, (385), 159 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 385 transitions. [2022-12-14 07:01:08,171 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 385 transitions. Word has length 29 [2022-12-14 07:01:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:01:08,171 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 385 transitions. [2022-12-14 07:01:08,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 385 transitions. [2022-12-14 07:01:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:01:08,171 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:01:08,171 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:01:08,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-14 07:01:08,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-14 07:01:08,372 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:01:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:01:08,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1654251712, now seen corresponding path program 46 times [2022-12-14 07:01:08,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:01:08,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224970670] [2022-12-14 07:01:08,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:01:08,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:01:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:01:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:08,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:01:08,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224970670] [2022-12-14 07:01:08,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224970670] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:01:08,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531185737] [2022-12-14 07:01:08,949 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:01:08,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:01:08,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:01:08,950 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:01:08,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-14 07:01:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:01:09,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 07:01:09,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:01:09,232 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:01:09,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-14 07:01:09,241 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:01:09,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-14 07:01:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:09,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:01:09,579 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:01:09,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:01:09,600 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:01:09,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:01:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:09,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531185737] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:01:09,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [746708600] [2022-12-14 07:01:09,634 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:01:09,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:01:09,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 22 [2022-12-14 07:01:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615319745] [2022-12-14 07:01:09,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:01:09,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 07:01:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:01:09,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 07:01:09,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-12-14 07:01:09,635 INFO L87 Difference]: Start difference. First operand 160 states and 385 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:01:10,722 INFO L93 Difference]: Finished difference Result 227 states and 536 transitions. [2022-12-14 07:01:10,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 07:01:10,722 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:01:10,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:01:10,723 INFO L225 Difference]: With dead ends: 227 [2022-12-14 07:01:10,723 INFO L226 Difference]: Without dead ends: 214 [2022-12-14 07:01:10,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=1209, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 07:01:10,723 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:01:10,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 07:01:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-12-14 07:01:10,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 162. [2022-12-14 07:01:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.3850931677018634) internal successors, (384), 161 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 384 transitions. [2022-12-14 07:01:10,726 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 384 transitions. Word has length 29 [2022-12-14 07:01:10,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:01:10,726 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 384 transitions. [2022-12-14 07:01:10,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 384 transitions. [2022-12-14 07:01:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:01:10,726 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:01:10,726 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:01:10,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-12-14 07:01:10,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-12-14 07:01:10,927 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:01:10,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:01:10,928 INFO L85 PathProgramCache]: Analyzing trace with hash -921147740, now seen corresponding path program 47 times [2022-12-14 07:01:10,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:01:10,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623998089] [2022-12-14 07:01:10,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:01:10,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:01:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:01:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:11,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:01:11,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623998089] [2022-12-14 07:01:11,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623998089] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:01:11,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605252959] [2022-12-14 07:01:11,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:01:11,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:01:11,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:01:11,533 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:01:11,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-14 07:01:11,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:01:11,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:01:11,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:01:11,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:01:11,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:01:11,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:01:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:11,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:01:12,057 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:01:12,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:01:12,072 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:01:12,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:01:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:12,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605252959] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:01:12,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [174228354] [2022-12-14 07:01:12,105 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:01:12,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:01:12,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 19 [2022-12-14 07:01:12,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083535374] [2022-12-14 07:01:12,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:01:12,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:01:12,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:01:12,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:01:12,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:01:12,106 INFO L87 Difference]: Start difference. First operand 162 states and 384 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:01:12,703 INFO L93 Difference]: Finished difference Result 208 states and 488 transitions. [2022-12-14 07:01:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 07:01:12,704 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:01:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:01:12,704 INFO L225 Difference]: With dead ends: 208 [2022-12-14 07:01:12,704 INFO L226 Difference]: Without dead ends: 208 [2022-12-14 07:01:12,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2022-12-14 07:01:12,705 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:01:12,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:01:12,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-12-14 07:01:12,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 166. [2022-12-14 07:01:12,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.4242424242424243) internal successors, (400), 165 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 400 transitions. [2022-12-14 07:01:12,707 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 400 transitions. Word has length 29 [2022-12-14 07:01:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:01:12,707 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 400 transitions. [2022-12-14 07:01:12,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 400 transitions. [2022-12-14 07:01:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:01:12,708 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:01:12,708 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:01:12,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-12-14 07:01:12,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:01:12,909 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:01:12,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:01:12,910 INFO L85 PathProgramCache]: Analyzing trace with hash -914026076, now seen corresponding path program 48 times [2022-12-14 07:01:12,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:01:12,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945368255] [2022-12-14 07:01:12,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:01:12,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:01:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:01:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:13,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:01:13,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945368255] [2022-12-14 07:01:13,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945368255] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:01:13,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152651705] [2022-12-14 07:01:13,453 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:01:13,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:01:13,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:01:13,453 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:01:13,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-14 07:01:13,628 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:01:13,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:01:13,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:01:13,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:01:13,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:01:13,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2022-12-14 07:01:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:13,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:01:13,962 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:01:13,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:01:13,975 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:01:13,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:01:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:14,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152651705] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:01:14,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1168663274] [2022-12-14 07:01:14,003 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:01:14,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:01:14,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:01:14,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614307094] [2022-12-14 07:01:14,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:01:14,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:01:14,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:01:14,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:01:14,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:01:14,004 INFO L87 Difference]: Start difference. First operand 166 states and 400 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:15,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:01:15,007 INFO L93 Difference]: Finished difference Result 233 states and 543 transitions. [2022-12-14 07:01:15,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 07:01:15,008 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:01:15,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:01:15,008 INFO L225 Difference]: With dead ends: 233 [2022-12-14 07:01:15,008 INFO L226 Difference]: Without dead ends: 229 [2022-12-14 07:01:15,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 07:01:15,009 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 127 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:01:15,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 0 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:01:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-12-14 07:01:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 164. [2022-12-14 07:01:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 2.3987730061349692) internal successors, (391), 163 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 391 transitions. [2022-12-14 07:01:15,011 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 391 transitions. Word has length 29 [2022-12-14 07:01:15,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:01:15,011 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 391 transitions. [2022-12-14 07:01:15,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 391 transitions. [2022-12-14 07:01:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:01:15,012 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:01:15,012 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:01:15,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-12-14 07:01:15,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-12-14 07:01:15,213 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:01:15,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:01:15,214 INFO L85 PathProgramCache]: Analyzing trace with hash -472204098, now seen corresponding path program 49 times [2022-12-14 07:01:15,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:01:15,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153085492] [2022-12-14 07:01:15,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:01:15,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:01:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:01:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:15,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:01:15,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153085492] [2022-12-14 07:01:15,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153085492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:01:15,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170711266] [2022-12-14 07:01:15,803 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:01:15,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:01:15,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:01:15,804 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:01:15,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-14 07:01:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:01:15,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:01:15,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:01:16,141 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:01:16,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-12-14 07:01:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:16,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:01:16,342 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:01:16,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:01:16,358 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:01:16,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:01:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:16,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170711266] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:01:16,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [891095501] [2022-12-14 07:01:16,393 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:01:16,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:01:16,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 19 [2022-12-14 07:01:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219550684] [2022-12-14 07:01:16,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:01:16,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:01:16,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:01:16,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:01:16,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:01:16,394 INFO L87 Difference]: Start difference. First operand 164 states and 391 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:01:16,982 INFO L93 Difference]: Finished difference Result 205 states and 483 transitions. [2022-12-14 07:01:16,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 07:01:16,983 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 07:01:16,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:01:16,984 INFO L225 Difference]: With dead ends: 205 [2022-12-14 07:01:16,984 INFO L226 Difference]: Without dead ends: 197 [2022-12-14 07:01:16,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2022-12-14 07:01:16,985 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:01:16,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:01:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-12-14 07:01:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 162. [2022-12-14 07:01:16,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.3850931677018634) internal successors, (384), 161 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 384 transitions. [2022-12-14 07:01:16,991 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 384 transitions. Word has length 29 [2022-12-14 07:01:16,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:01:16,991 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 384 transitions. [2022-12-14 07:01:16,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:01:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 384 transitions. [2022-12-14 07:01:16,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:01:16,992 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:01:16,992 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:01:16,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-12-14 07:01:17,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-12-14 07:01:17,193 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:01:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:01:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1960119510, now seen corresponding path program 50 times [2022-12-14 07:01:17,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:01:17,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346642506] [2022-12-14 07:01:17,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:01:17,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:01:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:01:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:17,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:01:17,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346642506] [2022-12-14 07:01:17,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346642506] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:01:17,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239886460] [2022-12-14 07:01:17,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:01:17,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:01:17,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:01:17,773 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:01:17,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-14 07:01:17,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:01:17,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:01:17,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:01:17,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:01:18,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-12-14 07:01:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:18,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:01:18,328 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-14 07:01:18,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 107 [2022-12-14 07:01:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:01:18,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239886460] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:01:18,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [347433428] [2022-12-14 07:01:18,420 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2022-12-14 07:02:43,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2022-12-14 07:02:43,578 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:02:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:02:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash -724422115, now seen corresponding path program 68 times [2022-12-14 07:02:43,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:02:43,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674834742] [2022-12-14 07:02:43,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:02:43,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:02:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:02:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:44,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:02:44,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674834742] [2022-12-14 07:02:44,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674834742] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:02:44,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935507273] [2022-12-14 07:02:44,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:02:44,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:02:44,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:02:44,193 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:02:44,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-12-14 07:02:44,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:02:44,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:02:44,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:02:44,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:02:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:44,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:02:44,770 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:02:44,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:02:44,806 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:02:44,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:02:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:44,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935507273] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:02:44,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1412910756] [2022-12-14 07:02:44,850 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:02:44,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:02:44,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:02:44,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245040092] [2022-12-14 07:02:44,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:02:44,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:02:44,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:02:44,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:02:44,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:02:44,851 INFO L87 Difference]: Start difference. First operand 151 states and 360 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:02:45,183 INFO L93 Difference]: Finished difference Result 167 states and 395 transitions. [2022-12-14 07:02:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 07:02:45,184 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:02:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:02:45,184 INFO L225 Difference]: With dead ends: 167 [2022-12-14 07:02:45,184 INFO L226 Difference]: Without dead ends: 163 [2022-12-14 07:02:45,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2022-12-14 07:02:45,184 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:02:45,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:02:45,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-12-14 07:02:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2022-12-14 07:02:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.4) internal successors, (360), 150 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 360 transitions. [2022-12-14 07:02:45,186 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 360 transitions. Word has length 30 [2022-12-14 07:02:45,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:02:45,187 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 360 transitions. [2022-12-14 07:02:45,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 360 transitions. [2022-12-14 07:02:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:02:45,187 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:02:45,187 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:02:45,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-12-14 07:02:45,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-12-14 07:02:45,388 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:02:45,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:02:45,389 INFO L85 PathProgramCache]: Analyzing trace with hash -56242259, now seen corresponding path program 69 times [2022-12-14 07:02:45,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:02:45,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405748299] [2022-12-14 07:02:45,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:02:45,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:02:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:02:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:46,001 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:02:46,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405748299] [2022-12-14 07:02:46,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405748299] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:02:46,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127962717] [2022-12-14 07:02:46,001 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:02:46,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:02:46,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:02:46,002 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:02:46,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-12-14 07:02:46,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:02:46,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:02:46,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:02:46,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:02:46,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:02:46,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:02:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:46,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:02:46,606 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:02:46,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:02:46,654 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:02:46,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:02:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:46,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127962717] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:02:46,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1901930660] [2022-12-14 07:02:46,708 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:02:46,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:02:46,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:02:46,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711800574] [2022-12-14 07:02:46,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:02:46,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:02:46,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:02:46,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:02:46,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:02:46,709 INFO L87 Difference]: Start difference. First operand 151 states and 360 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:02:47,336 INFO L93 Difference]: Finished difference Result 189 states and 439 transitions. [2022-12-14 07:02:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:02:47,336 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:02:47,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:02:47,337 INFO L225 Difference]: With dead ends: 189 [2022-12-14 07:02:47,337 INFO L226 Difference]: Without dead ends: 189 [2022-12-14 07:02:47,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2022-12-14 07:02:47,338 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:02:47,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:02:47,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-12-14 07:02:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2022-12-14 07:02:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.4155844155844157) internal successors, (372), 154 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 372 transitions. [2022-12-14 07:02:47,340 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 372 transitions. Word has length 30 [2022-12-14 07:02:47,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:02:47,340 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 372 transitions. [2022-12-14 07:02:47,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 372 transitions. [2022-12-14 07:02:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:02:47,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:02:47,341 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:02:47,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-12-14 07:02:47,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,73 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:02:47,542 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:02:47,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:02:47,543 INFO L85 PathProgramCache]: Analyzing trace with hash 485685953, now seen corresponding path program 70 times [2022-12-14 07:02:47,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:02:47,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190855739] [2022-12-14 07:02:47,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:02:47,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:02:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:02:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:48,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:02:48,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190855739] [2022-12-14 07:02:48,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190855739] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:02:48,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593778878] [2022-12-14 07:02:48,177 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:02:48,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:02:48,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:02:48,178 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:02:48,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-12-14 07:02:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:02:48,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:02:48,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:02:48,558 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:02:48,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:02:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:48,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:02:48,818 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:02:48,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:02:48,864 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:02:48,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:02:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:48,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593778878] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:02:48,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2018439067] [2022-12-14 07:02:48,919 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:02:48,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:02:48,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:02:48,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460052952] [2022-12-14 07:02:48,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:02:48,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:02:48,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:02:48,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:02:48,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:02:48,920 INFO L87 Difference]: Start difference. First operand 155 states and 372 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:02:49,712 INFO L93 Difference]: Finished difference Result 185 states and 440 transitions. [2022-12-14 07:02:49,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 07:02:49,712 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:02:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:02:49,713 INFO L225 Difference]: With dead ends: 185 [2022-12-14 07:02:49,714 INFO L226 Difference]: Without dead ends: 183 [2022-12-14 07:02:49,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2022-12-14 07:02:49,714 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:02:49,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:02:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-12-14 07:02:49,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 151. [2022-12-14 07:02:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.4) internal successors, (360), 150 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 360 transitions. [2022-12-14 07:02:49,716 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 360 transitions. Word has length 30 [2022-12-14 07:02:49,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:02:49,716 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 360 transitions. [2022-12-14 07:02:49,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 360 transitions. [2022-12-14 07:02:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:02:49,716 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:02:49,716 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:02:49,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2022-12-14 07:02:49,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-12-14 07:02:49,918 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:02:49,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:02:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash 236980809, now seen corresponding path program 71 times [2022-12-14 07:02:49,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:02:49,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404095849] [2022-12-14 07:02:49,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:02:49,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:02:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:02:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:50,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:02:50,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404095849] [2022-12-14 07:02:50,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404095849] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:02:50,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264857466] [2022-12-14 07:02:50,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:02:50,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:02:50,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:02:50,572 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:02:50,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-12-14 07:02:50,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:02:50,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:02:50,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:02:50,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:02:50,949 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:02:50,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2022-12-14 07:02:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:50,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:02:51,144 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:02:51,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:02:51,192 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:02:51,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:02:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:51,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264857466] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:02:51,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [90555812] [2022-12-14 07:02:51,234 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:02:51,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:02:51,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 19 [2022-12-14 07:02:51,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141815684] [2022-12-14 07:02:51,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:02:51,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:02:51,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:02:51,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:02:51,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:02:51,235 INFO L87 Difference]: Start difference. First operand 151 states and 360 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:02:51,605 INFO L93 Difference]: Finished difference Result 183 states and 439 transitions. [2022-12-14 07:02:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:02:51,605 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:02:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:02:51,606 INFO L225 Difference]: With dead ends: 183 [2022-12-14 07:02:51,606 INFO L226 Difference]: Without dead ends: 183 [2022-12-14 07:02:51,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2022-12-14 07:02:51,606 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:02:51,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:02:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-12-14 07:02:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 159. [2022-12-14 07:02:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.3987341772151898) internal successors, (379), 158 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 379 transitions. [2022-12-14 07:02:51,609 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 379 transitions. Word has length 30 [2022-12-14 07:02:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:02:51,609 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 379 transitions. [2022-12-14 07:02:51,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:51,609 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 379 transitions. [2022-12-14 07:02:51,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:02:51,609 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:02:51,609 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:02:51,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2022-12-14 07:02:51,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-12-14 07:02:51,810 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:02:51,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:02:51,810 INFO L85 PathProgramCache]: Analyzing trace with hash 914484851, now seen corresponding path program 72 times [2022-12-14 07:02:51,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:02:51,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117380861] [2022-12-14 07:02:51,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:02:51,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:02:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:02:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:52,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:02:52,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117380861] [2022-12-14 07:02:52,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117380861] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:02:52,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760877145] [2022-12-14 07:02:52,357 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:02:52,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:02:52,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:02:52,358 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:02:52,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-12-14 07:02:52,624 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:02:52,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:02:52,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:02:52,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:02:52,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:02:52,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:02:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:52,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:02:52,940 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:02:52,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:02:52,972 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:02:52,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:02:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:53,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760877145] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:02:53,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1498673138] [2022-12-14 07:02:53,008 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:02:53,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:02:53,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 20 [2022-12-14 07:02:53,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348778108] [2022-12-14 07:02:53,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:02:53,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:02:53,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:02:53,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:02:53,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:02:53,009 INFO L87 Difference]: Start difference. First operand 159 states and 379 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:02:53,348 INFO L93 Difference]: Finished difference Result 185 states and 444 transitions. [2022-12-14 07:02:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:02:53,348 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:02:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:02:53,348 INFO L225 Difference]: With dead ends: 185 [2022-12-14 07:02:53,348 INFO L226 Difference]: Without dead ends: 185 [2022-12-14 07:02:53,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2022-12-14 07:02:53,349 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:02:53,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:02:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-12-14 07:02:53,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 157. [2022-12-14 07:02:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.3974358974358974) internal successors, (374), 156 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 374 transitions. [2022-12-14 07:02:53,351 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 374 transitions. Word has length 30 [2022-12-14 07:02:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:02:53,351 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 374 transitions. [2022-12-14 07:02:53,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 374 transitions. [2022-12-14 07:02:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:02:53,351 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:02:53,351 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:02:53,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2022-12-14 07:02:53,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,76 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:02:53,553 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:02:53,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:02:53,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1415349059, now seen corresponding path program 73 times [2022-12-14 07:02:53,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:02:53,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490906266] [2022-12-14 07:02:53,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:02:53,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:02:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:02:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:54,144 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:02:54,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490906266] [2022-12-14 07:02:54,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490906266] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:02:54,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753365877] [2022-12-14 07:02:54,144 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:02:54,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:02:54,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:02:54,145 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:02:54,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-12-14 07:02:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:02:54,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:02:54,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:02:54,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:02:54,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 35 [2022-12-14 07:02:54,574 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:54,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:02:54,744 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-14 07:02:54,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 96 [2022-12-14 07:02:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:54,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753365877] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:02:54,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [392106225] [2022-12-14 07:02:54,821 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:02:54,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:02:54,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:02:54,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821202865] [2022-12-14 07:02:54,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:02:54,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:02:54,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:02:54,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:02:54,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:02:54,821 INFO L87 Difference]: Start difference. First operand 157 states and 374 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:02:55,296 INFO L93 Difference]: Finished difference Result 199 states and 459 transitions. [2022-12-14 07:02:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:02:55,297 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:02:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:02:55,297 INFO L225 Difference]: With dead ends: 199 [2022-12-14 07:02:55,297 INFO L226 Difference]: Without dead ends: 199 [2022-12-14 07:02:55,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2022-12-14 07:02:55,298 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:02:55,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:02:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-12-14 07:02:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 159. [2022-12-14 07:02:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.411392405063291) internal successors, (381), 158 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 381 transitions. [2022-12-14 07:02:55,300 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 381 transitions. Word has length 30 [2022-12-14 07:02:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:02:55,300 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 381 transitions. [2022-12-14 07:02:55,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 381 transitions. [2022-12-14 07:02:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:02:55,300 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:02:55,300 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:02:55,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2022-12-14 07:02:55,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2022-12-14 07:02:55,502 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:02:55,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:02:55,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1957277271, now seen corresponding path program 74 times [2022-12-14 07:02:55,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:02:55,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377627351] [2022-12-14 07:02:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:02:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:02:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:02:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:56,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:02:56,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377627351] [2022-12-14 07:02:56,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377627351] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:02:56,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290534709] [2022-12-14 07:02:56,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:02:56,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:02:56,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:02:56,074 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:02:56,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-12-14 07:02:56,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:02:56,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:02:56,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:02:56,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:02:56,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:02:56,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2022-12-14 07:02:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:56,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:02:56,705 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-14 07:02:56,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 96 [2022-12-14 07:02:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:56,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290534709] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:02:56,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [571267311] [2022-12-14 07:02:56,765 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:02:56,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:02:56,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 21 [2022-12-14 07:02:56,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540663401] [2022-12-14 07:02:56,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:02:56,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 07:02:56,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:02:56,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 07:02:56,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-12-14 07:02:56,766 INFO L87 Difference]: Start difference. First operand 159 states and 381 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:02:57,647 INFO L93 Difference]: Finished difference Result 219 states and 492 transitions. [2022-12-14 07:02:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 07:02:57,647 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:02:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:02:57,649 INFO L225 Difference]: With dead ends: 219 [2022-12-14 07:02:57,649 INFO L226 Difference]: Without dead ends: 217 [2022-12-14 07:02:57,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:02:57,649 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:02:57,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:02:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-12-14 07:02:57,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 155. [2022-12-14 07:02:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.396103896103896) internal successors, (369), 154 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 369 transitions. [2022-12-14 07:02:57,652 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 369 transitions. Word has length 30 [2022-12-14 07:02:57,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:02:57,652 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 369 transitions. [2022-12-14 07:02:57,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 369 transitions. [2022-12-14 07:02:57,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:02:57,652 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:02:57,652 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:02:57,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-12-14 07:02:57,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,78 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:02:57,853 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:02:57,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:02:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash 548467231, now seen corresponding path program 75 times [2022-12-14 07:02:57,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:02:57,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677034517] [2022-12-14 07:02:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:02:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:02:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:02:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:58,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:02:58,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677034517] [2022-12-14 07:02:58,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677034517] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:02:58,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42842732] [2022-12-14 07:02:58,485 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:02:58,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:02:58,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:02:58,486 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:02:58,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-12-14 07:02:58,707 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:02:58,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:02:58,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:02:58,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:02:58,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:02:58,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 60 [2022-12-14 07:02:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:58,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:02:59,135 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-14 07:02:59,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 96 [2022-12-14 07:02:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:02:59,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42842732] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:02:59,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [799102428] [2022-12-14 07:02:59,214 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:02:59,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:02:59,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:02:59,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554693141] [2022-12-14 07:02:59,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:02:59,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:02:59,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:02:59,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:02:59,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:02:59,215 INFO L87 Difference]: Start difference. First operand 155 states and 369 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:02:59,711 INFO L93 Difference]: Finished difference Result 173 states and 405 transitions. [2022-12-14 07:02:59,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 07:02:59,711 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:02:59,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:02:59,712 INFO L225 Difference]: With dead ends: 173 [2022-12-14 07:02:59,712 INFO L226 Difference]: Without dead ends: 167 [2022-12-14 07:02:59,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2022-12-14 07:02:59,713 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:02:59,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:02:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-12-14 07:02:59,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2022-12-14 07:02:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.3815789473684212) internal successors, (362), 152 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 362 transitions. [2022-12-14 07:02:59,715 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 362 transitions. Word has length 30 [2022-12-14 07:02:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:02:59,715 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 362 transitions. [2022-12-14 07:02:59,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:02:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 362 transitions. [2022-12-14 07:02:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:02:59,715 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:02:59,716 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:02:59,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-12-14 07:02:59,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,79 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:02:59,917 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:02:59,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:02:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2048050827, now seen corresponding path program 76 times [2022-12-14 07:02:59,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:02:59,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565797779] [2022-12-14 07:02:59,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:02:59,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:02:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:00,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:00,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565797779] [2022-12-14 07:03:00,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565797779] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:00,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8013021] [2022-12-14 07:03:00,568 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:03:00,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:00,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:00,569 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:00,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-12-14 07:03:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:00,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 07:03:00,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:01,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:01,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:03:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:01,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:01,398 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:03:01,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:03:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:01,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8013021] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:01,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [625082053] [2022-12-14 07:03:01,439 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:01,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:01,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 23 [2022-12-14 07:03:01,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641464024] [2022-12-14 07:03:01,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:01,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 07:03:01,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:01,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 07:03:01,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2022-12-14 07:03:01,440 INFO L87 Difference]: Start difference. First operand 153 states and 362 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:02,118 INFO L93 Difference]: Finished difference Result 179 states and 425 transitions. [2022-12-14 07:03:02,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 07:03:02,119 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:02,119 INFO L225 Difference]: With dead ends: 179 [2022-12-14 07:03:02,119 INFO L226 Difference]: Without dead ends: 179 [2022-12-14 07:03:02,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 07:03:02,120 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:02,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:03:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-12-14 07:03:02,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 151. [2022-12-14 07:03:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.38) internal successors, (357), 150 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 357 transitions. [2022-12-14 07:03:02,122 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 357 transitions. Word has length 30 [2022-12-14 07:03:02,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:02,122 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 357 transitions. [2022-12-14 07:03:02,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 357 transitions. [2022-12-14 07:03:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:02,122 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:02,122 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:02,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2022-12-14 07:03:02,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,80 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:02,323 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:02,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:02,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1082331305, now seen corresponding path program 77 times [2022-12-14 07:03:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:02,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351004395] [2022-12-14 07:03:02,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:02,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:02,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:02,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351004395] [2022-12-14 07:03:02,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351004395] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:02,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717360863] [2022-12-14 07:03:02,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:03:02,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:02,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:02,874 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:02,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-12-14 07:03:03,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:03:03,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:03:03,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:03:03,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:03,298 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:03:03,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 23 [2022-12-14 07:03:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:03,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:03,522 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:03:03,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:03:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:03,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717360863] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:03,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1384101089] [2022-12-14 07:03:03,545 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:03,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:03,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 20 [2022-12-14 07:03:03,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354811543] [2022-12-14 07:03:03,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:03,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:03:03,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:03,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:03:03,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:03:03,546 INFO L87 Difference]: Start difference. First operand 151 states and 357 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:03,929 INFO L93 Difference]: Finished difference Result 175 states and 417 transitions. [2022-12-14 07:03:03,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:03:03,929 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:03,930 INFO L225 Difference]: With dead ends: 175 [2022-12-14 07:03:03,930 INFO L226 Difference]: Without dead ends: 175 [2022-12-14 07:03:03,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-12-14 07:03:03,930 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:03,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:03:03,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-12-14 07:03:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 149. [2022-12-14 07:03:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 2.3783783783783785) internal successors, (352), 148 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 352 transitions. [2022-12-14 07:03:03,932 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 352 transitions. Word has length 30 [2022-12-14 07:03:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:03,932 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 352 transitions. [2022-12-14 07:03:03,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 352 transitions. [2022-12-14 07:03:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:03,933 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:03,933 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:03,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2022-12-14 07:03:04,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,81 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:04,134 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:04,135 INFO L85 PathProgramCache]: Analyzing trace with hash -404827263, now seen corresponding path program 78 times [2022-12-14 07:03:04,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:04,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055730930] [2022-12-14 07:03:04,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:04,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:04,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:04,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055730930] [2022-12-14 07:03:04,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055730930] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:04,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547197583] [2022-12-14 07:03:04,730 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:03:04,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:04,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:04,731 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:04,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-12-14 07:03:04,943 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:03:04,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:03:04,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:03:04,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:05,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:05,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:03:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:05,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:05,351 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:03:05,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:03:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:05,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547197583] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:05,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1641263343] [2022-12-14 07:03:05,376 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:05,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:05,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 20 [2022-12-14 07:03:05,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59642967] [2022-12-14 07:03:05,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:05,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:03:05,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:05,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:03:05,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:03:05,377 INFO L87 Difference]: Start difference. First operand 149 states and 352 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:06,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:06,064 INFO L93 Difference]: Finished difference Result 189 states and 421 transitions. [2022-12-14 07:03:06,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 07:03:06,064 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:06,065 INFO L225 Difference]: With dead ends: 189 [2022-12-14 07:03:06,065 INFO L226 Difference]: Without dead ends: 189 [2022-12-14 07:03:06,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2022-12-14 07:03:06,066 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:06,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:03:06,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-12-14 07:03:06,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 145. [2022-12-14 07:03:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.3472222222222223) internal successors, (338), 144 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 338 transitions. [2022-12-14 07:03:06,068 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 338 transitions. Word has length 30 [2022-12-14 07:03:06,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:06,068 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 338 transitions. [2022-12-14 07:03:06,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 338 transitions. [2022-12-14 07:03:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:06,068 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:06,068 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:06,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2022-12-14 07:03:06,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2022-12-14 07:03:06,270 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:06,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:06,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1154141035, now seen corresponding path program 79 times [2022-12-14 07:03:06,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:06,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684120206] [2022-12-14 07:03:06,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:06,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:06,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:06,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684120206] [2022-12-14 07:03:06,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684120206] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:06,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206348803] [2022-12-14 07:03:06,831 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:03:06,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:06,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:06,832 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:06,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-12-14 07:03:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:07,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 07:03:07,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:07,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:07,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:03:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:07,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:07,574 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:03:07,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:03:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:07,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206348803] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:07,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1310190642] [2022-12-14 07:03:07,597 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:07,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:07,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-12-14 07:03:07,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975027507] [2022-12-14 07:03:07,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:07,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 07:03:07,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:07,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 07:03:07,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-12-14 07:03:07,598 INFO L87 Difference]: Start difference. First operand 145 states and 338 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:08,404 INFO L93 Difference]: Finished difference Result 181 states and 423 transitions. [2022-12-14 07:03:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 07:03:08,404 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:08,404 INFO L225 Difference]: With dead ends: 181 [2022-12-14 07:03:08,405 INFO L226 Difference]: Without dead ends: 179 [2022-12-14 07:03:08,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 07:03:08,405 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:08,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:03:08,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-12-14 07:03:08,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 139. [2022-12-14 07:03:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.3260869565217392) internal successors, (321), 138 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 321 transitions. [2022-12-14 07:03:08,407 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 321 transitions. Word has length 30 [2022-12-14 07:03:08,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:08,407 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 321 transitions. [2022-12-14 07:03:08,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 321 transitions. [2022-12-14 07:03:08,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:08,407 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:08,407 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:08,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-12-14 07:03:08,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2022-12-14 07:03:08,609 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:08,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:08,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1055089633, now seen corresponding path program 80 times [2022-12-14 07:03:08,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:08,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126915076] [2022-12-14 07:03:08,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:08,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:09,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:09,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126915076] [2022-12-14 07:03:09,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126915076] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:09,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661123186] [2022-12-14 07:03:09,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:03:09,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:09,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:09,071 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:09,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-12-14 07:03:09,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 07:03:09,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:03:09,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-14 07:03:09,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:09,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:09,781 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:03:09,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:03:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:09,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661123186] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:09,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1639699771] [2022-12-14 07:03:09,802 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:09,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:09,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 22 [2022-12-14 07:03:09,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750954581] [2022-12-14 07:03:09,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:09,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 07:03:09,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:09,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 07:03:09,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2022-12-14 07:03:09,803 INFO L87 Difference]: Start difference. First operand 139 states and 321 transitions. Second operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:10,465 INFO L93 Difference]: Finished difference Result 223 states and 517 transitions. [2022-12-14 07:03:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 07:03:10,465 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:10,466 INFO L225 Difference]: With dead ends: 223 [2022-12-14 07:03:10,466 INFO L226 Difference]: Without dead ends: 223 [2022-12-14 07:03:10,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 07:03:10,466 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:10,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 0 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:03:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-12-14 07:03:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 153. [2022-12-14 07:03:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.3223684210526314) internal successors, (353), 152 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 353 transitions. [2022-12-14 07:03:10,468 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 353 transitions. Word has length 30 [2022-12-14 07:03:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:10,468 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 353 transitions. [2022-12-14 07:03:10,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 353 transitions. [2022-12-14 07:03:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:10,469 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:10,469 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:10,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2022-12-14 07:03:10,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,84 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:10,670 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:10,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:10,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1689329553, now seen corresponding path program 81 times [2022-12-14 07:03:10,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:10,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199471089] [2022-12-14 07:03:10,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:10,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:11,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:11,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199471089] [2022-12-14 07:03:11,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199471089] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:11,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632679394] [2022-12-14 07:03:11,232 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:03:11,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:11,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:11,233 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:11,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-12-14 07:03:11,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:03:11,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:03:11,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:03:11,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:11,598 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:03:11,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2022-12-14 07:03:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:11,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:11,775 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:03:11,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:03:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:11,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632679394] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:11,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1034575333] [2022-12-14 07:03:11,796 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:11,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:11,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:03:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828116071] [2022-12-14 07:03:11,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:11,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:03:11,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:11,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:03:11,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:03:11,797 INFO L87 Difference]: Start difference. First operand 153 states and 353 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:12,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:12,375 INFO L93 Difference]: Finished difference Result 225 states and 524 transitions. [2022-12-14 07:03:12,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 07:03:12,375 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:12,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:12,376 INFO L225 Difference]: With dead ends: 225 [2022-12-14 07:03:12,376 INFO L226 Difference]: Without dead ends: 225 [2022-12-14 07:03:12,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=736, Unknown=0, NotChecked=0, Total=930 [2022-12-14 07:03:12,376 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:12,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:03:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-12-14 07:03:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 155. [2022-12-14 07:03:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.324675324675325) internal successors, (358), 154 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 358 transitions. [2022-12-14 07:03:12,378 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 358 transitions. Word has length 30 [2022-12-14 07:03:12,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:12,379 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 358 transitions. [2022-12-14 07:03:12,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 358 transitions. [2022-12-14 07:03:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:12,379 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:12,379 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:12,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2022-12-14 07:03:12,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-12-14 07:03:12,580 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:12,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:12,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1928133701, now seen corresponding path program 82 times [2022-12-14 07:03:12,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:12,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5395701] [2022-12-14 07:03:12,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:12,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:13,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:13,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5395701] [2022-12-14 07:03:13,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5395701] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:13,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797899416] [2022-12-14 07:03:13,141 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:03:13,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:13,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:13,142 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:13,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-12-14 07:03:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:13,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:03:13,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:13,486 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:13,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:03:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:13,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:13,726 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:03:13,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:03:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:13,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797899416] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:13,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1523513029] [2022-12-14 07:03:13,746 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:13,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:13,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 21 [2022-12-14 07:03:13,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222443243] [2022-12-14 07:03:13,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:13,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 07:03:13,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:13,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 07:03:13,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-12-14 07:03:13,747 INFO L87 Difference]: Start difference. First operand 155 states and 358 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:14,690 INFO L93 Difference]: Finished difference Result 243 states and 544 transitions. [2022-12-14 07:03:14,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 07:03:14,690 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:14,691 INFO L225 Difference]: With dead ends: 243 [2022-12-14 07:03:14,691 INFO L226 Difference]: Without dead ends: 243 [2022-12-14 07:03:14,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=879, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 07:03:14,691 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 191 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:14,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 0 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:03:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-12-14 07:03:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 157. [2022-12-14 07:03:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.33974358974359) internal successors, (365), 156 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 365 transitions. [2022-12-14 07:03:14,694 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 365 transitions. Word has length 30 [2022-12-14 07:03:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:14,694 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 365 transitions. [2022-12-14 07:03:14,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 365 transitions. [2022-12-14 07:03:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:14,694 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:14,694 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:14,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-12-14 07:03:14,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,86 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:14,896 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:14,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:14,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1386205489, now seen corresponding path program 83 times [2022-12-14 07:03:14,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:14,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345955868] [2022-12-14 07:03:14,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:14,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:15,494 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:15,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345955868] [2022-12-14 07:03:15,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345955868] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:15,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124608387] [2022-12-14 07:03:15,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:03:15,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:15,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:15,496 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:15,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-12-14 07:03:15,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 07:03:15,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:03:15,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:03:15,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:15,988 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:15,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:03:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:16,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:16,205 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 07:03:16,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 07:03:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:16,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124608387] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:16,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1930545009] [2022-12-14 07:03:16,230 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:16,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:16,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 21 [2022-12-14 07:03:16,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063675110] [2022-12-14 07:03:16,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:16,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 07:03:16,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:16,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 07:03:16,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-12-14 07:03:16,231 INFO L87 Difference]: Start difference. First operand 157 states and 365 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:16,754 INFO L93 Difference]: Finished difference Result 185 states and 430 transitions. [2022-12-14 07:03:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:03:16,755 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:16,755 INFO L225 Difference]: With dead ends: 185 [2022-12-14 07:03:16,755 INFO L226 Difference]: Without dead ends: 183 [2022-12-14 07:03:16,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2022-12-14 07:03:16,756 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:16,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:03:16,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-12-14 07:03:16,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 153. [2022-12-14 07:03:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.3223684210526314) internal successors, (353), 152 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 353 transitions. [2022-12-14 07:03:16,758 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 353 transitions. Word has length 30 [2022-12-14 07:03:16,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:16,758 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 353 transitions. [2022-12-14 07:03:16,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 353 transitions. [2022-12-14 07:03:16,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:16,759 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:16,759 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:16,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2022-12-14 07:03:16,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,87 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:16,959 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:16,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash -70767749, now seen corresponding path program 84 times [2022-12-14 07:03:16,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:16,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936033242] [2022-12-14 07:03:16,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:16,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:17,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:17,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936033242] [2022-12-14 07:03:17,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936033242] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:17,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991714788] [2022-12-14 07:03:17,427 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:03:17,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:17,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:17,428 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:17,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-12-14 07:03:17,703 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:03:17,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:03:17,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:03:17,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:17,828 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:03:17,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2022-12-14 07:03:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:17,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:17,981 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:03:17,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:03:18,017 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:03:18,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:03:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:18,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991714788] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:18,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [289553570] [2022-12-14 07:03:18,053 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:18,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:18,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 19 [2022-12-14 07:03:18,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047760057] [2022-12-14 07:03:18,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:18,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:03:18,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:18,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:03:18,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:03:18,054 INFO L87 Difference]: Start difference. First operand 153 states and 353 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:18,443 INFO L93 Difference]: Finished difference Result 175 states and 406 transitions. [2022-12-14 07:03:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:03:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:18,444 INFO L225 Difference]: With dead ends: 175 [2022-12-14 07:03:18,444 INFO L226 Difference]: Without dead ends: 175 [2022-12-14 07:03:18,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2022-12-14 07:03:18,444 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:18,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:03:18,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-12-14 07:03:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 155. [2022-12-14 07:03:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.324675324675325) internal successors, (358), 154 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 358 transitions. [2022-12-14 07:03:18,446 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 358 transitions. Word has length 30 [2022-12-14 07:03:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:18,446 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 358 transitions. [2022-12-14 07:03:18,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 358 transitions. [2022-12-14 07:03:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:18,446 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:18,447 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:18,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2022-12-14 07:03:18,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 88 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable92 [2022-12-14 07:03:18,647 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:18,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:18,648 INFO L85 PathProgramCache]: Analyzing trace with hash 606736293, now seen corresponding path program 85 times [2022-12-14 07:03:18,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:18,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456687077] [2022-12-14 07:03:18,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:18,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:19,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:19,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456687077] [2022-12-14 07:03:19,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456687077] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:19,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491403899] [2022-12-14 07:03:19,146 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:03:19,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:19,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:19,147 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:19,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-12-14 07:03:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:19,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:03:19,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:19,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:19,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:03:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:19,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:19,701 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:03:19,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:03:19,741 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:03:19,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:03:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:19,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491403899] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:19,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [337964167] [2022-12-14 07:03:19,781 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:19,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:19,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:03:19,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707622368] [2022-12-14 07:03:19,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:19,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:03:19,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:19,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:03:19,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:03:19,783 INFO L87 Difference]: Start difference. First operand 155 states and 358 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:20,409 INFO L93 Difference]: Finished difference Result 197 states and 436 transitions. [2022-12-14 07:03:20,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 07:03:20,410 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:20,410 INFO L225 Difference]: With dead ends: 197 [2022-12-14 07:03:20,410 INFO L226 Difference]: Without dead ends: 197 [2022-12-14 07:03:20,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2022-12-14 07:03:20,411 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:20,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:03:20,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-12-14 07:03:20,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 157. [2022-12-14 07:03:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.33974358974359) internal successors, (365), 156 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 365 transitions. [2022-12-14 07:03:20,413 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 365 transitions. Word has length 30 [2022-12-14 07:03:20,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:20,413 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 365 transitions. [2022-12-14 07:03:20,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:20,413 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 365 transitions. [2022-12-14 07:03:20,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:20,414 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:20,414 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:20,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2022-12-14 07:03:20,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,89 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:20,615 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1148664505, now seen corresponding path program 86 times [2022-12-14 07:03:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:20,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971558574] [2022-12-14 07:03:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:21,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:21,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971558574] [2022-12-14 07:03:21,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971558574] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:21,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246153810] [2022-12-14 07:03:21,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:03:21,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:21,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:21,200 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:21,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-12-14 07:03:21,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 07:03:21,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:03:21,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 07:03:21,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:21,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:21,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:03:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:21,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:21,936 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 07:03:21,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 07:03:21,971 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:03:21,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 07:03:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:22,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246153810] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:22,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [877966013] [2022-12-14 07:03:22,020 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:22,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:22,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 21 [2022-12-14 07:03:22,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762974950] [2022-12-14 07:03:22,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:22,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 07:03:22,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:22,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 07:03:22,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-12-14 07:03:22,021 INFO L87 Difference]: Start difference. First operand 157 states and 365 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:22,838 INFO L93 Difference]: Finished difference Result 185 states and 429 transitions. [2022-12-14 07:03:22,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 07:03:22,838 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:22,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:22,839 INFO L225 Difference]: With dead ends: 185 [2022-12-14 07:03:22,839 INFO L226 Difference]: Without dead ends: 183 [2022-12-14 07:03:22,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=1089, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 07:03:22,839 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:22,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:03:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-12-14 07:03:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 153. [2022-12-14 07:03:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.3223684210526314) internal successors, (353), 152 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 353 transitions. [2022-12-14 07:03:22,841 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 353 transitions. Word has length 30 [2022-12-14 07:03:22,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:22,842 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 353 transitions. [2022-12-14 07:03:22,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 353 transitions. [2022-12-14 07:03:22,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:22,842 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:22,842 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:22,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2022-12-14 07:03:23,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,90 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:23,043 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:23,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash 90560415, now seen corresponding path program 87 times [2022-12-14 07:03:23,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:23,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922019012] [2022-12-14 07:03:23,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:23,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:23,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:23,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922019012] [2022-12-14 07:03:23,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922019012] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:23,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882339736] [2022-12-14 07:03:23,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:03:23,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:23,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:23,644 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:23,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-12-14 07:03:23,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:03:23,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:03:23,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:03:23,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:23,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:23,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 35 [2022-12-14 07:03:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:24,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:24,275 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-14 07:03:24,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 96 [2022-12-14 07:03:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:24,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882339736] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:24,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1130614807] [2022-12-14 07:03:24,337 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:24,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:24,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:03:24,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845897493] [2022-12-14 07:03:24,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:24,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:03:24,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:24,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:03:24,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:03:24,338 INFO L87 Difference]: Start difference. First operand 153 states and 353 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:24,795 INFO L93 Difference]: Finished difference Result 187 states and 415 transitions. [2022-12-14 07:03:24,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:03:24,796 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:24,797 INFO L225 Difference]: With dead ends: 187 [2022-12-14 07:03:24,797 INFO L226 Difference]: Without dead ends: 187 [2022-12-14 07:03:24,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2022-12-14 07:03:24,797 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:24,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:03:24,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-12-14 07:03:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 149. [2022-12-14 07:03:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 2.3175675675675675) internal successors, (343), 148 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 343 transitions. [2022-12-14 07:03:24,799 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 343 transitions. Word has length 30 [2022-12-14 07:03:24,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:24,799 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 343 transitions. [2022-12-14 07:03:24,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 343 transitions. [2022-12-14 07:03:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:24,800 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:24,800 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:24,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2022-12-14 07:03:25,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,91 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:25,001 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:25,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:25,002 INFO L85 PathProgramCache]: Analyzing trace with hash -776321413, now seen corresponding path program 88 times [2022-12-14 07:03:25,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:25,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10476165] [2022-12-14 07:03:25,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:25,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:25,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:25,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10476165] [2022-12-14 07:03:25,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10476165] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:25,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990128360] [2022-12-14 07:03:25,651 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:03:25,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:25,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:25,652 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:25,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-12-14 07:03:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:25,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 07:03:25,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:26,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:26,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 60 [2022-12-14 07:03:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:26,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:26,322 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-14 07:03:26,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 96 [2022-12-14 07:03:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:26,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990128360] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:26,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [999115367] [2022-12-14 07:03:26,409 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:26,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:26,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-14 07:03:26,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419110601] [2022-12-14 07:03:26,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:26,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:03:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:26,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:03:26,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:03:26,411 INFO L87 Difference]: Start difference. First operand 149 states and 343 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:26,807 INFO L93 Difference]: Finished difference Result 161 states and 363 transitions. [2022-12-14 07:03:26,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 07:03:26,807 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:26,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:26,808 INFO L225 Difference]: With dead ends: 161 [2022-12-14 07:03:26,808 INFO L226 Difference]: Without dead ends: 155 [2022-12-14 07:03:26,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2022-12-14 07:03:26,808 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:26,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:03:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-14 07:03:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2022-12-14 07:03:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.3013698630136985) internal successors, (336), 146 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 336 transitions. [2022-12-14 07:03:26,810 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 336 transitions. Word has length 30 [2022-12-14 07:03:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:26,811 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 336 transitions. [2022-12-14 07:03:26,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 336 transitions. [2022-12-14 07:03:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:26,811 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:26,811 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:26,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2022-12-14 07:03:27,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,92 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:27,011 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:27,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:27,012 INFO L85 PathProgramCache]: Analyzing trace with hash 782814763, now seen corresponding path program 89 times [2022-12-14 07:03:27,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:27,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311687074] [2022-12-14 07:03:27,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:27,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:27,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:27,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311687074] [2022-12-14 07:03:27,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311687074] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:27,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205315224] [2022-12-14 07:03:27,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:03:27,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:27,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:27,674 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:27,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-12-14 07:03:27,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:03:27,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:03:27,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-14 07:03:27,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:28,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:03:28,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:03:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:28,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:28,604 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6608 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6608))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (not (= |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) (= (select .cse0 c_~o_2~0.offset) (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset)))))) is different from false [2022-12-14 07:03:28,665 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:03:28,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-14 07:03:28,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:28,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-14 07:03:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:29,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205315224] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:29,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [848463306] [2022-12-14 07:03:29,164 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:29,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:29,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-14 07:03:29,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535820678] [2022-12-14 07:03:29,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:29,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 07:03:29,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:29,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 07:03:29,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=713, Unknown=1, NotChecked=54, Total=870 [2022-12-14 07:03:29,166 INFO L87 Difference]: Start difference. First operand 147 states and 336 transitions. Second operand has 30 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:33,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:03:35,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:03:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:35,501 INFO L93 Difference]: Finished difference Result 165 states and 374 transitions. [2022-12-14 07:03:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 07:03:35,501 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:35,502 INFO L225 Difference]: With dead ends: 165 [2022-12-14 07:03:35,502 INFO L226 Difference]: Without dead ends: 161 [2022-12-14 07:03:35,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=240, Invalid=1168, Unknown=2, NotChecked=72, Total=1482 [2022-12-14 07:03:35,502 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 11 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:35,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 349 Invalid, 31 Unknown, 29 Unchecked, 3.5s Time] [2022-12-14 07:03:35,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-12-14 07:03:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2022-12-14 07:03:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.287671232876712) internal successors, (334), 146 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 334 transitions. [2022-12-14 07:03:35,504 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 334 transitions. Word has length 30 [2022-12-14 07:03:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:35,504 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 334 transitions. [2022-12-14 07:03:35,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 334 transitions. [2022-12-14 07:03:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:35,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:35,504 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:35,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-12-14 07:03:35,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 93 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2022-12-14 07:03:35,706 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:35,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:35,706 INFO L85 PathProgramCache]: Analyzing trace with hash 579632523, now seen corresponding path program 90 times [2022-12-14 07:03:35,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:35,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060506906] [2022-12-14 07:03:35,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:35,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:36,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:36,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060506906] [2022-12-14 07:03:36,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060506906] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:36,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108770398] [2022-12-14 07:03:36,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:03:36,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:36,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:36,407 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:36,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-12-14 07:03:36,622 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:03:36,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:03:36,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-14 07:03:36,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:36,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:03:36,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:03:36,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:36,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:03:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:37,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:37,248 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6679 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6679))) (let ((.cse1 (select .cse0 ~o_2~0.base))) (or (= (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset) (select .cse1 c_~o_2~0.offset)) (not (= |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))))))) is different from false [2022-12-14 07:03:37,301 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:03:37,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-14 07:03:37,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:37,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-14 07:03:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:37,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108770398] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:37,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [498157436] [2022-12-14 07:03:37,745 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:37,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:37,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 28 [2022-12-14 07:03:37,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993337012] [2022-12-14 07:03:37,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:37,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 07:03:37,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:37,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 07:03:37,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=655, Unknown=1, NotChecked=52, Total=812 [2022-12-14 07:03:37,746 INFO L87 Difference]: Start difference. First operand 147 states and 334 transitions. Second operand has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:38,987 INFO L93 Difference]: Finished difference Result 203 states and 466 transitions. [2022-12-14 07:03:38,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 07:03:38,987 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:38,988 INFO L225 Difference]: With dead ends: 203 [2022-12-14 07:03:38,988 INFO L226 Difference]: Without dead ends: 203 [2022-12-14 07:03:38,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=1159, Unknown=1, NotChecked=72, Total=1482 [2022-12-14 07:03:38,988 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 8 mSolverCounterUnsat, 42 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 42 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:38,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 525 Invalid, 42 Unknown, 58 Unchecked, 0.8s Time] [2022-12-14 07:03:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-12-14 07:03:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 141. [2022-12-14 07:03:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.2785714285714285) internal successors, (319), 140 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 319 transitions. [2022-12-14 07:03:38,990 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 319 transitions. Word has length 30 [2022-12-14 07:03:38,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:38,991 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 319 transitions. [2022-12-14 07:03:38,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 319 transitions. [2022-12-14 07:03:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:38,991 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:38,991 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:38,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2022-12-14 07:03:39,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2022-12-14 07:03:39,192 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:39,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:39,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1533709523, now seen corresponding path program 91 times [2022-12-14 07:03:39,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:39,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024361403] [2022-12-14 07:03:39,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:39,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:39,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:39,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024361403] [2022-12-14 07:03:39,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024361403] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:39,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129418033] [2022-12-14 07:03:39,803 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:03:39,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:39,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:39,804 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:39,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-12-14 07:03:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:40,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-14 07:03:40,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:40,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:03:40,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:03:40,324 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:03:40,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2022-12-14 07:03:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:40,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:40,558 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6750 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6750))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (not (= (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|)) (= (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset) (select .cse0 c_~o_2~0.offset)))))) is different from false [2022-12-14 07:03:40,610 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:03:40,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-14 07:03:40,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:40,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-14 07:03:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:40,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129418033] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:40,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1021973341] [2022-12-14 07:03:40,955 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:40,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:40,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 27 [2022-12-14 07:03:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077887200] [2022-12-14 07:03:40,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:40,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 07:03:40,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:40,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 07:03:40,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=606, Unknown=1, NotChecked=50, Total=756 [2022-12-14 07:03:40,956 INFO L87 Difference]: Start difference. First operand 141 states and 319 transitions. Second operand has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:41,720 INFO L93 Difference]: Finished difference Result 225 states and 518 transitions. [2022-12-14 07:03:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 07:03:41,720 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:41,720 INFO L225 Difference]: With dead ends: 225 [2022-12-14 07:03:41,721 INFO L226 Difference]: Without dead ends: 225 [2022-12-14 07:03:41,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=1104, Unknown=1, NotChecked=70, Total=1406 [2022-12-14 07:03:41,721 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 8 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:41,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 0 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 478 Invalid, 26 Unknown, 35 Unchecked, 0.5s Time] [2022-12-14 07:03:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-12-14 07:03:41,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 143. [2022-12-14 07:03:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.2816901408450705) internal successors, (324), 142 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 324 transitions. [2022-12-14 07:03:41,723 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 324 transitions. Word has length 30 [2022-12-14 07:03:41,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:41,723 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 324 transitions. [2022-12-14 07:03:41,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 324 transitions. [2022-12-14 07:03:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:41,724 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:41,724 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:41,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2022-12-14 07:03:41,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,95 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:41,925 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:41,926 INFO L85 PathProgramCache]: Analyzing trace with hash -856205481, now seen corresponding path program 92 times [2022-12-14 07:03:41,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:41,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306262096] [2022-12-14 07:03:41,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:41,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:42,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:42,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306262096] [2022-12-14 07:03:42,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306262096] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:42,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996117851] [2022-12-14 07:03:42,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:03:42,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:42,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:42,601 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:42,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-12-14 07:03:43,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 07:03:43,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:03:43,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 07:03:43,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:43,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:03:43,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:03:43,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:43,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:03:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:43,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:43,663 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6821 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6821))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (not (= (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|)) (= (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset) (select .cse0 c_~o_2~0.offset)))))) is different from false [2022-12-14 07:03:43,709 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:03:43,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-14 07:03:43,727 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:43,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-14 07:03:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:44,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996117851] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:44,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1457637750] [2022-12-14 07:03:44,017 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:44,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:44,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-14 07:03:44,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991270530] [2022-12-14 07:03:44,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:44,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 07:03:44,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:44,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 07:03:44,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=711, Unknown=1, NotChecked=54, Total=870 [2022-12-14 07:03:44,018 INFO L87 Difference]: Start difference. First operand 143 states and 324 transitions. Second operand has 30 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:48,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:03:49,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:49,219 INFO L93 Difference]: Finished difference Result 261 states and 603 transitions. [2022-12-14 07:03:49,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 07:03:49,219 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:49,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:49,220 INFO L225 Difference]: With dead ends: 261 [2022-12-14 07:03:49,220 INFO L226 Difference]: Without dead ends: 261 [2022-12-14 07:03:49,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=324, Invalid=1568, Unknown=4, NotChecked=84, Total=1980 [2022-12-14 07:03:49,220 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 9 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:49,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 689 Invalid, 15 Unknown, 51 Unchecked, 2.5s Time] [2022-12-14 07:03:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-12-14 07:03:49,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 147. [2022-12-14 07:03:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.3013698630136985) internal successors, (336), 146 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 336 transitions. [2022-12-14 07:03:49,223 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 336 transitions. Word has length 30 [2022-12-14 07:03:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:49,223 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 336 transitions. [2022-12-14 07:03:49,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 336 transitions. [2022-12-14 07:03:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:49,223 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:49,224 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:49,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-12-14 07:03:49,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2022-12-14 07:03:49,425 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:49,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1727567577, now seen corresponding path program 93 times [2022-12-14 07:03:49,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:49,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590821203] [2022-12-14 07:03:49,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:50,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:50,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590821203] [2022-12-14 07:03:50,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590821203] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:50,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434971768] [2022-12-14 07:03:50,127 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:03:50,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:50,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:50,128 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:50,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-12-14 07:03:50,383 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:03:50,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:03:50,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-14 07:03:50,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:50,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:03:50,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:03:50,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:50,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:03:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:50,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:50,920 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6892 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6892))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (not (= (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|)) (= (select .cse0 c_~o_2~0.offset) (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset)))))) is different from false [2022-12-14 07:03:50,960 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:03:50,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-14 07:03:50,976 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:50,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-14 07:03:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:51,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434971768] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:51,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1388472779] [2022-12-14 07:03:51,305 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:51,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:51,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 28 [2022-12-14 07:03:51,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851201640] [2022-12-14 07:03:51,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:51,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 07:03:51,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:51,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 07:03:51,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=657, Unknown=1, NotChecked=52, Total=812 [2022-12-14 07:03:51,306 INFO L87 Difference]: Start difference. First operand 147 states and 336 transitions. Second operand has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:52,700 INFO L93 Difference]: Finished difference Result 226 states and 500 transitions. [2022-12-14 07:03:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 07:03:52,700 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:52,701 INFO L225 Difference]: With dead ends: 226 [2022-12-14 07:03:52,701 INFO L226 Difference]: Without dead ends: 226 [2022-12-14 07:03:52,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=236, Invalid=1326, Unknown=2, NotChecked=76, Total=1640 [2022-12-14 07:03:52,702 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 13 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:52,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 922 Invalid, 39 Unknown, 75 Unchecked, 0.9s Time] [2022-12-14 07:03:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-12-14 07:03:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 145. [2022-12-14 07:03:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.298611111111111) internal successors, (331), 144 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 331 transitions. [2022-12-14 07:03:52,704 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 331 transitions. Word has length 30 [2022-12-14 07:03:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:52,704 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 331 transitions. [2022-12-14 07:03:52,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 331 transitions. [2022-12-14 07:03:52,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:52,704 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:52,704 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:52,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2022-12-14 07:03:52,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2022-12-14 07:03:52,905 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:52,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:52,906 INFO L85 PathProgramCache]: Analyzing trace with hash -314277269, now seen corresponding path program 94 times [2022-12-14 07:03:52,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:52,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793255330] [2022-12-14 07:03:52,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:52,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:53,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:53,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793255330] [2022-12-14 07:03:53,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793255330] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:53,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181211440] [2022-12-14 07:03:53,528 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:03:53,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:53,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:53,529 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:53,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-12-14 07:03:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:53,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 07:03:53,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:53,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:03:53,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:03:53,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:53,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:03:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:54,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:54,271 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6963 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6963))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (not (= (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|)) (= (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset) (select .cse0 c_~o_2~0.offset)))))) is different from false [2022-12-14 07:03:54,316 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:03:54,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-14 07:03:54,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:54,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-14 07:03:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:54,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181211440] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:54,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [503829422] [2022-12-14 07:03:54,686 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:54,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:54,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2022-12-14 07:03:54,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918681003] [2022-12-14 07:03:54,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:54,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 07:03:54,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:54,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 07:03:54,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=653, Unknown=1, NotChecked=52, Total=812 [2022-12-14 07:03:54,687 INFO L87 Difference]: Start difference. First operand 145 states and 331 transitions. Second operand has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:57,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:03:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:03:57,611 INFO L93 Difference]: Finished difference Result 205 states and 469 transitions. [2022-12-14 07:03:57,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 07:03:57,612 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:03:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:03:57,612 INFO L225 Difference]: With dead ends: 205 [2022-12-14 07:03:57,612 INFO L226 Difference]: Without dead ends: 203 [2022-12-14 07:03:57,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=1108, Unknown=1, NotChecked=70, Total=1406 [2022-12-14 07:03:57,612 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 6 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:03:57,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 589 Invalid, 40 Unknown, 54 Unchecked, 2.6s Time] [2022-12-14 07:03:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-12-14 07:03:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 139. [2022-12-14 07:03:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.2753623188405796) internal successors, (314), 138 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 314 transitions. [2022-12-14 07:03:57,614 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 314 transitions. Word has length 30 [2022-12-14 07:03:57,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:03:57,615 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 314 transitions. [2022-12-14 07:03:57,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:03:57,615 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 314 transitions. [2022-12-14 07:03:57,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:03:57,615 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:03:57,615 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:03:57,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2022-12-14 07:03:57,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102,98 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:57,816 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:03:57,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:03:57,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1771459359, now seen corresponding path program 95 times [2022-12-14 07:03:57,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:03:57,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696063828] [2022-12-14 07:03:57,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:03:57,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:03:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:03:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:58,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:03:58,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696063828] [2022-12-14 07:03:58,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696063828] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:03:58,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083887423] [2022-12-14 07:03:58,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:03:58,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:03:58,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:03:58,402 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:03:58,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-12-14 07:03:58,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 07:03:58,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:03:58,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 07:03:58,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:03:58,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:03:58,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:03:59,084 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:03:59,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-14 07:03:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:59,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:03:59,297 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7034 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7034))) (let ((.cse1 (select .cse0 ~o_2~0.base))) (or (= (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset) (select .cse1 c_~o_2~0.offset)) (not (= (select .cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) is different from false [2022-12-14 07:03:59,343 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:03:59,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-14 07:03:59,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:03:59,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-14 07:03:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:03:59,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083887423] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:03:59,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1188407777] [2022-12-14 07:03:59,659 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:03:59,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:03:59,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-12-14 07:03:59,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590339464] [2022-12-14 07:03:59,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:03:59,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 07:03:59,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:03:59,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 07:03:59,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=755, Unknown=1, NotChecked=56, Total=930 [2022-12-14 07:03:59,660 INFO L87 Difference]: Start difference. First operand 139 states and 314 transitions. Second operand has 31 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:03,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:04:05,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:04:07,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:04:10,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:04:11,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:04:13,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:04:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:04:14,292 INFO L93 Difference]: Finished difference Result 253 states and 582 transitions. [2022-12-14 07:04:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 07:04:14,293 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:04:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:04:14,293 INFO L225 Difference]: With dead ends: 253 [2022-12-14 07:04:14,293 INFO L226 Difference]: Without dead ends: 253 [2022-12-14 07:04:14,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=386, Invalid=1779, Unknown=1, NotChecked=90, Total=2256 [2022-12-14 07:04:14,294 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 9 mSolverCounterUnsat, 64 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 64 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:04:14,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 859 Invalid, 64 Unknown, 53 Unchecked, 12.0s Time] [2022-12-14 07:04:14,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-12-14 07:04:14,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 142. [2022-12-14 07:04:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.276595744680851) internal successors, (321), 141 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 321 transitions. [2022-12-14 07:04:14,296 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 321 transitions. Word has length 30 [2022-12-14 07:04:14,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:04:14,296 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 321 transitions. [2022-12-14 07:04:14,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 321 transitions. [2022-12-14 07:04:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:04:14,296 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:04:14,296 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:04:14,302 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2022-12-14 07:04:14,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-12-14 07:04:14,498 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:04:14,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:04:14,498 INFO L85 PathProgramCache]: Analyzing trace with hash 220911249, now seen corresponding path program 96 times [2022-12-14 07:04:14,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:04:14,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684996859] [2022-12-14 07:04:14,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:04:14,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:04:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:15,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:04:15,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684996859] [2022-12-14 07:04:15,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684996859] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:04:15,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153780616] [2022-12-14 07:04:15,238 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:04:15,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:15,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:04:15,239 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:04:15,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-12-14 07:04:15,486 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:04:15,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:04:15,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-14 07:04:15,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:04:15,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:04:15,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:04:15,744 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:04:15,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2022-12-14 07:04:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:15,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:04:15,937 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7105 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7105))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (= (select .cse0 c_~o_2~0.offset) (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset)) (not (= (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) is different from false [2022-12-14 07:04:15,984 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:04:15,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-14 07:04:16,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:16,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-14 07:04:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:16,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153780616] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:04:16,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2116081679] [2022-12-14 07:04:16,380 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:04:16,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:04:16,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2022-12-14 07:04:16,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895107084] [2022-12-14 07:04:16,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:04:16,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 07:04:16,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:04:16,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 07:04:16,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=651, Unknown=1, NotChecked=52, Total=812 [2022-12-14 07:04:16,381 INFO L87 Difference]: Start difference. First operand 142 states and 321 transitions. Second operand has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:04:17,508 INFO L93 Difference]: Finished difference Result 251 states and 581 transitions. [2022-12-14 07:04:17,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 07:04:17,509 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:04:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:04:17,509 INFO L225 Difference]: With dead ends: 251 [2022-12-14 07:04:17,509 INFO L226 Difference]: Without dead ends: 251 [2022-12-14 07:04:17,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=1124, Unknown=1, NotChecked=70, Total=1406 [2022-12-14 07:04:17,510 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 10 mSolverCounterUnsat, 45 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 45 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:04:17,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 830 Invalid, 45 Unknown, 70 Unchecked, 0.8s Time] [2022-12-14 07:04:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-12-14 07:04:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 144. [2022-12-14 07:04:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 2.2797202797202796) internal successors, (326), 143 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 326 transitions. [2022-12-14 07:04:17,512 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 326 transitions. Word has length 30 [2022-12-14 07:04:17,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:04:17,512 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 326 transitions. [2022-12-14 07:04:17,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 326 transitions. [2022-12-14 07:04:17,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:04:17,513 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:04:17,513 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:04:17,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2022-12-14 07:04:17,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104 [2022-12-14 07:04:17,713 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:04:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:04:17,714 INFO L85 PathProgramCache]: Analyzing trace with hash 898415291, now seen corresponding path program 97 times [2022-12-14 07:04:17,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:04:17,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837991368] [2022-12-14 07:04:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:04:17,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:04:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:18,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:04:18,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837991368] [2022-12-14 07:04:18,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837991368] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:04:18,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115558676] [2022-12-14 07:04:18,314 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:04:18,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:18,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:04:18,315 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:04:18,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-12-14 07:04:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:18,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-14 07:04:18,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:04:18,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:04:18,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:04:18,832 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:18,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:04:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:18,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:04:19,101 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7176 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7176))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (not (= |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) (= (select .cse0 c_~o_2~0.offset) (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset)))))) is different from false [2022-12-14 07:04:19,147 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:04:19,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-14 07:04:19,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:19,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-14 07:04:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:19,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115558676] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:04:19,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1224281792] [2022-12-14 07:04:19,358 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:04:19,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:04:19,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 29 [2022-12-14 07:04:19,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732240750] [2022-12-14 07:04:19,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:04:19,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 07:04:19,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:04:19,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 07:04:19,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=706, Unknown=1, NotChecked=54, Total=870 [2022-12-14 07:04:19,360 INFO L87 Difference]: Start difference. First operand 144 states and 326 transitions. Second operand has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:04:20,562 INFO L93 Difference]: Finished difference Result 267 states and 595 transitions. [2022-12-14 07:04:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 07:04:20,562 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:04:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:04:20,563 INFO L225 Difference]: With dead ends: 267 [2022-12-14 07:04:20,563 INFO L226 Difference]: Without dead ends: 267 [2022-12-14 07:04:20,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=265, Invalid=1460, Unknown=1, NotChecked=80, Total=1806 [2022-12-14 07:04:20,563 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 17 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:04:20,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 675 Invalid, 13 Unknown, 36 Unchecked, 0.6s Time] [2022-12-14 07:04:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-12-14 07:04:20,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 146. [2022-12-14 07:04:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.296551724137931) internal successors, (333), 145 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 333 transitions. [2022-12-14 07:04:20,566 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 333 transitions. Word has length 30 [2022-12-14 07:04:20,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:04:20,566 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 333 transitions. [2022-12-14 07:04:20,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 333 transitions. [2022-12-14 07:04:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:04:20,566 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:04:20,566 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:04:20,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2022-12-14 07:04:20,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 101 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2022-12-14 07:04:20,767 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:04:20,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:04:20,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1440343503, now seen corresponding path program 98 times [2022-12-14 07:04:20,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:04:20,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678385127] [2022-12-14 07:04:20,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:04:20,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:04:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:21,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:04:21,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678385127] [2022-12-14 07:04:21,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678385127] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:04:21,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169957529] [2022-12-14 07:04:21,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:04:21,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:21,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:04:21,387 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:04:21,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-12-14 07:04:21,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 07:04:21,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:04:21,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 07:04:21,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:04:21,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:04:21,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:04:22,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:22,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2022-12-14 07:04:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:22,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:04:22,281 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7247 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7247))) (let ((.cse1 (select .cse0 ~o_2~0.base))) (or (= (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset) (select .cse1 c_~o_2~0.offset)) (not (= (select .cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) is different from false [2022-12-14 07:04:22,330 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:04:22,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-14 07:04:22,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:22,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-14 07:04:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:22,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169957529] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:04:22,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1259498945] [2022-12-14 07:04:22,756 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:04:22,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:04:22,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 29 [2022-12-14 07:04:22,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110947656] [2022-12-14 07:04:22,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:04:22,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 07:04:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:04:22,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 07:04:22,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=700, Unknown=1, NotChecked=54, Total=870 [2022-12-14 07:04:22,757 INFO L87 Difference]: Start difference. First operand 146 states and 333 transitions. Second operand has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:25,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:04:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:04:25,630 INFO L93 Difference]: Finished difference Result 185 states and 425 transitions. [2022-12-14 07:04:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 07:04:25,630 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:04:25,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:04:25,630 INFO L225 Difference]: With dead ends: 185 [2022-12-14 07:04:25,630 INFO L226 Difference]: Without dead ends: 183 [2022-12-14 07:04:25,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=1232, Unknown=1, NotChecked=74, Total=1560 [2022-12-14 07:04:25,631 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 8 mSolverCounterUnsat, 60 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 60 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:04:25,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 660 Invalid, 60 Unknown, 52 Unchecked, 2.5s Time] [2022-12-14 07:04:25,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-12-14 07:04:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 136. [2022-12-14 07:04:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.274074074074074) internal successors, (307), 135 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 307 transitions. [2022-12-14 07:04:25,633 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 307 transitions. Word has length 30 [2022-12-14 07:04:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:04:25,633 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 307 transitions. [2022-12-14 07:04:25,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 307 transitions. [2022-12-14 07:04:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:04:25,633 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:04:25,633 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:04:25,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0 [2022-12-14 07:04:25,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,102 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:25,834 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:04:25,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:04:25,835 INFO L85 PathProgramCache]: Analyzing trace with hash -189995413, now seen corresponding path program 99 times [2022-12-14 07:04:25,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:04:25,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685447054] [2022-12-14 07:04:25,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:04:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:04:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:26,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:04:26,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685447054] [2022-12-14 07:04:26,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685447054] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:04:26,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834628453] [2022-12-14 07:04:26,547 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:04:26,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:26,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:04:26,548 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:04:26,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-12-14 07:04:26,770 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:04:26,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:04:26,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-14 07:04:26,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:04:27,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:04:27,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:04:27,068 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:04:27,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2022-12-14 07:04:27,121 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:04:27,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2022-12-14 07:04:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:27,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:04:27,397 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:04:27,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 111 [2022-12-14 07:04:27,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:27,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-12-14 07:04:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:27,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834628453] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:04:27,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [948920218] [2022-12-14 07:04:27,588 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:04:27,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:04:27,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-14 07:04:27,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317212746] [2022-12-14 07:04:27,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:04:27,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 07:04:27,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:04:27,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 07:04:27,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=748, Unknown=3, NotChecked=0, Total=870 [2022-12-14 07:04:27,589 INFO L87 Difference]: Start difference. First operand 136 states and 307 transitions. Second operand has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:28,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:04:28,415 INFO L93 Difference]: Finished difference Result 193 states and 442 transitions. [2022-12-14 07:04:28,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 07:04:28,415 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:04:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:04:28,416 INFO L225 Difference]: With dead ends: 193 [2022-12-14 07:04:28,416 INFO L226 Difference]: Without dead ends: 193 [2022-12-14 07:04:28,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=362, Invalid=1357, Unknown=3, NotChecked=0, Total=1722 [2022-12-14 07:04:28,416 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 223 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:04:28,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 0 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:04:28,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-12-14 07:04:28,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 125. [2022-12-14 07:04:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.274193548387097) internal successors, (282), 124 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 282 transitions. [2022-12-14 07:04:28,418 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 282 transitions. Word has length 30 [2022-12-14 07:04:28,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:04:28,418 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 282 transitions. [2022-12-14 07:04:28,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 282 transitions. [2022-12-14 07:04:28,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:04:28,418 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:04:28,419 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:04:28,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2022-12-14 07:04:28,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2022-12-14 07:04:28,620 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:04:28,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:04:28,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1259738355, now seen corresponding path program 100 times [2022-12-14 07:04:28,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:04:28,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230276042] [2022-12-14 07:04:28,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:04:28,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:04:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:29,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:04:29,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230276042] [2022-12-14 07:04:29,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230276042] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:04:29,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868424589] [2022-12-14 07:04:29,262 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:04:29,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:29,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:04:29,263 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:04:29,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-12-14 07:04:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:29,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-14 07:04:29,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:04:29,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:04:29,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:04:29,812 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:04:29,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2022-12-14 07:04:29,952 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:04:29,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-14 07:04:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:29,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:04:30,242 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:04:30,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 111 [2022-12-14 07:04:30,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:30,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-12-14 07:04:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:30,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868424589] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:04:30,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [543023017] [2022-12-14 07:04:30,529 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:04:30,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:04:30,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 07:04:30,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145369010] [2022-12-14 07:04:30,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:04:30,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 07:04:30,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:04:30,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 07:04:30,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=866, Unknown=2, NotChecked=0, Total=992 [2022-12-14 07:04:30,530 INFO L87 Difference]: Start difference. First operand 125 states and 282 transitions. Second operand has 32 states, 32 states have (on average 1.625) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:04:32,657 INFO L93 Difference]: Finished difference Result 219 states and 502 transitions. [2022-12-14 07:04:32,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 07:04:32,657 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:04:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:04:32,658 INFO L225 Difference]: With dead ends: 219 [2022-12-14 07:04:32,658 INFO L226 Difference]: Without dead ends: 219 [2022-12-14 07:04:32,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=505, Invalid=1943, Unknown=2, NotChecked=0, Total=2450 [2022-12-14 07:04:32,658 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:04:32,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 0 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 07:04:32,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-14 07:04:32,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 127. [2022-12-14 07:04:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.2777777777777777) internal successors, (287), 126 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:32,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 287 transitions. [2022-12-14 07:04:32,660 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 287 transitions. Word has length 30 [2022-12-14 07:04:32,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:04:32,660 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 287 transitions. [2022-12-14 07:04:32,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:32,661 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 287 transitions. [2022-12-14 07:04:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:04:32,661 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:04:32,661 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:04:32,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Ended with exit code 0 [2022-12-14 07:04:32,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,104 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:32,863 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:04:32,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:04:32,863 INFO L85 PathProgramCache]: Analyzing trace with hash 787527177, now seen corresponding path program 101 times [2022-12-14 07:04:32,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:04:32,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660148347] [2022-12-14 07:04:32,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:04:32,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:04:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:33,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:04:33,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660148347] [2022-12-14 07:04:33,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660148347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:04:33,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582310694] [2022-12-14 07:04:33,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:04:33,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:33,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:04:33,701 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:04:33,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-12-14 07:04:34,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 07:04:34,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:04:34,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 07:04:34,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:04:34,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:04:34,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:04:34,516 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:04:34,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2022-12-14 07:04:34,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:34,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:04:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:34,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:04:35,135 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:04:35,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 111 [2022-12-14 07:04:35,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:35,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-12-14 07:04:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:35,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582310694] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:04:35,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1664653384] [2022-12-14 07:04:35,418 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:04:35,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:04:35,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-12-14 07:04:35,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674039562] [2022-12-14 07:04:35,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:04:35,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:04:35,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:04:35,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:04:35,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=935, Unknown=2, NotChecked=0, Total=1056 [2022-12-14 07:04:35,419 INFO L87 Difference]: Start difference. First operand 127 states and 287 transitions. Second operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:04:38,533 INFO L93 Difference]: Finished difference Result 201 states and 451 transitions. [2022-12-14 07:04:38,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 07:04:38,533 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:04:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:04:38,534 INFO L225 Difference]: With dead ends: 201 [2022-12-14 07:04:38,534 INFO L226 Difference]: Without dead ends: 201 [2022-12-14 07:04:38,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=614, Invalid=2354, Unknown=2, NotChecked=0, Total=2970 [2022-12-14 07:04:38,534 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 262 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 07:04:38,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 0 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 07:04:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-14 07:04:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 129. [2022-12-14 07:04:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.296875) internal successors, (294), 128 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 294 transitions. [2022-12-14 07:04:38,536 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 294 transitions. Word has length 30 [2022-12-14 07:04:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:04:38,536 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 294 transitions. [2022-12-14 07:04:38,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 294 transitions. [2022-12-14 07:04:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 07:04:38,537 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:04:38,537 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:04:38,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Forceful destruction successful, exit code 0 [2022-12-14 07:04:38,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,105 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:38,738 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:04:38,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:04:38,738 INFO L85 PathProgramCache]: Analyzing trace with hash 407432565, now seen corresponding path program 102 times [2022-12-14 07:04:38,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:04:38,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530684246] [2022-12-14 07:04:38,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:04:38,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:04:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:39,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:04:39,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530684246] [2022-12-14 07:04:39,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530684246] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:04:39,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43548843] [2022-12-14 07:04:39,507 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:04:39,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:39,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:04:39,508 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:04:39,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-12-14 07:04:39,786 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:04:39,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:04:39,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-14 07:04:39,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:04:40,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:04:40,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:04:40,055 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:04:40,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2022-12-14 07:04:40,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:40,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-14 07:04:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:40,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:04:40,534 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 07:04:40,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 111 [2022-12-14 07:04:40,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:40,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-12-14 07:04:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:40,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43548843] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:04:40,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [509757627] [2022-12-14 07:04:40,839 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:04:40,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:04:40,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 07:04:40,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752753801] [2022-12-14 07:04:40,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:04:40,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 07:04:40,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:04:40,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 07:04:40,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=859, Unknown=1, NotChecked=0, Total=992 [2022-12-14 07:04:40,840 INFO L87 Difference]: Start difference. First operand 129 states and 294 transitions. Second operand has 32 states, 32 states have (on average 1.625) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:04:42,781 INFO L93 Difference]: Finished difference Result 173 states and 395 transitions. [2022-12-14 07:04:42,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 07:04:42,782 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 07:04:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:04:42,782 INFO L225 Difference]: With dead ends: 173 [2022-12-14 07:04:42,782 INFO L226 Difference]: Without dead ends: 171 [2022-12-14 07:04:42,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=507, Invalid=1942, Unknown=1, NotChecked=0, Total=2450 [2022-12-14 07:04:42,782 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 263 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:04:42,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 0 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 07:04:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-12-14 07:04:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 122. [2022-12-14 07:04:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.272727272727273) internal successors, (275), 121 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 275 transitions. [2022-12-14 07:04:42,784 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 275 transitions. Word has length 30 [2022-12-14 07:04:42,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:04:42,784 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 275 transitions. [2022-12-14 07:04:42,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:42,784 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 275 transitions. [2022-12-14 07:04:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:04:42,785 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:04:42,785 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:04:42,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2022-12-14 07:04:42,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable110 [2022-12-14 07:04:42,986 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:04:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:04:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash -115418736, now seen corresponding path program 103 times [2022-12-14 07:04:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:04:42,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394713616] [2022-12-14 07:04:42,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:04:42,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:04:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:43,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:04:43,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394713616] [2022-12-14 07:04:43,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394713616] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:04:43,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402288390] [2022-12-14 07:04:43,674 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:04:43,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:43,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:04:43,675 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:04:43,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-12-14 07:04:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:43,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:04:43,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:04:44,115 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:44,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:04:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:44,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:04:44,695 INFO L321 Elim1Store]: treesize reduction 30, result has 61.0 percent of original size [2022-12-14 07:04:44,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 77 [2022-12-14 07:04:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:44,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402288390] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:04:44,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1332540071] [2022-12-14 07:04:44,756 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:04:44,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:04:44,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:04:44,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220878492] [2022-12-14 07:04:44,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:04:44,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:04:44,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:04:44,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:04:44,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:04:44,757 INFO L87 Difference]: Start difference. First operand 122 states and 275 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:04:46,049 INFO L93 Difference]: Finished difference Result 209 states and 477 transitions. [2022-12-14 07:04:46,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 07:04:46,049 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:04:46,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:04:46,049 INFO L225 Difference]: With dead ends: 209 [2022-12-14 07:04:46,049 INFO L226 Difference]: Without dead ends: 204 [2022-12-14 07:04:46,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=373, Invalid=1979, Unknown=0, NotChecked=0, Total=2352 [2022-12-14 07:04:46,050 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 203 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:04:46,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 0 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 07:04:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-12-14 07:04:46,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 138. [2022-12-14 07:04:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.3284671532846715) internal successors, (319), 137 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 319 transitions. [2022-12-14 07:04:46,052 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 319 transitions. Word has length 31 [2022-12-14 07:04:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:04:46,052 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 319 transitions. [2022-12-14 07:04:46,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 319 transitions. [2022-12-14 07:04:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:04:46,052 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:04:46,052 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:04:46,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2022-12-14 07:04:46,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 107 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-12-14 07:04:46,253 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:04:46,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:04:46,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1496571120, now seen corresponding path program 104 times [2022-12-14 07:04:46,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:04:46,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561469883] [2022-12-14 07:04:46,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:04:46,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:04:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:46,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:04:46,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561469883] [2022-12-14 07:04:46,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561469883] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:04:46,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174777655] [2022-12-14 07:04:46,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:04:46,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:46,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:04:46,921 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:04:46,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-12-14 07:04:47,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:04:47,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:04:47,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:04:47,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:04:47,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:47,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:04:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:47,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:04:47,965 INFO L321 Elim1Store]: treesize reduction 15, result has 83.5 percent of original size [2022-12-14 07:04:47,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 193 treesize of output 117 [2022-12-14 07:04:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:48,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174777655] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:04:48,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [985159866] [2022-12-14 07:04:48,068 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:04:48,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:04:48,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:04:48,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783372342] [2022-12-14 07:04:48,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:04:48,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:04:48,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:04:48,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:04:48,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:04:48,069 INFO L87 Difference]: Start difference. First operand 138 states and 319 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:04:49,129 INFO L93 Difference]: Finished difference Result 201 states and 467 transitions. [2022-12-14 07:04:49,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 07:04:49,129 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:04:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:04:49,130 INFO L225 Difference]: With dead ends: 201 [2022-12-14 07:04:49,130 INFO L226 Difference]: Without dead ends: 196 [2022-12-14 07:04:49,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=301, Invalid=1955, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 07:04:49,130 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:04:49,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 07:04:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-12-14 07:04:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 146. [2022-12-14 07:04:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.3655172413793104) internal successors, (343), 145 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 343 transitions. [2022-12-14 07:04:49,132 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 343 transitions. Word has length 31 [2022-12-14 07:04:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:04:49,132 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 343 transitions. [2022-12-14 07:04:49,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 343 transitions. [2022-12-14 07:04:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:04:49,133 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:04:49,133 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:04:49,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Ended with exit code 0 [2022-12-14 07:04:49,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2022-12-14 07:04:49,334 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:04:49,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:04:49,335 INFO L85 PathProgramCache]: Analyzing trace with hash -828391264, now seen corresponding path program 105 times [2022-12-14 07:04:49,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:04:49,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746846752] [2022-12-14 07:04:49,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:04:49,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:04:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:50,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:04:50,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746846752] [2022-12-14 07:04:50,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746846752] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:04:50,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582942031] [2022-12-14 07:04:50,005 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:04:50,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:50,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:04:50,006 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:04:50,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-12-14 07:04:50,288 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:04:50,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:04:50,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:04:50,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:04:50,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:50,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:04:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:50,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:04:51,110 INFO L321 Elim1Store]: treesize reduction 15, result has 83.5 percent of original size [2022-12-14 07:04:51,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 113 [2022-12-14 07:04:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:51,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582942031] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:04:51,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1591641936] [2022-12-14 07:04:51,252 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:04:51,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:04:51,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:04:51,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031061983] [2022-12-14 07:04:51,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:04:51,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:04:51,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:04:51,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:04:51,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:04:51,254 INFO L87 Difference]: Start difference. First operand 146 states and 343 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:04:52,106 INFO L93 Difference]: Finished difference Result 207 states and 476 transitions. [2022-12-14 07:04:52,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 07:04:52,106 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:04:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:04:52,107 INFO L225 Difference]: With dead ends: 207 [2022-12-14 07:04:52,107 INFO L226 Difference]: Without dead ends: 202 [2022-12-14 07:04:52,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=257, Invalid=1723, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 07:04:52,107 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:04:52,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:04:52,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-12-14 07:04:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 150. [2022-12-14 07:04:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.3959731543624163) internal successors, (357), 149 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 357 transitions. [2022-12-14 07:04:52,109 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 357 transitions. Word has length 31 [2022-12-14 07:04:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:04:52,110 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 357 transitions. [2022-12-14 07:04:52,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 357 transitions. [2022-12-14 07:04:52,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:04:52,110 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:04:52,110 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:04:52,116 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Ended with exit code 0 [2022-12-14 07:04:52,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 109 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2022-12-14 07:04:52,311 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:04:52,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:04:52,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1699753360, now seen corresponding path program 106 times [2022-12-14 07:04:52,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:04:52,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786732365] [2022-12-14 07:04:52,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:04:52,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:04:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 07:04:53,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:04:53,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786732365] [2022-12-14 07:04:53,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786732365] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:04:53,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162752414] [2022-12-14 07:04:53,403 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:04:53,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:53,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:04:53,403 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:04:53,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-12-14 07:04:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:53,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 07:04:53,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:04:54,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:04:54,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:04:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-14 07:04:54,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:04:54,779 INFO L321 Elim1Store]: treesize reduction 15, result has 83.5 percent of original size [2022-12-14 07:04:54,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 113 [2022-12-14 07:04:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:54,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162752414] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:04:54,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [698764130] [2022-12-14 07:04:54,938 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:04:54,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:04:54,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 10] total 41 [2022-12-14 07:04:54,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588647269] [2022-12-14 07:04:54,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:04:54,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 07:04:54,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:04:54,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 07:04:54,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1554, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 07:04:54,939 INFO L87 Difference]: Start difference. First operand 150 states and 357 transitions. Second operand has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 42 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-12-14 07:04:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:04:57,031 INFO L93 Difference]: Finished difference Result 203 states and 470 transitions. [2022-12-14 07:04:57,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 07:04:57,031 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 42 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 31 [2022-12-14 07:04:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:04:57,032 INFO L225 Difference]: With dead ends: 203 [2022-12-14 07:04:57,032 INFO L226 Difference]: Without dead ends: 198 [2022-12-14 07:04:57,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=467, Invalid=2955, Unknown=0, NotChecked=0, Total=3422 [2022-12-14 07:04:57,032 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 272 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:04:57,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 0 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 07:04:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-12-14 07:04:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 142. [2022-12-14 07:04:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.3333333333333335) internal successors, (329), 141 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:04:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 329 transitions. [2022-12-14 07:04:57,034 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 329 transitions. Word has length 31 [2022-12-14 07:04:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:04:57,034 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 329 transitions. [2022-12-14 07:04:57,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 42 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-12-14 07:04:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 329 transitions. [2022-12-14 07:04:57,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:04:57,035 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:04:57,035 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:04:57,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2022-12-14 07:04:57,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2022-12-14 07:04:57,236 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:04:57,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:04:57,237 INFO L85 PathProgramCache]: Analyzing trace with hash 481871890, now seen corresponding path program 107 times [2022-12-14 07:04:57,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:04:57,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655512885] [2022-12-14 07:04:57,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:04:57,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:04:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:04:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:57,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:04:57,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655512885] [2022-12-14 07:04:57,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655512885] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:04:57,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291504308] [2022-12-14 07:04:57,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:04:57,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:04:57,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:04:57,957 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:04:57,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-12-14 07:04:58,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:04:58,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:04:58,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 07:04:58,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:04:58,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:04:58,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:04:58,471 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-14 07:04:58,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 25 [2022-12-14 07:04:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:58,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:04:59,123 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:04:59,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-14 07:04:59,159 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 07:04:59,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 07:04:59,168 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 07:04:59,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 07:04:59,173 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 07:04:59,179 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 07:04:59,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 07:04:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:04:59,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291504308] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:04:59,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [579137039] [2022-12-14 07:04:59,267 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:04:59,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:04:59,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 28 [2022-12-14 07:04:59,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015590299] [2022-12-14 07:04:59,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:04:59,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 07:04:59,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:04:59,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 07:04:59,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-12-14 07:04:59,268 INFO L87 Difference]: Start difference. First operand 142 states and 329 transitions. Second operand has 29 states, 28 states have (on average 2.0) internal successors, (56), 29 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:01,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:01,339 INFO L93 Difference]: Finished difference Result 294 states and 672 transitions. [2022-12-14 07:05:01,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 07:05:01,340 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0) internal successors, (56), 29 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:05:01,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:01,340 INFO L225 Difference]: With dead ends: 294 [2022-12-14 07:05:01,340 INFO L226 Difference]: Without dead ends: 270 [2022-12-14 07:05:01,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=445, Invalid=2525, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 07:05:01,341 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:01,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 07:05:01,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-12-14 07:05:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 174. [2022-12-14 07:05:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 2.5260115606936417) internal successors, (437), 173 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 437 transitions. [2022-12-14 07:05:01,343 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 437 transitions. Word has length 31 [2022-12-14 07:05:01,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:01,343 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 437 transitions. [2022-12-14 07:05:01,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0) internal successors, (56), 29 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:01,344 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 437 transitions. [2022-12-14 07:05:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:05:01,344 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:01,344 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:05:01,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2022-12-14 07:05:01,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2022-12-14 07:05:01,545 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:05:01,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:01,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2081669488, now seen corresponding path program 108 times [2022-12-14 07:05:01,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:01,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713324279] [2022-12-14 07:05:01,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:01,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:02,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:02,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713324279] [2022-12-14 07:05:02,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713324279] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:05:02,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89818954] [2022-12-14 07:05:02,253 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:05:02,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:05:02,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:05:02,254 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:05:02,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-12-14 07:05:02,526 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:05:02,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:05:02,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:05:02,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:05:02,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:05:02,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:05:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:02,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:05:41,361 WARN L233 SmtUtils]: Spent 38.14s on a formula simplification. DAG size of input: 44 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:05:41,410 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:05:41,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-14 07:05:41,440 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 07:05:41,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 07:05:41,449 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 07:05:41,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 07:05:41,457 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 07:05:41,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 07:05:41,459 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 07:05:41,466 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 07:05:41,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 07:05:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:41,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89818954] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:05:41,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [396732124] [2022-12-14 07:05:41,558 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:05:41,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:05:41,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:05:41,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360998043] [2022-12-14 07:05:41,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:05:41,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:05:41,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:41,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:05:41,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:05:41,559 INFO L87 Difference]: Start difference. First operand 174 states and 437 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:44,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:05:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:45,073 INFO L93 Difference]: Finished difference Result 313 states and 746 transitions. [2022-12-14 07:05:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 07:05:45,074 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:05:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:45,074 INFO L225 Difference]: With dead ends: 313 [2022-12-14 07:05:45,074 INFO L226 Difference]: Without dead ends: 298 [2022-12-14 07:05:45,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=476, Invalid=2830, Unknown=0, NotChecked=0, Total=3306 [2022-12-14 07:05:45,075 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 245 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:45,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 0 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1528 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-12-14 07:05:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-12-14 07:05:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 188. [2022-12-14 07:05:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 2.6042780748663104) internal successors, (487), 187 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 487 transitions. [2022-12-14 07:05:45,078 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 487 transitions. Word has length 31 [2022-12-14 07:05:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:45,078 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 487 transitions. [2022-12-14 07:05:45,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 487 transitions. [2022-12-14 07:05:45,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:05:45,079 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:45,079 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:05:45,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2022-12-14 07:05:45,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116 [2022-12-14 07:05:45,279 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:05:45,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1159375932, now seen corresponding path program 109 times [2022-12-14 07:05:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:45,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799864444] [2022-12-14 07:05:45,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:46,149 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:46,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:46,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799864444] [2022-12-14 07:05:46,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799864444] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:05:46,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013654242] [2022-12-14 07:05:46,150 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:05:46,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:05:46,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:05:46,151 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:05:46,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-12-14 07:05:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:46,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:05:46,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:05:46,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:05:46,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:05:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:46,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:05:47,127 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-14 07:05:47,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 107 [2022-12-14 07:05:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:47,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013654242] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:05:47,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [744469492] [2022-12-14 07:05:47,289 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:05:47,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:05:47,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:05:47,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723849276] [2022-12-14 07:05:47,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:05:47,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:05:47,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:47,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:05:47,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:05:47,290 INFO L87 Difference]: Start difference. First operand 188 states and 487 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:49,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:49,254 INFO L93 Difference]: Finished difference Result 356 states and 845 transitions. [2022-12-14 07:05:49,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 07:05:49,254 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:05:49,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:49,254 INFO L225 Difference]: With dead ends: 356 [2022-12-14 07:05:49,255 INFO L226 Difference]: Without dead ends: 332 [2022-12-14 07:05:49,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=451, Invalid=2741, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 07:05:49,255 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:49,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 07:05:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-12-14 07:05:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 202. [2022-12-14 07:05:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 2.6865671641791047) internal successors, (540), 201 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 540 transitions. [2022-12-14 07:05:49,258 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 540 transitions. Word has length 31 [2022-12-14 07:05:49,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:49,258 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 540 transitions. [2022-12-14 07:05:49,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 540 transitions. [2022-12-14 07:05:49,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:05:49,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:49,259 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:05:49,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2022-12-14 07:05:49,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,113 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:05:49,460 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:05:49,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:49,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1774128286, now seen corresponding path program 110 times [2022-12-14 07:05:49,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:49,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026310530] [2022-12-14 07:05:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:49,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:50,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:50,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026310530] [2022-12-14 07:05:50,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026310530] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:05:50,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209474433] [2022-12-14 07:05:50,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:05:50,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:05:50,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:05:50,152 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:05:50,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2022-12-14 07:05:50,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:05:50,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:05:50,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:05:50,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:05:50,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:05:50,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:05:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:50,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:05:51,184 INFO L321 Elim1Store]: treesize reduction 15, result has 83.5 percent of original size [2022-12-14 07:05:51,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 193 treesize of output 117 [2022-12-14 07:05:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:51,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209474433] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:05:51,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1164929205] [2022-12-14 07:05:51,324 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:05:51,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:05:51,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:05:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205752213] [2022-12-14 07:05:51,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:05:51,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:05:51,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:51,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:05:51,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:05:51,325 INFO L87 Difference]: Start difference. First operand 202 states and 540 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:53,350 INFO L93 Difference]: Finished difference Result 312 states and 799 transitions. [2022-12-14 07:05:53,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 07:05:53,350 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:05:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:53,351 INFO L225 Difference]: With dead ends: 312 [2022-12-14 07:05:53,351 INFO L226 Difference]: Without dead ends: 302 [2022-12-14 07:05:53,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=414, Invalid=2778, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 07:05:53,351 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:53,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 07:05:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-12-14 07:05:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 224. [2022-12-14 07:05:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 2.695067264573991) internal successors, (601), 223 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 601 transitions. [2022-12-14 07:05:53,354 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 601 transitions. Word has length 31 [2022-12-14 07:05:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:53,354 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 601 transitions. [2022-12-14 07:05:53,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:53,355 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 601 transitions. [2022-12-14 07:05:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:05:53,355 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:53,355 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:05:53,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2022-12-14 07:05:53,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 114 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2022-12-14 07:05:53,556 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:05:53,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:53,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1852659154, now seen corresponding path program 111 times [2022-12-14 07:05:53,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:53,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387671705] [2022-12-14 07:05:53,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:53,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:54,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:54,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387671705] [2022-12-14 07:05:54,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387671705] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:05:54,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556904102] [2022-12-14 07:05:54,142 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:05:54,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:05:54,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:05:54,143 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:05:54,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-12-14 07:05:54,415 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:05:54,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:05:54,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:05:54,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:05:54,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:05:54,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:05:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:54,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:05:55,274 INFO L321 Elim1Store]: treesize reduction 15, result has 83.5 percent of original size [2022-12-14 07:05:55,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 113 [2022-12-14 07:05:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:55,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556904102] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:05:55,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [191292940] [2022-12-14 07:05:55,410 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:05:55,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:05:55,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:05:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996689562] [2022-12-14 07:05:55,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:05:55,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:05:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:55,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:05:55,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:05:55,411 INFO L87 Difference]: Start difference. First operand 224 states and 601 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:57,154 INFO L93 Difference]: Finished difference Result 322 states and 816 transitions. [2022-12-14 07:05:57,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 07:05:57,155 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:05:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:57,156 INFO L225 Difference]: With dead ends: 322 [2022-12-14 07:05:57,156 INFO L226 Difference]: Without dead ends: 312 [2022-12-14 07:05:57,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=369, Invalid=2493, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 07:05:57,156 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:57,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 0 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 07:05:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-12-14 07:05:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 226. [2022-12-14 07:05:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 2.7022222222222223) internal successors, (608), 225 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 608 transitions. [2022-12-14 07:05:57,161 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 608 transitions. Word has length 31 [2022-12-14 07:05:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:57,161 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 608 transitions. [2022-12-14 07:05:57,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 608 transitions. [2022-12-14 07:05:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:05:57,161 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:57,161 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:05:57,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2022-12-14 07:05:57,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,115 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:05:57,363 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:05:57,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:57,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1570946046, now seen corresponding path program 112 times [2022-12-14 07:05:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:57,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042646677] [2022-12-14 07:05:57,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:57,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:58,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:58,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042646677] [2022-12-14 07:05:58,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042646677] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:05:58,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954205671] [2022-12-14 07:05:58,198 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:05:58,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:05:58,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:05:58,199 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:05:58,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2022-12-14 07:05:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:58,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:05:58,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:05:58,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:05:58,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:05:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:58,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:05:59,410 INFO L321 Elim1Store]: treesize reduction 15, result has 83.5 percent of original size [2022-12-14 07:05:59,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 113 [2022-12-14 07:05:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:05:59,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954205671] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:05:59,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [917522151] [2022-12-14 07:05:59,528 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:05:59,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:05:59,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:05:59,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050412508] [2022-12-14 07:05:59,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:05:59,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:05:59,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:59,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:05:59,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:05:59,529 INFO L87 Difference]: Start difference. First operand 226 states and 608 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:06:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:06:01,541 INFO L93 Difference]: Finished difference Result 316 states and 799 transitions. [2022-12-14 07:06:01,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 07:06:01,542 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:06:01,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:06:01,542 INFO L225 Difference]: With dead ends: 316 [2022-12-14 07:06:01,542 INFO L226 Difference]: Without dead ends: 300 [2022-12-14 07:06:01,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=381, Invalid=2481, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 07:06:01,543 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 153 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:06:01,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 0 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 07:06:01,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-12-14 07:06:01,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 232. [2022-12-14 07:06:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 2.722943722943723) internal successors, (629), 231 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:06:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 629 transitions. [2022-12-14 07:06:01,546 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 629 transitions. Word has length 31 [2022-12-14 07:06:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:06:01,546 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 629 transitions. [2022-12-14 07:06:01,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:06:01,546 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 629 transitions. [2022-12-14 07:06:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:06:01,546 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:06:01,546 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:06:01,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Ended with exit code 0 [2022-12-14 07:06:01,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,116 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:06:01,748 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:06:01,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:06:01,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1421056110, now seen corresponding path program 113 times [2022-12-14 07:06:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:06:01,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862796301] [2022-12-14 07:06:01,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:06:01,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:06:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:06:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:06:02,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:06:02,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862796301] [2022-12-14 07:06:02,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862796301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:06:02,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978831321] [2022-12-14 07:06:02,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:06:02,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:06:02,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:06:02,487 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:06:02,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-12-14 07:06:02,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 07:06:02,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:06:02,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-14 07:06:02,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:06:02,988 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:06:02,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 07:06:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:06:03,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:06:03,701 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-14 07:06:03,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 69 [2022-12-14 07:06:03,718 INFO L321 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2022-12-14 07:06:03,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 1 [2022-12-14 07:06:03,725 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 07:06:03,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 07:06:03,729 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 07:06:03,735 INFO L321 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2022-12-14 07:06:03,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 1 [2022-12-14 07:06:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:06:03,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978831321] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:06:03,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [931290505] [2022-12-14 07:06:03,817 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:06:03,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:06:03,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 26 [2022-12-14 07:06:03,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630237755] [2022-12-14 07:06:03,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:06:03,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 07:06:03,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:06:03,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 07:06:03,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2022-12-14 07:06:03,818 INFO L87 Difference]: Start difference. First operand 232 states and 629 transitions. Second operand has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:06:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:06:05,619 INFO L93 Difference]: Finished difference Result 334 states and 877 transitions. [2022-12-14 07:06:05,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 07:06:05,620 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:06:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:06:05,620 INFO L225 Difference]: With dead ends: 334 [2022-12-14 07:06:05,621 INFO L226 Difference]: Without dead ends: 320 [2022-12-14 07:06:05,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=314, Invalid=1942, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 07:06:05,621 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:06:05,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 07:06:05,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-12-14 07:06:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 248. [2022-12-14 07:06:05,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 2.716599190283401) internal successors, (671), 247 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:06:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 671 transitions. [2022-12-14 07:06:05,624 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 671 transitions. Word has length 31 [2022-12-14 07:06:05,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:06:05,624 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 671 transitions. [2022-12-14 07:06:05,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:06:05,624 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 671 transitions. [2022-12-14 07:06:05,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:06:05,625 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:06:05,625 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:06:05,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2022-12-14 07:06:05,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 117 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable121 [2022-12-14 07:06:05,826 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:06:05,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:06:05,827 INFO L85 PathProgramCache]: Analyzing trace with hash 549694014, now seen corresponding path program 114 times [2022-12-14 07:06:05,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:06:05,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061042408] [2022-12-14 07:06:05,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:06:05,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:06:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:06:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:06:06,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:06:06,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061042408] [2022-12-14 07:06:06,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061042408] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:06:06,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259740907] [2022-12-14 07:06:06,505 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:06:06,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:06:06,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:06:06,506 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:06:06,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2022-12-14 07:06:06,778 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:06:06,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:06:06,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:06:06,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:06:06,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:06:06,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:06:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:06:07,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:06:51,827 WARN L233 SmtUtils]: Spent 42.24s on a formula simplification. DAG size of input: 44 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:07:10,028 WARN L233 SmtUtils]: Spent 16.10s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:07:10,047 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 07:07:10,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 11 [2022-12-14 07:07:10,055 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 07:07:10,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 07:07:10,097 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-14 07:07:10,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 66 [2022-12-14 07:07:10,128 INFO L321 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2022-12-14 07:07:10,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 1 [2022-12-14 07:07:10,134 INFO L321 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2022-12-14 07:07:10,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 1 [2022-12-14 07:07:10,141 INFO L321 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2022-12-14 07:07:10,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 1 [2022-12-14 07:07:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:07:10,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259740907] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:07:10,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [253934201] [2022-12-14 07:07:10,234 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:07:10,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:07:10,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:07:10,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432401909] [2022-12-14 07:07:10,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:07:10,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:07:10,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:07:10,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:07:10,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=921, Unknown=2, NotChecked=0, Total=1056 [2022-12-14 07:07:10,235 INFO L87 Difference]: Start difference. First operand 248 states and 671 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:07:37,933 WARN L233 SmtUtils]: Spent 20.07s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:07:40,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:07:42,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:07:44,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:07:46,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:07:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:07:46,132 INFO L93 Difference]: Finished difference Result 306 states and 801 transitions. [2022-12-14 07:07:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 07:07:46,132 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:07:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:07:46,133 INFO L225 Difference]: With dead ends: 306 [2022-12-14 07:07:46,133 INFO L226 Difference]: Without dead ends: 296 [2022-12-14 07:07:46,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 90.0s TimeCoverageRelationStatistics Valid=378, Invalid=2373, Unknown=5, NotChecked=0, Total=2756 [2022-12-14 07:07:46,133 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 17 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-12-14 07:07:46,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1121 Invalid, 4 Unknown, 0 Unchecked, 8.9s Time] [2022-12-14 07:07:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-12-14 07:07:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 250. [2022-12-14 07:07:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 2.7228915662650603) internal successors, (678), 249 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:07:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 678 transitions. [2022-12-14 07:07:46,136 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 678 transitions. Word has length 31 [2022-12-14 07:07:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:07:46,136 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 678 transitions. [2022-12-14 07:07:46,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:07:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 678 transitions. [2022-12-14 07:07:46,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:07:46,137 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:07:46,137 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:07:46,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Ended with exit code 0 [2022-12-14 07:07:46,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 118 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2022-12-14 07:07:46,338 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:07:46,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:07:46,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1142485268, now seen corresponding path program 115 times [2022-12-14 07:07:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:07:46,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599470273] [2022-12-14 07:07:46,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:07:46,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:07:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:07:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:07:47,113 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:07:47,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599470273] [2022-12-14 07:07:47,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599470273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:07:47,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657267311] [2022-12-14 07:07:47,113 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:07:47,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:07:47,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:07:47,114 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:07:47,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2022-12-14 07:07:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:07:47,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:07:47,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:07:47,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:07:47,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:07:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:07:47,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:08:28,232 WARN L233 SmtUtils]: Spent 40.15s on a formula simplification. DAG size of input: 44 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:08:54,407 WARN L233 SmtUtils]: Spent 22.07s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:08:54,424 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 07:08:54,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 11 [2022-12-14 07:08:54,433 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 07:08:54,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 07:08:54,479 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-14 07:08:54,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 66 [2022-12-14 07:08:54,515 INFO L321 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2022-12-14 07:08:54,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 1 [2022-12-14 07:08:54,525 INFO L321 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2022-12-14 07:08:54,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 1 [2022-12-14 07:08:54,533 INFO L321 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2022-12-14 07:08:54,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 1 [2022-12-14 07:08:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:08:54,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657267311] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:08:54,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2043877247] [2022-12-14 07:08:54,646 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:08:54,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:08:54,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:08:54,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105559513] [2022-12-14 07:08:54,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:08:54,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:08:54,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:08:54,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:08:54,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=918, Unknown=2, NotChecked=0, Total=1056 [2022-12-14 07:08:54,647 INFO L87 Difference]: Start difference. First operand 250 states and 678 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:09:27,188 WARN L233 SmtUtils]: Spent 23.21s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:09:28,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:09:30,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:09:32,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:09:35,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:09:37,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:09:38,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:09:38,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:09:38,459 INFO L93 Difference]: Finished difference Result 351 states and 901 transitions. [2022-12-14 07:09:38,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 07:09:38,459 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:09:38,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:09:38,460 INFO L225 Difference]: With dead ends: 351 [2022-12-14 07:09:38,460 INFO L226 Difference]: Without dead ends: 336 [2022-12-14 07:09:38,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 100.6s TimeCoverageRelationStatistics Valid=453, Invalid=2511, Unknown=6, NotChecked=0, Total=2970 [2022-12-14 07:09:38,460 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 23 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:09:38,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1176 Invalid, 6 Unknown, 0 Unchecked, 10.1s Time] [2022-12-14 07:09:38,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-12-14 07:09:38,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 266. [2022-12-14 07:09:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 2.7773584905660376) internal successors, (736), 265 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:09:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 736 transitions. [2022-12-14 07:09:38,464 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 736 transitions. Word has length 31 [2022-12-14 07:09:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:09:38,464 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 736 transitions. [2022-12-14 07:09:38,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:09:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 736 transitions. [2022-12-14 07:09:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:09:38,464 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:09:38,464 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:09:38,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2022-12-14 07:09:38,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2022-12-14 07:09:38,666 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:09:38,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:09:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2060435458, now seen corresponding path program 116 times [2022-12-14 07:09:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:09:38,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274717826] [2022-12-14 07:09:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:09:38,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:09:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:09:39,252 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:09:39,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:09:39,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274717826] [2022-12-14 07:09:39,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274717826] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:09:39,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376307365] [2022-12-14 07:09:39,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:09:39,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:09:39,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:09:39,254 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:09:39,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2022-12-14 07:09:39,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:09:39,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:09:39,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-14 07:09:39,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:09:39,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:09:39,763 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-14 07:09:39,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 25 [2022-12-14 07:09:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:09:39,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:09:40,455 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 07:09:40,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 07:09:40,500 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-14 07:09:40,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 66 [2022-12-14 07:09:40,523 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 07:09:40,528 INFO L321 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2022-12-14 07:09:40,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 1 [2022-12-14 07:09:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:09:40,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376307365] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:09:40,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [64175387] [2022-12-14 07:09:40,595 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:09:40,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:09:40,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 26 [2022-12-14 07:09:40,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049330419] [2022-12-14 07:09:40,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:09:40,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 07:09:40,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:09:40,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 07:09:40,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2022-12-14 07:09:40,596 INFO L87 Difference]: Start difference. First operand 266 states and 736 transitions. Second operand has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:09:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:09:44,768 INFO L93 Difference]: Finished difference Result 474 states and 1210 transitions. [2022-12-14 07:09:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 07:09:44,769 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:09:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:09:44,770 INFO L225 Difference]: With dead ends: 474 [2022-12-14 07:09:44,770 INFO L226 Difference]: Without dead ends: 448 [2022-12-14 07:09:44,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=572, Invalid=2850, Unknown=0, NotChecked=0, Total=3422 [2022-12-14 07:09:44,770 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:09:44,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 0 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 07:09:44,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-12-14 07:09:44,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 286. [2022-12-14 07:09:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 2.824561403508772) internal successors, (805), 285 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:09:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 805 transitions. [2022-12-14 07:09:44,774 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 805 transitions. Word has length 31 [2022-12-14 07:09:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:09:44,774 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 805 transitions. [2022-12-14 07:09:44,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:09:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 805 transitions. [2022-12-14 07:09:44,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:09:44,775 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:09:44,775 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:09:44,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Ended with exit code 0 [2022-12-14 07:09:44,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 120 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2022-12-14 07:09:44,976 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:09:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:09:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1626348974, now seen corresponding path program 117 times [2022-12-14 07:09:44,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:09:44,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895906661] [2022-12-14 07:09:44,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:09:44,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:09:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:09:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 07:09:46,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:09:46,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895906661] [2022-12-14 07:09:46,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895906661] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:09:46,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899117305] [2022-12-14 07:09:46,126 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:09:46,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:09:46,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:09:46,127 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:09:46,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-12-14 07:09:46,378 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:09:46,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:09:46,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 07:09:46,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:09:46,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:09:46,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:09:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-14 07:09:46,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:09:47,181 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-14 07:09:47,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 107 [2022-12-14 07:09:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:09:47,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899117305] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:09:47,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [881346749] [2022-12-14 07:09:47,351 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:09:47,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:09:47,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 10] total 42 [2022-12-14 07:09:47,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924217761] [2022-12-14 07:09:47,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:09:47,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 07:09:47,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:09:47,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 07:09:47,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1633, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 07:09:47,352 INFO L87 Difference]: Start difference. First operand 286 states and 805 transitions. Second operand has 43 states, 42 states have (on average 1.7857142857142858) 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-12-14 07:09:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:09:50,008 INFO L93 Difference]: Finished difference Result 384 states and 1031 transitions. [2022-12-14 07:09:50,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 07:09:50,008 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.7857142857142858) 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 31 [2022-12-14 07:09:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:09:50,009 INFO L225 Difference]: With dead ends: 384 [2022-12-14 07:09:50,009 INFO L226 Difference]: Without dead ends: 374 [2022-12-14 07:09:50,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=596, Invalid=3960, Unknown=0, NotChecked=0, Total=4556 [2022-12-14 07:09:50,010 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 212 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:09:50,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 0 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 07:09:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-12-14 07:09:50,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 288. [2022-12-14 07:09:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.8292682926829267) internal successors, (812), 287 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:09:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 812 transitions. [2022-12-14 07:09:50,016 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 812 transitions. Word has length 31 [2022-12-14 07:09:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:09:50,016 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 812 transitions. [2022-12-14 07:09:50,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.7857142857142858) 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-12-14 07:09:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 812 transitions. [2022-12-14 07:09:50,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:09:50,017 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:09:50,017 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:09:50,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Forceful destruction successful, exit code 0 [2022-12-14 07:09:50,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 121 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-12-14 07:09:50,218 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:09:50,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:09:50,219 INFO L85 PathProgramCache]: Analyzing trace with hash 754986878, now seen corresponding path program 118 times [2022-12-14 07:09:50,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:09:50,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402740012] [2022-12-14 07:09:50,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:09:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:09:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:09:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:09:51,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:09:51,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402740012] [2022-12-14 07:09:51,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402740012] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:09:51,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778438485] [2022-12-14 07:09:51,061 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:09:51,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:09:51,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:09:51,062 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:09:51,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2022-12-14 07:09:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:09:51,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:09:51,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:09:51,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:09:51,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:09:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:09:51,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:09:52,017 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-14 07:09:52,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 107 [2022-12-14 07:09:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:09:52,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778438485] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:09:52,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2068325412] [2022-12-14 07:09:52,180 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:09:52,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:09:52,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:09:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711208742] [2022-12-14 07:09:52,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:09:52,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:09:52,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:09:52,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:09:52,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:09:52,182 INFO L87 Difference]: Start difference. First operand 288 states and 812 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:09:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:09:53,608 INFO L93 Difference]: Finished difference Result 390 states and 1040 transitions. [2022-12-14 07:09:53,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 07:09:53,608 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:09:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:09:53,609 INFO L225 Difference]: With dead ends: 390 [2022-12-14 07:09:53,609 INFO L226 Difference]: Without dead ends: 380 [2022-12-14 07:09:53,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=343, Invalid=2107, Unknown=0, NotChecked=0, Total=2450 [2022-12-14 07:09:53,610 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:09:53,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 07:09:53,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-12-14 07:09:53,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 288. [2022-12-14 07:09:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.836236933797909) internal successors, (814), 287 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:09:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 814 transitions. [2022-12-14 07:09:53,615 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 814 transitions. Word has length 31 [2022-12-14 07:09:53,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:09:53,615 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 814 transitions. [2022-12-14 07:09:53,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:09:53,615 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 814 transitions. [2022-12-14 07:09:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:09:53,615 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:09:53,615 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:09:53,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Forceful destruction successful, exit code 0 [2022-12-14 07:09:53,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2022-12-14 07:09:53,817 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:09:53,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:09:53,818 INFO L85 PathProgramCache]: Analyzing trace with hash -469841584, now seen corresponding path program 119 times [2022-12-14 07:09:53,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:09:53,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716446344] [2022-12-14 07:09:53,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:09:53,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:09:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:09:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:09:54,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:09:54,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716446344] [2022-12-14 07:09:54,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716446344] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:09:54,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925041249] [2022-12-14 07:09:54,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:09:54,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:09:54,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:09:54,560 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:09:54,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2022-12-14 07:09:54,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:09:54,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:09:54,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:09:54,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:09:55,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:09:55,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:09:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:09:55,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:09:55,654 INFO L321 Elim1Store]: treesize reduction 15, result has 83.5 percent of original size [2022-12-14 07:09:55,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 193 treesize of output 117 [2022-12-14 07:09:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:09:55,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925041249] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:09:55,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [616681136] [2022-12-14 07:09:55,757 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:09:55,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:09:55,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:09:55,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017947143] [2022-12-14 07:09:55,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:09:55,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:09:55,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:09:55,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:09:55,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:09:55,758 INFO L87 Difference]: Start difference. First operand 288 states and 814 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:09:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:09:57,334 INFO L93 Difference]: Finished difference Result 390 states and 1053 transitions. [2022-12-14 07:09:57,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 07:09:57,334 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:09:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:09:57,335 INFO L225 Difference]: With dead ends: 390 [2022-12-14 07:09:57,335 INFO L226 Difference]: Without dead ends: 380 [2022-12-14 07:09:57,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=446, Invalid=2746, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 07:09:57,335 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 138 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:09:57,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 0 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 07:09:57,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-12-14 07:09:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 306. [2022-12-14 07:09:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 2.862295081967213) internal successors, (873), 305 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:09:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 873 transitions. [2022-12-14 07:09:57,339 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 873 transitions. Word has length 31 [2022-12-14 07:09:57,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:09:57,340 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 873 transitions. [2022-12-14 07:09:57,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:09:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 873 transitions. [2022-12-14 07:09:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:09:57,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:09:57,340 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:09:57,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Ended with exit code 0 [2022-12-14 07:09:57,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 123 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable127 [2022-12-14 07:09:57,541 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:09:57,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:09:57,542 INFO L85 PathProgramCache]: Analyzing trace with hash 198338272, now seen corresponding path program 120 times [2022-12-14 07:09:57,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:09:57,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024518012] [2022-12-14 07:09:57,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:09:57,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:09:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:09:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:09:58,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:09:58,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024518012] [2022-12-14 07:09:58,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024518012] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:09:58,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064349692] [2022-12-14 07:09:58,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:09:58,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:09:58,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:09:58,387 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:09:58,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-12-14 07:09:58,660 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:09:58,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:09:58,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:09:58,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:09:58,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:09:58,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:09:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:09:58,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:09:59,484 INFO L321 Elim1Store]: treesize reduction 15, result has 83.5 percent of original size [2022-12-14 07:09:59,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 113 [2022-12-14 07:09:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:09:59,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064349692] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:09:59,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [744529856] [2022-12-14 07:09:59,616 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:09:59,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:09:59,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:09:59,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450468436] [2022-12-14 07:09:59,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:09:59,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:09:59,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:09:59,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:09:59,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:09:59,617 INFO L87 Difference]: Start difference. First operand 306 states and 873 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:10:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:10:01,489 INFO L93 Difference]: Finished difference Result 406 states and 1079 transitions. [2022-12-14 07:10:01,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 07:10:01,490 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:10:01,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:10:01,491 INFO L225 Difference]: With dead ends: 406 [2022-12-14 07:10:01,491 INFO L226 Difference]: Without dead ends: 392 [2022-12-14 07:10:01,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=417, Invalid=2553, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 07:10:01,491 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:10:01,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 07:10:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-12-14 07:10:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 310. [2022-12-14 07:10:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 2.8640776699029127) internal successors, (885), 309 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:10:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 885 transitions. [2022-12-14 07:10:01,495 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 885 transitions. Word has length 31 [2022-12-14 07:10:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:10:01,495 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 885 transitions. [2022-12-14 07:10:01,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:10:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 885 transitions. [2022-12-14 07:10:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:10:01,496 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:10:01,496 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:10:01,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Forceful destruction successful, exit code 0 [2022-12-14 07:10:01,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128,124 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:10:01,697 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:10:01,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:10:01,698 INFO L85 PathProgramCache]: Analyzing trace with hash -673023824, now seen corresponding path program 121 times [2022-12-14 07:10:01,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:10:01,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760921260] [2022-12-14 07:10:01,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:10:01,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:10:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:10:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:10:02,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:10:02,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760921260] [2022-12-14 07:10:02,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760921260] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:10:02,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425184301] [2022-12-14 07:10:02,482 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:10:02,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:10:02,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:10:02,482 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:10:02,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-12-14 07:10:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:10:02,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:10:02,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:10:03,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:10:03,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:10:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:10:03,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:10:03,613 INFO L321 Elim1Store]: treesize reduction 15, result has 83.5 percent of original size [2022-12-14 07:10:03,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 113 [2022-12-14 07:10:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:10:03,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425184301] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:10:03,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1281155472] [2022-12-14 07:10:03,740 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:10:03,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:10:03,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:10:03,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33467169] [2022-12-14 07:10:03,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:10:03,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:10:03,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:10:03,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:10:03,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:10:03,741 INFO L87 Difference]: Start difference. First operand 310 states and 885 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:10:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:10:05,573 INFO L93 Difference]: Finished difference Result 396 states and 1060 transitions. [2022-12-14 07:10:05,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 07:10:05,574 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:10:05,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:10:05,574 INFO L225 Difference]: With dead ends: 396 [2022-12-14 07:10:05,574 INFO L226 Difference]: Without dead ends: 386 [2022-12-14 07:10:05,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=400, Invalid=2462, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 07:10:05,575 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:10:05,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 07:10:05,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-12-14 07:10:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 306. [2022-12-14 07:10:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 2.855737704918033) internal successors, (871), 305 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:10:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 871 transitions. [2022-12-14 07:10:05,579 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 871 transitions. Word has length 31 [2022-12-14 07:10:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:10:05,579 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 871 transitions. [2022-12-14 07:10:05,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:10:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 871 transitions. [2022-12-14 07:10:05,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:10:05,579 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:10:05,579 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:10:05,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Forceful destruction successful, exit code 0 [2022-12-14 07:10:05,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2022-12-14 07:10:05,780 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:10:05,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:10:05,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1508601426, now seen corresponding path program 122 times [2022-12-14 07:10:05,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:10:05,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004437974] [2022-12-14 07:10:05,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:10:05,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:10:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:10:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:10:07,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:10:07,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004437974] [2022-12-14 07:10:07,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004437974] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:10:07,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068291281] [2022-12-14 07:10:07,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:10:07,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:10:07,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:10:07,228 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:10:07,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-12-14 07:10:07,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:10:07,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:10:07,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:10:07,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:10:07,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:10:07,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:10:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:10:07,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:10:40,572 WARN L233 SmtUtils]: Spent 32.20s on a formula simplification. DAG size of input: 44 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:10:40,627 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:10:40,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-14 07:10:40,655 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 07:10:40,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 07:10:40,663 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 07:10:40,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 07:10:40,670 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 07:10:40,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 07:10:40,672 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 07:10:40,679 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 07:10:40,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 07:10:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:10:40,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068291281] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:10:40,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1325502464] [2022-12-14 07:10:40,801 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:10:40,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:10:40,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12, 10] total 45 [2022-12-14 07:10:40,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069128006] [2022-12-14 07:10:40,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:10:40,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-14 07:10:40,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:10:40,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-14 07:10:40,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1842, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 07:10:40,802 INFO L87 Difference]: Start difference. First operand 306 states and 871 transitions. Second operand has 46 states, 45 states have (on average 1.711111111111111) internal successors, (77), 46 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:10:46,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:10:48,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:10:50,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:10:51,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:10:54,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:10:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:10:54,285 INFO L93 Difference]: Finished difference Result 850 states and 2262 transitions. [2022-12-14 07:10:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-14 07:10:54,285 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.711111111111111) internal successors, (77), 46 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:10:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:10:54,286 INFO L225 Difference]: With dead ends: 850 [2022-12-14 07:10:54,287 INFO L226 Difference]: Without dead ends: 810 [2022-12-14 07:10:54,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3195 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=1392, Invalid=9320, Unknown=0, NotChecked=0, Total=10712 [2022-12-14 07:10:54,287 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 443 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 62 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:10:54,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 0 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1829 Invalid, 5 Unknown, 0 Unchecked, 8.5s Time] [2022-12-14 07:10:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-12-14 07:10:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 314. [2022-12-14 07:10:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.8849840255591053) internal successors, (903), 313 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:10:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 903 transitions. [2022-12-14 07:10:54,293 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 903 transitions. Word has length 31 [2022-12-14 07:10:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:10:54,293 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 903 transitions. [2022-12-14 07:10:54,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.711111111111111) internal successors, (77), 46 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:10:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 903 transitions. [2022-12-14 07:10:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:10:54,294 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:10:54,294 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:10:54,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Ended with exit code 0 [2022-12-14 07:10:54,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,126 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:10:54,495 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:10:54,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:10:54,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1054939952, now seen corresponding path program 123 times [2022-12-14 07:10:54,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:10:54,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557695761] [2022-12-14 07:10:54,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:10:54,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:10:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:10:55,268 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:10:55,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:10:55,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557695761] [2022-12-14 07:10:55,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557695761] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:10:55,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484042447] [2022-12-14 07:10:55,268 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:10:55,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:10:55,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:10:55,269 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:10:55,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-12-14 07:10:55,622 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:10:55,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:10:55,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:10:55,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:10:55,787 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:10:55,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:10:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:10:55,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:11:36,468 WARN L233 SmtUtils]: Spent 40.12s on a formula simplification. DAG size of input: 44 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:11:36,522 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 07:11:36,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-14 07:11:36,553 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 07:11:36,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 07:11:36,563 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 07:11:36,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 07:11:36,571 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 07:11:36,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 07:11:36,574 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 07:11:36,581 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 07:11:36,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 07:11:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:11:36,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484042447] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:11:36,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [927859458] [2022-12-14 07:11:36,692 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:11:36,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:11:36,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:11:36,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341801833] [2022-12-14 07:11:36,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:11:36,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:11:36,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:11:36,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:11:36,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:11:36,694 INFO L87 Difference]: Start difference. First operand 314 states and 903 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:11:39,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:11:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:11:40,106 INFO L93 Difference]: Finished difference Result 427 states and 1158 transitions. [2022-12-14 07:11:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 07:11:40,106 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 07:11:40,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:11:40,107 INFO L225 Difference]: With dead ends: 427 [2022-12-14 07:11:40,107 INFO L226 Difference]: Without dead ends: 412 [2022-12-14 07:11:40,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=407, Invalid=2455, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 07:11:40,108 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:11:40,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 975 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-12-14 07:11:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-12-14 07:11:40,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 318. [2022-12-14 07:11:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 2.9053627760252367) internal successors, (921), 317 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:11:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 921 transitions. [2022-12-14 07:11:40,114 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 921 transitions. Word has length 31 [2022-12-14 07:11:40,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:11:40,114 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 921 transitions. [2022-12-14 07:11:40,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:11:40,114 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 921 transitions. [2022-12-14 07:11:40,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 07:11:40,114 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:11:40,114 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:11:40,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Ended with exit code 0 [2022-12-14 07:11:40,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,127 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:11:40,316 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 07:11:40,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:11:40,317 INFO L85 PathProgramCache]: Analyzing trace with hash -822913760, now seen corresponding path program 124 times [2022-12-14 07:11:40,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:11:40,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398697207] [2022-12-14 07:11:40,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:11:40,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:11:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:11:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:11:41,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:11:41,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398697207] [2022-12-14 07:11:41,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398697207] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:11:41,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232953535] [2022-12-14 07:11:41,263 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:11:41,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:11:41,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:11:41,264 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:11:41,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ab7faf-8ee9-4f8b-98b3-b65625e66a80/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-12-14 07:11:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:11:41,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 07:11:41,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:11:41,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:11:41,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:11:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:11:41,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:12:26,500 WARN L233 SmtUtils]: Spent 44.15s on a formula simplification. DAG size of input: 44 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:12:48,670 WARN L233 SmtUtils]: Spent 20.06s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:12:48,690 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 07:12:48,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 11 [2022-12-14 07:12:48,698 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 07:12:48,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 07:12:48,734 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-14 07:12:48,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 66 [2022-12-14 07:12:48,768 INFO L321 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2022-12-14 07:12:48,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 1 [2022-12-14 07:12:48,775 INFO L321 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2022-12-14 07:12:48,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 1 [2022-12-14 07:12:48,781 INFO L321 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2022-12-14 07:12:48,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 1 [2022-12-14 07:12:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:12:48,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232953535] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:12:48,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2128739264] [2022-12-14 07:12:48,868 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 07:12:48,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:12:48,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 32 [2022-12-14 07:12:48,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911667819] [2022-12-14 07:12:48,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:12:48,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:12:48,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:12:48,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:12:48,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=933, Unknown=1, NotChecked=0, Total=1056 [2022-12-14 07:12:48,869 INFO L87 Difference]: Start difference. First operand 318 states and 921 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)