./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur --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 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c --- 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-38b53e6 [2022-11-25 23:42:44,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:42:44,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:42:44,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:42:44,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:42:44,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:42:44,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:42:44,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:42:44,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:42:44,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:42:44,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:42:44,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:42:44,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:42:44,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:42:44,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:42:44,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:42:44,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:42:44,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:42:44,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:42:44,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:42:44,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:42:44,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:42:44,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:42:44,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:42:44,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:42:44,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:42:44,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:42:44,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:42:44,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:42:44,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:42:44,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:42:44,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:42:44,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:42:44,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:42:44,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:42:44,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:42:44,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:42:44,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:42:44,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:42:44,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:42:44,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:42:44,643 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 23:42:44,691 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:42:44,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:42:44,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:42:44,692 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:42:44,693 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:42:44,693 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:42:44,694 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:42:44,694 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:42:44,694 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:42:44,694 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:42:44,695 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:42:44,696 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:42:44,696 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:42:44,696 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:42:44,697 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:42:44,697 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:42:44,697 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:42:44,697 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:42:44,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:42:44,699 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:42:44,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:42:44,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:42:44,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:42:44,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:42:44,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:42:44,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:42:44,700 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:42:44,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:42:44,701 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:42:44,701 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:42:44,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:42:44,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:42:44,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:42:44,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:42:44,703 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:42:44,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:42:44,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:42:44,703 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:42:44,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:42:44,704 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:42:44,704 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:42:44,704 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_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/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_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur 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 -> 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c [2022-11-25 23:42:44,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:42:44,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:42:44,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:42:44,997 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:42:44,998 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:42:44,999 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-11-25 23:42:48,089 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:42:48,348 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:42:48,349 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-11-25 23:42:48,357 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/data/8a960ae0b/e340bb0c87ad4fada7ea46b007d5a46f/FLAGd3dc6ad83 [2022-11-25 23:42:48,377 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/data/8a960ae0b/e340bb0c87ad4fada7ea46b007d5a46f [2022-11-25 23:42:48,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:42:48,384 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:42:48,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:42:48,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:42:48,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:42:48,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:42:48" (1/1) ... [2022-11-25 23:42:48,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38aa199f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:48, skipping insertion in model container [2022-11-25 23:42:48,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:42:48" (1/1) ... [2022-11-25 23:42:48,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:42:48,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:42:48,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:42:48,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:42:48,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:42:48,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:42:48,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:42:48,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:42:48,606 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_12fd9e17-180b-47aa-918f-971e146ba9a8/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-25 23:42:48,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:42:48,624 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:42:48,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:42:48,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:42:48,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:42:48,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:42:48,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:42:48,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:42:48,648 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_12fd9e17-180b-47aa-918f-971e146ba9a8/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-25 23:42:48,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:42:48,664 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:42:48,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:48 WrapperNode [2022-11-25 23:42:48,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:42:48,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:42:48,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:42:48,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:42:48,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:48" (1/1) ... [2022-11-25 23:42:48,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:48" (1/1) ... [2022-11-25 23:42:48,704 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-11-25 23:42:48,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:42:48,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:42:48,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:42:48,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:42:48,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:48" (1/1) ... [2022-11-25 23:42:48,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:48" (1/1) ... [2022-11-25 23:42:48,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:48" (1/1) ... [2022-11-25 23:42:48,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:48" (1/1) ... [2022-11-25 23:42:48,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:48" (1/1) ... [2022-11-25 23:42:48,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:48" (1/1) ... [2022-11-25 23:42:48,732 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:48" (1/1) ... [2022-11-25 23:42:48,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:48" (1/1) ... [2022-11-25 23:42:48,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:42:48,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:42:48,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:42:48,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:42:48,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:48" (1/1) ... [2022-11-25 23:42:48,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:42:48,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:48,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:42:48,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:42:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:42:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-25 23:42:48,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-25 23:42:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-25 23:42:48,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-25 23:42:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-25 23:42:48,813 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-25 23:42:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:42:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:42:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:42:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 23:42:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 23:42:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:42:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:42:48,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:42:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:42:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:42:48,819 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 23:42:49,012 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:42:49,013 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:42:49,403 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:42:49,479 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:42:49,479 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 23:42:49,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:42:49 BoogieIcfgContainer [2022-11-25 23:42:49,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:42:49,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:42:49,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:42:49,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:42:49,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:42:48" (1/3) ... [2022-11-25 23:42:49,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc7b52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:42:49, skipping insertion in model container [2022-11-25 23:42:49,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:48" (2/3) ... [2022-11-25 23:42:49,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc7b52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:42:49, skipping insertion in model container [2022-11-25 23:42:49,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:42:49" (3/3) ... [2022-11-25 23:42:49,492 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-11-25 23:42:49,501 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 23:42:49,512 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:42:49,512 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 23:42:49,512 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 23:42:49,608 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-25 23:42:49,665 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:42:49,678 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 154 transitions, 332 flow [2022-11-25 23:42:49,681 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 154 transitions, 332 flow [2022-11-25 23:42:49,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 154 transitions, 332 flow [2022-11-25 23:42:49,751 INFO L130 PetriNetUnfolder]: 12/151 cut-off events. [2022-11-25 23:42:49,751 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-25 23:42:49,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 151 events. 12/151 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-11-25 23:42:49,758 INFO L119 LiptonReduction]: Number of co-enabled transitions 1320 [2022-11-25 23:42:56,574 INFO L134 LiptonReduction]: Checked pairs total: 1541 [2022-11-25 23:42:56,575 INFO L136 LiptonReduction]: Total number of compositions: 148 [2022-11-25 23:42:56,583 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 80 flow [2022-11-25 23:42:56,617 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:56,643 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:42:56,651 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;@66d298ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:42:56,652 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 23:42:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:42:56,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:56,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:56,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:42:56,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:56,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1055041608, now seen corresponding path program 1 times [2022-11-25 23:42:56,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:56,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794877401] [2022-11-25 23:42:56,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:56,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:57,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:57,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794877401] [2022-11-25 23:42:57,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794877401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:57,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:57,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:42:57,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806916071] [2022-11-25 23:42:57,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:57,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:42:57,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:57,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:42:57,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:57,505 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:57,623 INFO L93 Difference]: Finished difference Result 204 states and 632 transitions. [2022-11-25 23:42:57,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:42:57,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 23:42:57,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:57,647 INFO L225 Difference]: With dead ends: 204 [2022-11-25 23:42:57,647 INFO L226 Difference]: Without dead ends: 197 [2022-11-25 23:42:57,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:57,653 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:57,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:57,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-25 23:42:57,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-11-25 23:42:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 3.13265306122449) internal successors, (614), 196 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 614 transitions. [2022-11-25 23:42:57,713 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 614 transitions. Word has length 20 [2022-11-25 23:42:57,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:57,714 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 614 transitions. [2022-11-25 23:42:57,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 614 transitions. [2022-11-25 23:42:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:42:57,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:57,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:57,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:42:57,718 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:42:57,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:57,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1532028833, now seen corresponding path program 1 times [2022-11-25 23:42:57,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:57,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731139059] [2022-11-25 23:42:57,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:57,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:58,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:58,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731139059] [2022-11-25 23:42:58,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731139059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:58,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:58,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:42:58,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730285588] [2022-11-25 23:42:58,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:58,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:42:58,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:58,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:42:58,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:42:58,635 INFO L87 Difference]: Start difference. First operand 197 states and 614 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:58,760 INFO L93 Difference]: Finished difference Result 198 states and 615 transitions. [2022-11-25 23:42:58,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:42:58,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:42:58,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:58,765 INFO L225 Difference]: With dead ends: 198 [2022-11-25 23:42:58,765 INFO L226 Difference]: Without dead ends: 198 [2022-11-25 23:42:58,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:42:58,768 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:58,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:58,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-25 23:42:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-11-25 23:42:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 3.1218274111675126) internal successors, (615), 197 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 615 transitions. [2022-11-25 23:42:58,805 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 615 transitions. Word has length 21 [2022-11-25 23:42:58,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:58,805 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 615 transitions. [2022-11-25 23:42:58,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 615 transitions. [2022-11-25 23:42:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:42:58,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:58,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:58,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:42:58,813 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:42:58,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:58,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1924133900, now seen corresponding path program 1 times [2022-11-25 23:42:58,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:58,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465979444] [2022-11-25 23:42:58,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:58,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:42:58,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:58,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465979444] [2022-11-25 23:42:58,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465979444] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:58,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517493633] [2022-11-25 23:42:58,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:58,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:58,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:58,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:59,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:42:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:59,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:42:59,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:42:59,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:42:59,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517493633] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:59,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:42:59,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-11-25 23:42:59,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928167231] [2022-11-25 23:42:59,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:59,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:42:59,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:59,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:42:59,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:42:59,296 INFO L87 Difference]: Start difference. First operand 198 states and 615 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:59,395 INFO L93 Difference]: Finished difference Result 174 states and 549 transitions. [2022-11-25 23:42:59,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:42:59,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 23:42:59,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:59,398 INFO L225 Difference]: With dead ends: 174 [2022-11-25 23:42:59,398 INFO L226 Difference]: Without dead ends: 174 [2022-11-25 23:42:59,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:42:59,399 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 43 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:59,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 7 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:59,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-25 23:42:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 134. [2022-11-25 23:42:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.1052631578947367) internal successors, (413), 133 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 413 transitions. [2022-11-25 23:42:59,410 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 413 transitions. Word has length 22 [2022-11-25 23:42:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:59,410 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 413 transitions. [2022-11-25 23:42:59,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 413 transitions. [2022-11-25 23:42:59,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:42:59,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:59,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:59,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:59,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:59,618 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:42:59,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:59,619 INFO L85 PathProgramCache]: Analyzing trace with hash -570695373, now seen corresponding path program 1 times [2022-11-25 23:42:59,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:59,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145590935] [2022-11-25 23:42:59,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:59,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:59,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-11-25 23:42:59,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:59,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145590935] [2022-11-25 23:42:59,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145590935] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:59,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514850260] [2022-11-25 23:42:59,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:59,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:59,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:59,852 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:59,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:43:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:00,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:43:00,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:43:00,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:43:00,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514850260] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:00,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:43:00,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2022-11-25 23:43:00,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868274697] [2022-11-25 23:43:00,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:43:00,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:43:00,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:00,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:43:00,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:43:00,240 INFO L87 Difference]: Start difference. First operand 134 states and 413 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:00,437 INFO L93 Difference]: Finished difference Result 166 states and 519 transitions. [2022-11-25 23:43:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:43:00,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 23:43:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:00,440 INFO L225 Difference]: With dead ends: 166 [2022-11-25 23:43:00,440 INFO L226 Difference]: Without dead ends: 166 [2022-11-25 23:43:00,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:43:00,443 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 62 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:00,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 11 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:43:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-25 23:43:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-11-25 23:43:00,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.1454545454545455) internal successors, (519), 165 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 519 transitions. [2022-11-25 23:43:00,454 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 519 transitions. Word has length 22 [2022-11-25 23:43:00,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:00,454 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 519 transitions. [2022-11-25 23:43:00,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:00,454 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 519 transitions. [2022-11-25 23:43:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:43:00,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:00,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:00,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:00,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:00,672 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:43:00,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash -294060223, now seen corresponding path program 1 times [2022-11-25 23:43:00,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:00,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231478788] [2022-11-25 23:43:00,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:00,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:01,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:01,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231478788] [2022-11-25 23:43:01,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231478788] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:01,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872864599] [2022-11-25 23:43:01,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:01,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:01,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:01,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:01,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:43:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:02,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 23:43:02,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:02,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:02,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:02,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2022-11-25 23:43:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:02,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:03,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:03,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 75 [2022-11-25 23:43:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:03,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872864599] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:03,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [312261970] [2022-11-25 23:43:03,836 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:43:03,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:43:03,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 23 [2022-11-25 23:43:03,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797910347] [2022-11-25 23:43:03,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:03,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 23:43:03,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:03,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 23:43:03,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:43:03,847 INFO L87 Difference]: Start difference. First operand 166 states and 519 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:05,712 INFO L93 Difference]: Finished difference Result 420 states and 1260 transitions. [2022-11-25 23:43:05,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 23:43:05,713 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:43:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:05,716 INFO L225 Difference]: With dead ends: 420 [2022-11-25 23:43:05,716 INFO L226 Difference]: Without dead ends: 406 [2022-11-25 23:43:05,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=286, Invalid=1274, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 23:43:05,718 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 229 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:05,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 77 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:43:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-11-25 23:43:05,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 280. [2022-11-25 23:43:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 3.182795698924731) internal successors, (888), 279 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:05,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 888 transitions. [2022-11-25 23:43:05,760 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 888 transitions. Word has length 23 [2022-11-25 23:43:05,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:05,760 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 888 transitions. [2022-11-25 23:43:05,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 888 transitions. [2022-11-25 23:43:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:43:05,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:05,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:05,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:05,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:05,963 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:43:05,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:05,964 INFO L85 PathProgramCache]: Analyzing trace with hash 360280049, now seen corresponding path program 2 times [2022-11-25 23:43:05,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:05,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478048405] [2022-11-25 23:43:05,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:05,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:06,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:06,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478048405] [2022-11-25 23:43:06,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478048405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:06,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637337870] [2022-11-25 23:43:06,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:43:06,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:06,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:06,924 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:06,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:43:07,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:43:07,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:07,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 23:43:07,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:07,932 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-25 23:43:07,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2022-11-25 23:43:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:08,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:08,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:08,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 75 [2022-11-25 23:43:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:09,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637337870] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:09,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1281916301] [2022-11-25 23:43:09,310 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:43:09,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:43:09,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2022-11-25 23:43:09,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280944162] [2022-11-25 23:43:09,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:09,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 23:43:09,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:09,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 23:43:09,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:43:09,312 INFO L87 Difference]: Start difference. First operand 280 states and 888 transitions. Second operand has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:11,599 INFO L93 Difference]: Finished difference Result 403 states and 1212 transitions. [2022-11-25 23:43:11,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 23:43:11,600 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:43:11,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:11,602 INFO L225 Difference]: With dead ends: 403 [2022-11-25 23:43:11,603 INFO L226 Difference]: Without dead ends: 382 [2022-11-25 23:43:11,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=429, Invalid=1551, Unknown=0, NotChecked=0, Total=1980 [2022-11-25 23:43:11,604 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 175 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:11,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 102 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 23:43:11,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-11-25 23:43:11,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 300. [2022-11-25 23:43:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.1739130434782608) internal successors, (949), 299 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 949 transitions. [2022-11-25 23:43:11,620 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 949 transitions. Word has length 23 [2022-11-25 23:43:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:11,620 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 949 transitions. [2022-11-25 23:43:11,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 949 transitions. [2022-11-25 23:43:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:43:11,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:11,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:11,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:11,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 23:43:11,829 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:43:11,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:11,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1177085567, now seen corresponding path program 3 times [2022-11-25 23:43:11,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:11,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414482101] [2022-11-25 23:43:11,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:11,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:12,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:12,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414482101] [2022-11-25 23:43:12,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414482101] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:12,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339694898] [2022-11-25 23:43:12,844 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:43:12,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:12,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:12,846 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:12,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:43:12,988 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:43:12,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:12,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 23:43:12,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:13,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:13,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 81 [2022-11-25 23:43:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:43:13,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:14,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:14,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 75 [2022-11-25 23:43:14,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:43:14,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339694898] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:14,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [756097886] [2022-11-25 23:43:14,781 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:43:14,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:43:14,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 26 [2022-11-25 23:43:14,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282265787] [2022-11-25 23:43:14,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:14,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 23:43:14,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:14,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 23:43:14,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2022-11-25 23:43:14,786 INFO L87 Difference]: Start difference. First operand 300 states and 949 transitions. Second operand has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:17,368 INFO L93 Difference]: Finished difference Result 537 states and 1476 transitions. [2022-11-25 23:43:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 23:43:17,369 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:43:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:17,373 INFO L225 Difference]: With dead ends: 537 [2022-11-25 23:43:17,373 INFO L226 Difference]: Without dead ends: 516 [2022-11-25 23:43:17,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=444, Invalid=1718, Unknown=0, NotChecked=0, Total=2162 [2022-11-25 23:43:17,374 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 157 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:17,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 36 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 23:43:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-11-25 23:43:17,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 325. [2022-11-25 23:43:17,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 3.191358024691358) internal successors, (1034), 324 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 1034 transitions. [2022-11-25 23:43:17,392 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 1034 transitions. Word has length 23 [2022-11-25 23:43:17,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:17,393 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 1034 transitions. [2022-11-25 23:43:17,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 1034 transitions. [2022-11-25 23:43:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:43:17,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:17,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:17,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:17,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-25 23:43:17,601 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:43:17,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:17,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1459008271, now seen corresponding path program 4 times [2022-11-25 23:43:17,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:17,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834900690] [2022-11-25 23:43:17,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:17,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:18,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:18,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834900690] [2022-11-25 23:43:18,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834900690] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:18,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643882789] [2022-11-25 23:43:18,440 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:43:18,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:18,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:18,442 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:18,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:43:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:18,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 23:43:18,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:18,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:18,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:18,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2022-11-25 23:43:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:19,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:19,359 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:19,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 127 treesize of output 75 [2022-11-25 23:43:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:19,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643882789] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:19,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1153504621] [2022-11-25 23:43:19,822 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:43:19,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:43:19,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2022-11-25 23:43:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236917963] [2022-11-25 23:43:19,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:19,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 23:43:19,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:19,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 23:43:19,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-11-25 23:43:19,826 INFO L87 Difference]: Start difference. First operand 325 states and 1034 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:21,452 INFO L93 Difference]: Finished difference Result 445 states and 1390 transitions. [2022-11-25 23:43:21,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 23:43:21,462 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:43:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:21,467 INFO L225 Difference]: With dead ends: 445 [2022-11-25 23:43:21,467 INFO L226 Difference]: Without dead ends: 431 [2022-11-25 23:43:21,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=380, Invalid=1342, Unknown=0, NotChecked=0, Total=1722 [2022-11-25 23:43:21,470 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 178 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:21,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 75 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:43:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-11-25 23:43:21,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 331. [2022-11-25 23:43:21,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 3.190909090909091) internal successors, (1053), 330 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 1053 transitions. [2022-11-25 23:43:21,487 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 1053 transitions. Word has length 23 [2022-11-25 23:43:21,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:21,487 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 1053 transitions. [2022-11-25 23:43:21,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:21,487 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 1053 transitions. [2022-11-25 23:43:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:43:21,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:21,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:21,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:21,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:21,702 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:43:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:21,703 INFO L85 PathProgramCache]: Analyzing trace with hash 355185201, now seen corresponding path program 5 times [2022-11-25 23:43:21,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:21,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103248467] [2022-11-25 23:43:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:21,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:22,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:22,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:22,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103248467] [2022-11-25 23:43:22,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103248467] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:22,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12228505] [2022-11-25 23:43:22,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:43:22,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:22,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:22,721 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:22,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:43:22,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:43:22,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:22,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 23:43:22,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:23,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:23,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:43:23,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:23,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 46 [2022-11-25 23:43:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:23,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:24,466 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:24,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 189 [2022-11-25 23:43:24,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 136 [2022-11-25 23:43:24,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 124 [2022-11-25 23:43:24,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 118 [2022-11-25 23:43:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:25,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12228505] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:25,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1499090464] [2022-11-25 23:43:25,420 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:43:25,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:43:25,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-25 23:43:25,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476183416] [2022-11-25 23:43:25,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:25,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 23:43:25,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:25,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 23:43:25,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1023, Unknown=1, NotChecked=0, Total=1190 [2022-11-25 23:43:25,423 INFO L87 Difference]: Start difference. First operand 331 states and 1053 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:27,020 INFO L93 Difference]: Finished difference Result 441 states and 1317 transitions. [2022-11-25 23:43:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:43:27,021 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:43:27,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:27,023 INFO L225 Difference]: With dead ends: 441 [2022-11-25 23:43:27,024 INFO L226 Difference]: Without dead ends: 434 [2022-11-25 23:43:27,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=375, Invalid=1786, Unknown=1, NotChecked=0, Total=2162 [2022-11-25 23:43:27,025 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 167 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:27,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 61 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:43:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-11-25 23:43:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 333. [2022-11-25 23:43:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 3.183734939759036) internal successors, (1057), 332 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1057 transitions. [2022-11-25 23:43:27,038 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1057 transitions. Word has length 23 [2022-11-25 23:43:27,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:27,039 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 1057 transitions. [2022-11-25 23:43:27,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1057 transitions. [2022-11-25 23:43:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:43:27,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:27,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:27,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:27,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:27,247 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:43:27,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:27,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1203153615, now seen corresponding path program 6 times [2022-11-25 23:43:27,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:27,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653273555] [2022-11-25 23:43:27,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:27,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:28,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:28,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653273555] [2022-11-25 23:43:28,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653273555] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:28,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198959377] [2022-11-25 23:43:28,451 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:43:28,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:28,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:28,454 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:28,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:43:28,564 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:43:28,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:28,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 23:43:28,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:29,061 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-25 23:43:29,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 69 [2022-11-25 23:43:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:43:29,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:29,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:29,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 103 treesize of output 73 [2022-11-25 23:43:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:43:30,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198959377] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:30,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1467189508] [2022-11-25 23:43:30,066 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:43:30,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:43:30,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 25 [2022-11-25 23:43:30,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063233679] [2022-11-25 23:43:30,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:30,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 23:43:30,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:30,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 23:43:30,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-11-25 23:43:30,070 INFO L87 Difference]: Start difference. First operand 333 states and 1057 transitions. Second operand has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:33,727 INFO L93 Difference]: Finished difference Result 585 states and 1747 transitions. [2022-11-25 23:43:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 23:43:33,728 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:43:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:33,731 INFO L225 Difference]: With dead ends: 585 [2022-11-25 23:43:33,732 INFO L226 Difference]: Without dead ends: 571 [2022-11-25 23:43:33,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=356, Invalid=1806, Unknown=0, NotChecked=0, Total=2162 [2022-11-25 23:43:33,733 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 192 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:33,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 175 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-25 23:43:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-11-25 23:43:33,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 357. [2022-11-25 23:43:33,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 3.188202247191011) internal successors, (1135), 356 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1135 transitions. [2022-11-25 23:43:33,748 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1135 transitions. Word has length 23 [2022-11-25 23:43:33,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:33,749 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 1135 transitions. [2022-11-25 23:43:33,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1135 transitions. [2022-11-25 23:43:33,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:43:33,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:33,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:33,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:33,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 23:43:33,951 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:43:33,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash 620659845, now seen corresponding path program 7 times [2022-11-25 23:43:33,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:33,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716523187] [2022-11-25 23:43:33,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:33,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:34,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:34,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716523187] [2022-11-25 23:43:34,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716523187] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:34,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353663107] [2022-11-25 23:43:34,830 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:43:34,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:34,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:34,832 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:34,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:43:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:34,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-25 23:43:34,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:35,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:43:35,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:43:35,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:43:35,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:43:35,559 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 58 treesize of output 38 [2022-11-25 23:43:35,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:35,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:36,625 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (= c_~max1~0 c_~max2~0)) (.cse3 (< c_~max2~0 c_~max3~0)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse13 (<= c_~max3~0 c_~max2~0))) (and (or (forall ((v_ArrVal_442 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base))) (let ((.cse2 (select .cse0 c_~A~0.offset))) (or (< c_~max3~0 (select .cse0 .cse1)) (= .cse2 c_~max2~0) (not (< c_~max1~0 .cse2)))))) .cse3) (forall ((v_ArrVal_442 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base))) (let ((.cse4 (select .cse5 .cse1))) (or (<= .cse4 c_~max2~0) (not (< c_~max3~0 .cse4)) (< c_~max1~0 (select .cse5 c_~A~0.offset)) (= c_~max1~0 .cse4))))) (forall ((v_ArrVal_442 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset)) (.cse6 (select .cse8 .cse1))) (or (< c_~max2~0 .cse6) (= .cse7 c_~max2~0) (not (< c_~max1~0 .cse7)) (not (< c_~max3~0 .cse6)))))) (or .cse9 (forall ((v_ArrVal_442 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse1))) (or (< c_~max2~0 .cse10) (not (< c_~max3~0 .cse10)) (< c_~max1~0 (select .cse11 c_~A~0.offset))))))) (or (forall ((v_ArrVal_442 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base))) (or (< c_~max3~0 (select .cse12 .cse1)) (< c_~max1~0 (select .cse12 c_~A~0.offset))))) (and (or .cse9 .cse3) (or (= c_~max1~0 c_~max3~0) .cse13))) (forall ((v_ArrVal_442 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base))) (let ((.cse15 (select .cse16 c_~A~0.offset)) (.cse14 (select .cse16 .cse1))) (or (<= .cse14 c_~max2~0) (= .cse15 .cse14) (not (< c_~max1~0 .cse15)) (not (< c_~max3~0 .cse14)))))) (or (forall ((v_ArrVal_442 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base))) (let ((.cse18 (select .cse17 c_~A~0.offset))) (or (< c_~max3~0 (select .cse17 .cse1)) (not (< c_~max1~0 .cse18)) (= .cse18 c_~max3~0))))) .cse13))) is different from false [2022-11-25 23:43:37,034 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0)) (.cse6 (<= c_~max3~0 c_~max2~0)) (.cse7 (< c_~max2~0 c_~max3~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_441) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base))) (let ((.cse2 (select .cse1 .cse3))) (or (< c_~max1~0 (select .cse1 c_~A~0.offset)) (not (< c_~max3~0 .cse2)) (< c_~max2~0 .cse2)))))) (or (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_441) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base))) (let ((.cse5 (select .cse4 c_~A~0.offset))) (or (< c_~max3~0 (select .cse4 .cse3)) (= .cse5 c_~max3~0) (not (< c_~max1~0 .cse5)))))) .cse6) (or (and (or .cse0 .cse7) (or (= c_~max1~0 c_~max3~0) .cse6)) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_441) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base))) (or (< c_~max3~0 (select .cse8 .cse3)) (< c_~max1~0 (select .cse8 c_~A~0.offset)))))) (or (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_441) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base))) (let ((.cse10 (select .cse9 c_~A~0.offset))) (or (< c_~max3~0 (select .cse9 .cse3)) (not (< c_~max1~0 .cse10)) (= .cse10 c_~max2~0))))) .cse7) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_441) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse3))) (or (= c_~max1~0 .cse11) (< c_~max1~0 (select .cse12 c_~A~0.offset)) (not (< c_~max3~0 .cse11)) (<= .cse11 c_~max2~0))))) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_441) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse3)) (.cse13 (select .cse15 c_~A~0.offset))) (or (not (< c_~max1~0 .cse13)) (not (< c_~max3~0 .cse14)) (< c_~max2~0 .cse14) (= .cse13 c_~max2~0))))) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_441) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base))) (let ((.cse17 (select .cse18 c_~A~0.offset)) (.cse16 (select .cse18 .cse3))) (or (= .cse16 .cse17) (not (< c_~max1~0 .cse17)) (not (< c_~max3~0 .cse16)) (<= .cse16 c_~max2~0))))))) is different from false [2022-11-25 23:43:40,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:40,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 104 [2022-11-25 23:43:40,768 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-25 23:43:40,769 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 1195 treesize of output 1136 [2022-11-25 23:43:40,795 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 23:43:40,796 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 1131 treesize of output 1043 [2022-11-25 23:43:40,821 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 23:43:40,822 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 1043 treesize of output 867 [2022-11-25 23:43:40,853 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 23:43:40,854 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 669 treesize of output 625 [2022-11-25 23:43:41,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:41,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 70 [2022-11-25 23:43:41,936 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:43:41,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 1721 treesize of output 1645 [2022-11-25 23:43:41,987 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:43:41,988 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 1641 treesize of output 1533 [2022-11-25 23:43:42,039 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:43:42,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1529 treesize of output 1309 [2022-11-25 23:43:42,087 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:43:42,088 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 1305 treesize of output 1253 [2022-11-25 23:44:23,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:44:23,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2022-11-25 23:44:23,998 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:44:23,999 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 2231 treesize of output 2139 [2022-11-25 23:44:24,047 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:44:24,048 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 2135 treesize of output 2011 [2022-11-25 23:44:24,113 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:44:24,114 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 2007 treesize of output 1947 [2022-11-25 23:44:24,179 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:44:24,180 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 1943 treesize of output 1691 [2022-11-25 23:44:31,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:44:31,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2022-11-25 23:44:31,037 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:44:31,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1593 treesize of output 1533 [2022-11-25 23:44:31,079 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:44:31,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1529 treesize of output 1373 [2022-11-25 23:44:31,121 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:44:31,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1369 treesize of output 1293 [2022-11-25 23:44:31,167 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:44:31,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 885 treesize of output 849 [2022-11-25 23:44:32,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:44:32,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2022-11-25 23:44:32,221 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:44:32,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2187 treesize of output 2095 [2022-11-25 23:44:32,274 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:44:32,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2091 treesize of output 1967 [2022-11-25 23:44:32,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:32,317 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 1015 treesize of output 951 [2022-11-25 23:44:32,348 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:44:32,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1899 treesize of output 1647 [2022-11-25 23:44:43,299 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:44:43,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 1 [2022-11-25 23:44:43,312 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:44:43,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 1 [2022-11-25 23:44:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:44:43,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353663107] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:44:43,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1478809993] [2022-11-25 23:44:43,436 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:44:43,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:44:43,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-11-25 23:44:43,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936866899] [2022-11-25 23:44:43,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:44:43,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 23:44:43,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:44:43,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 23:44:43,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=592, Unknown=2, NotChecked=102, Total=812 [2022-11-25 23:44:43,441 INFO L87 Difference]: Start difference. First operand 357 states and 1135 transitions. Second operand has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:44:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:44:46,512 INFO L93 Difference]: Finished difference Result 619 states and 1920 transitions. [2022-11-25 23:44:46,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 23:44:46,513 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:44:46,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:44:46,516 INFO L225 Difference]: With dead ends: 619 [2022-11-25 23:44:46,517 INFO L226 Difference]: Without dead ends: 605 [2022-11-25 23:44:46,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=308, Invalid=1504, Unknown=2, NotChecked=166, Total=1980 [2022-11-25 23:44:46,518 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 176 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 270 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:44:46,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 171 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1237 Invalid, 0 Unknown, 270 Unchecked, 1.6s Time] [2022-11-25 23:44:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-11-25 23:44:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 365. [2022-11-25 23:44:46,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 3.2115384615384617) internal successors, (1169), 364 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:44:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1169 transitions. [2022-11-25 23:44:46,533 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 1169 transitions. Word has length 23 [2022-11-25 23:44:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:44:46,533 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 1169 transitions. [2022-11-25 23:44:46,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:44:46,534 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1169 transitions. [2022-11-25 23:44:46,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:44:46,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:44:46,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:44:46,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:44:46,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 23:44:46,741 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:44:46,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:44:46,742 INFO L85 PathProgramCache]: Analyzing trace with hash 149842551, now seen corresponding path program 8 times [2022-11-25 23:44:46,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:44:46,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168755734] [2022-11-25 23:44:46,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:44:46,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:44:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:44:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:44:47,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:44:47,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168755734] [2022-11-25 23:44:47,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168755734] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:44:47,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496014646] [2022-11-25 23:44:47,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:44:47,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:44:47,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:44:47,702 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:44:47,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 23:44:47,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:44:47,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:44:47,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-25 23:44:47,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:44:48,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:44:48,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 81 [2022-11-25 23:44:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:44:48,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:44:48,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:44:48,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 119 treesize of output 75 [2022-11-25 23:44:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:44:49,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496014646] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:44:49,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [257463589] [2022-11-25 23:44:49,550 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:44:49,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:44:49,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2022-11-25 23:44:49,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419561155] [2022-11-25 23:44:49,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:44:49,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 23:44:49,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:44:49,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 23:44:49,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2022-11-25 23:44:49,552 INFO L87 Difference]: Start difference. First operand 365 states and 1169 transitions. Second operand has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:44:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:44:50,991 INFO L93 Difference]: Finished difference Result 456 states and 1388 transitions. [2022-11-25 23:44:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:44:50,991 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:44:50,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:44:50,995 INFO L225 Difference]: With dead ends: 456 [2022-11-25 23:44:50,995 INFO L226 Difference]: Without dead ends: 449 [2022-11-25 23:44:50,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=357, Invalid=1283, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 23:44:50,996 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 137 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:44:50,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 47 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:44:50,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-11-25 23:44:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 373. [2022-11-25 23:44:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 3.2016129032258065) internal successors, (1191), 372 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:44:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1191 transitions. [2022-11-25 23:44:51,011 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1191 transitions. Word has length 23 [2022-11-25 23:44:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:44:51,011 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 1191 transitions. [2022-11-25 23:44:51,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:44:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1191 transitions. [2022-11-25 23:44:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:44:51,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:44:51,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:44:51,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:44:51,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:44:51,220 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:44:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:44:51,220 INFO L85 PathProgramCache]: Analyzing trace with hash -132080153, now seen corresponding path program 9 times [2022-11-25 23:44:51,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:44:51,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583094893] [2022-11-25 23:44:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:44:51,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:44:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:44:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:44:52,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:44:52,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583094893] [2022-11-25 23:44:52,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583094893] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:44:52,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211647221] [2022-11-25 23:44:52,398 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:44:52,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:44:52,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:44:52,400 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:44:52,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 23:44:52,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:44:52,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:44:52,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 23:44:52,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:44:52,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:44:52,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 46 [2022-11-25 23:44:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:44:53,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:44:53,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:44:53,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 127 treesize of output 75 [2022-11-25 23:44:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:44:53,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211647221] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:44:53,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [491840071] [2022-11-25 23:44:53,896 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:44:53,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:44:53,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 25 [2022-11-25 23:44:53,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243301761] [2022-11-25 23:44:53,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:44:53,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 23:44:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:44:53,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 23:44:53,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2022-11-25 23:44:53,899 INFO L87 Difference]: Start difference. First operand 373 states and 1191 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:44:57,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:44:57,891 INFO L93 Difference]: Finished difference Result 693 states and 2106 transitions. [2022-11-25 23:44:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-25 23:44:57,891 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:44:57,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:44:57,895 INFO L225 Difference]: With dead ends: 693 [2022-11-25 23:44:57,896 INFO L226 Difference]: Without dead ends: 637 [2022-11-25 23:44:57,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=633, Invalid=2673, Unknown=0, NotChecked=0, Total=3306 [2022-11-25 23:44:57,897 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 258 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:44:57,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 155 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-25 23:44:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-11-25 23:44:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 379. [2022-11-25 23:44:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.2222222222222223) internal successors, (1218), 378 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:44:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1218 transitions. [2022-11-25 23:44:57,913 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1218 transitions. Word has length 23 [2022-11-25 23:44:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:44:57,913 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 1218 transitions. [2022-11-25 23:44:57,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:44:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1218 transitions. [2022-11-25 23:44:57,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:44:57,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:44:57,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:44:57,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 23:44:58,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:44:58,133 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:44:58,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:44:58,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1854093739, now seen corresponding path program 10 times [2022-11-25 23:44:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:44:58,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316924886] [2022-11-25 23:44:58,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:44:58,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:44:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:44:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:44:58,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:44:58,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316924886] [2022-11-25 23:44:58,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316924886] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:44:58,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676342070] [2022-11-25 23:44:58,979 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:44:58,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:44:58,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:44:58,982 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:44:58,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 23:44:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:44:59,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 23:44:59,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:44:59,602 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-25 23:44:59,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2022-11-25 23:44:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:44:59,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:45:00,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:00,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 75 [2022-11-25 23:45:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:00,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676342070] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:45:00,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1083400477] [2022-11-25 23:45:00,496 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:45:00,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:45:00,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2022-11-25 23:45:00,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993651854] [2022-11-25 23:45:00,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:45:00,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 23:45:00,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:45:00,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 23:45:00,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-11-25 23:45:00,498 INFO L87 Difference]: Start difference. First operand 379 states and 1218 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:45:02,054 INFO L93 Difference]: Finished difference Result 593 states and 1855 transitions. [2022-11-25 23:45:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 23:45:02,055 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:45:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:45:02,057 INFO L225 Difference]: With dead ends: 593 [2022-11-25 23:45:02,057 INFO L226 Difference]: Without dead ends: 579 [2022-11-25 23:45:02,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 23:45:02,057 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 163 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:45:02,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 62 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:45:02,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-11-25 23:45:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 389. [2022-11-25 23:45:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 3.2190721649484537) internal successors, (1249), 388 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1249 transitions. [2022-11-25 23:45:02,072 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1249 transitions. Word has length 23 [2022-11-25 23:45:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:45:02,073 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 1249 transitions. [2022-11-25 23:45:02,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1249 transitions. [2022-11-25 23:45:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:45:02,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:45:02,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:45:02,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-25 23:45:02,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 23:45:02,281 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:45:02,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:45:02,281 INFO L85 PathProgramCache]: Analyzing trace with hash -321822971, now seen corresponding path program 11 times [2022-11-25 23:45:02,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:45:02,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780597956] [2022-11-25 23:45:02,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:45:02,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:45:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:45:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:03,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:45:03,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780597956] [2022-11-25 23:45:03,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780597956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:45:03,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646857088] [2022-11-25 23:45:03,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:45:03,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:45:03,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:45:03,147 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:45:03,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 23:45:03,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:45:03,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:45:03,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-25 23:45:03,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:45:03,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:03,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:45:03,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:04,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 46 [2022-11-25 23:45:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:04,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:45:05,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:05,081 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 276 treesize of output 276 [2022-11-25 23:45:05,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 163 [2022-11-25 23:45:05,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 157 [2022-11-25 23:45:05,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 145 [2022-11-25 23:45:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:10,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646857088] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:45:10,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [940609555] [2022-11-25 23:45:10,925 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:45:10,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:45:10,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-11-25 23:45:10,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44500464] [2022-11-25 23:45:10,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:45:10,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 23:45:10,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:45:10,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 23:45:10,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=955, Unknown=1, NotChecked=0, Total=1122 [2022-11-25 23:45:10,928 INFO L87 Difference]: Start difference. First operand 389 states and 1249 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:45:12,447 INFO L93 Difference]: Finished difference Result 516 states and 1572 transitions. [2022-11-25 23:45:12,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:45:12,452 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:45:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:45:12,455 INFO L225 Difference]: With dead ends: 516 [2022-11-25 23:45:12,455 INFO L226 Difference]: Without dead ends: 509 [2022-11-25 23:45:12,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=324, Invalid=1567, Unknown=1, NotChecked=0, Total=1892 [2022-11-25 23:45:12,458 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 142 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:45:12,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 54 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:45:12,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-11-25 23:45:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 392. [2022-11-25 23:45:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.214833759590793) internal successors, (1257), 391 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1257 transitions. [2022-11-25 23:45:12,478 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1257 transitions. Word has length 23 [2022-11-25 23:45:12,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:45:12,479 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 1257 transitions. [2022-11-25 23:45:12,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1257 transitions. [2022-11-25 23:45:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:45:12,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:45:12,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:45:12,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 23:45:12,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 23:45:12,687 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:45:12,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:45:12,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1097203797, now seen corresponding path program 12 times [2022-11-25 23:45:12,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:45:12,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086742769] [2022-11-25 23:45:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:45:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:45:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:45:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:13,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:45:13,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086742769] [2022-11-25 23:45:13,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086742769] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:45:13,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43190882] [2022-11-25 23:45:13,636 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:45:13,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:45:13,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:45:13,638 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:45:13,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 23:45:13,759 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:45:13,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:45:13,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 23:45:13,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:45:14,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:14,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:45:14,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:45:14,404 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:14,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2022-11-25 23:45:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:45:14,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:45:14,933 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~M~0 c_~N~0)) (let ((.cse2 (= c_~max1~0 c_~max2~0)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (forall ((v_ArrVal_664 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_664) c_~A~0.base) .cse1))) (or (not (< c_~max3~0 .cse0)) (< c_~max2~0 .cse0)))) .cse2) (or (and (or .cse2 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_664 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_664) c_~A~0.base) .cse1)))) (forall ((v_ArrVal_664 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_664) c_~A~0.base) .cse1))) (or (not (< c_~max3~0 .cse3)) (<= .cse3 c_~max2~0) (= c_~max1~0 .cse3))))))) is different from false [2022-11-25 23:45:15,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:15,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 189 [2022-11-25 23:45:15,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 136 [2022-11-25 23:45:15,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 130 [2022-11-25 23:45:15,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 118 [2022-11-25 23:45:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:45:15,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43190882] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:45:15,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1474740502] [2022-11-25 23:45:15,708 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:45:15,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:45:15,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2022-11-25 23:45:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292674376] [2022-11-25 23:45:15,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:45:15,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 23:45:15,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:45:15,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 23:45:15,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=640, Unknown=2, NotChecked=52, Total=812 [2022-11-25 23:45:15,711 INFO L87 Difference]: Start difference. First operand 392 states and 1257 transitions. Second operand has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:25,392 WARN L233 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 69 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:45:36,894 WARN L233 SmtUtils]: Spent 8.32s on a formula simplification. DAG size of input: 77 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:45:43,848 WARN L233 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 72 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:45:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:45:45,002 INFO L93 Difference]: Finished difference Result 1006 states and 3041 transitions. [2022-11-25 23:45:45,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-25 23:45:45,003 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:45:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:45:45,008 INFO L225 Difference]: With dead ends: 1006 [2022-11-25 23:45:45,008 INFO L226 Difference]: Without dead ends: 985 [2022-11-25 23:45:45,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=565, Invalid=3464, Unknown=7, NotChecked=124, Total=4160 [2022-11-25 23:45:45,009 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 300 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 46 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 2653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:45:45,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 149 Invalid, 2653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2373 Invalid, 16 Unknown, 218 Unchecked, 2.6s Time] [2022-11-25 23:45:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2022-11-25 23:45:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 492. [2022-11-25 23:45:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 3.2362525458248474) internal successors, (1589), 491 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:45,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1589 transitions. [2022-11-25 23:45:45,031 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1589 transitions. Word has length 23 [2022-11-25 23:45:45,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:45:45,031 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 1589 transitions. [2022-11-25 23:45:45,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:45,031 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1589 transitions. [2022-11-25 23:45:45,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:45:45,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:45:45,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:45:45,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 23:45:45,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 23:45:45,240 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:45:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:45:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash 406091935, now seen corresponding path program 13 times [2022-11-25 23:45:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:45:45,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255670984] [2022-11-25 23:45:45,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:45:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:45:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:45:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:46,079 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:45:46,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255670984] [2022-11-25 23:45:46,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255670984] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:45:46,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936202083] [2022-11-25 23:45:46,080 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:45:46,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:45:46,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:45:46,084 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:45:46,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 23:45:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:45:46,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-25 23:45:46,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:45:46,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:46,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:45:46,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:45:46,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:46,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2022-11-25 23:45:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:46,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:45:47,296 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_709 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_709) c_~A~0.base) .cse1)))) (or (forall ((v_ArrVal_709 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_709) c_~A~0.base) .cse1))) (or (not (< c_~max3~0 .cse2)) (< c_~max2~0 .cse2)))) .cse0) (forall ((v_ArrVal_709 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_709) c_~A~0.base) .cse1))) (or (<= .cse3 c_~max2~0) (not (< c_~max3~0 .cse3)) (= c_~max1~0 .cse3)))))) is different from false [2022-11-25 23:45:47,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:47,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 249 treesize of output 189 [2022-11-25 23:45:47,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 142 [2022-11-25 23:45:47,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 124 [2022-11-25 23:45:47,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 118 [2022-11-25 23:45:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:47,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936202083] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:45:47,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [759682965] [2022-11-25 23:45:47,908 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:45:47,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:45:47,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-11-25 23:45:47,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614084057] [2022-11-25 23:45:47,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:45:47,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 23:45:47,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:45:47,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 23:45:47,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=507, Unknown=1, NotChecked=46, Total=650 [2022-11-25 23:45:47,910 INFO L87 Difference]: Start difference. First operand 492 states and 1589 transitions. Second operand has 26 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:45:49,132 INFO L93 Difference]: Finished difference Result 747 states and 2386 transitions. [2022-11-25 23:45:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:45:49,132 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:45:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:45:49,136 INFO L225 Difference]: With dead ends: 747 [2022-11-25 23:45:49,136 INFO L226 Difference]: Without dead ends: 740 [2022-11-25 23:45:49,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=171, Invalid=824, Unknown=1, NotChecked=60, Total=1056 [2022-11-25 23:45:49,137 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 176 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:45:49,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 83 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 817 Invalid, 0 Unknown, 85 Unchecked, 0.7s Time] [2022-11-25 23:45:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-11-25 23:45:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 493. [2022-11-25 23:45:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 3.2439024390243905) internal successors, (1596), 492 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1596 transitions. [2022-11-25 23:45:49,154 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1596 transitions. Word has length 23 [2022-11-25 23:45:49,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:45:49,154 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 1596 transitions. [2022-11-25 23:45:49,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1596 transitions. [2022-11-25 23:45:49,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:45:49,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:45:49,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:45:49,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 23:45:49,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 23:45:49,362 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:45:49,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:45:49,363 INFO L85 PathProgramCache]: Analyzing trace with hash 702726977, now seen corresponding path program 14 times [2022-11-25 23:45:49,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:45:49,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206238602] [2022-11-25 23:45:49,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:45:49,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:45:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:45:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:50,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:45:50,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206238602] [2022-11-25 23:45:50,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206238602] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:45:50,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935676475] [2022-11-25 23:45:50,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:45:50,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:45:50,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:45:50,127 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:45:50,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 23:45:50,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:45:50,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:45:50,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 23:45:50,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:45:50,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:50,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 81 [2022-11-25 23:45:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:51,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:45:51,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:51,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 75 [2022-11-25 23:45:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:52,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935676475] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:45:52,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [309360722] [2022-11-25 23:45:52,148 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:45:52,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:45:52,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 25 [2022-11-25 23:45:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083748076] [2022-11-25 23:45:52,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:45:52,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 23:45:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:45:52,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 23:45:52,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2022-11-25 23:45:52,151 INFO L87 Difference]: Start difference. First operand 493 states and 1596 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:45:54,669 INFO L93 Difference]: Finished difference Result 700 states and 2127 transitions. [2022-11-25 23:45:54,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 23:45:54,669 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:45:54,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:45:54,674 INFO L225 Difference]: With dead ends: 700 [2022-11-25 23:45:54,674 INFO L226 Difference]: Without dead ends: 679 [2022-11-25 23:45:54,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=501, Invalid=1479, Unknown=0, NotChecked=0, Total=1980 [2022-11-25 23:45:54,675 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 163 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:45:54,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 94 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-25 23:45:54,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-11-25 23:45:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 491. [2022-11-25 23:45:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 3.2346938775510203) internal successors, (1585), 490 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 1585 transitions. [2022-11-25 23:45:54,692 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 1585 transitions. Word has length 23 [2022-11-25 23:45:54,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:45:54,692 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 1585 transitions. [2022-11-25 23:45:54,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 1585 transitions. [2022-11-25 23:45:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:45:54,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:45:54,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:45:54,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-25 23:45:54,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 23:45:54,900 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:45:54,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:45:54,901 INFO L85 PathProgramCache]: Analyzing trace with hash -554360809, now seen corresponding path program 15 times [2022-11-25 23:45:54,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:45:54,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857111385] [2022-11-25 23:45:54,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:45:54,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:45:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:45:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:55,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:45:55,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857111385] [2022-11-25 23:45:55,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857111385] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:45:55,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436439201] [2022-11-25 23:45:55,986 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:45:55,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:45:55,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:45:55,987 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:45:55,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 23:45:56,112 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:45:56,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:45:56,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-25 23:45:56,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:45:56,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:45:56,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:45:56,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:56,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:45:56,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:56,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:45:56,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:45:56,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:56,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 66 treesize of output 39 [2022-11-25 23:45:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:57,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:45:57,464 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (forall ((v_ArrVal_802 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) .cse2))) (or (not (< c_~max3~0 .cse1)) (< c_~max2~0 .cse1))))) (or (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_802 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) .cse2)))) (forall ((v_ArrVal_802 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) .cse2))) (or (= c_~max1~0 .cse3) (<= .cse3 c_~max2~0) (not (< c_~max3~0 .cse3))))))) is different from false [2022-11-25 23:45:57,591 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_~max1~0 c_~max2~0)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) .cse1))) (or (< c_~max2~0 .cse0) (not (< c_~max3~0 .cse0))))) .cse2) (or (and (or .cse2 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) .cse1)))) (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) .cse1))) (or (<= .cse3 c_~max2~0) (= .cse3 c_~max1~0) (not (< c_~max3~0 .cse3))))))) is different from false [2022-11-25 23:45:58,984 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (= c_~max1~0 c_~max2~0)) (.cse6 (< c_~max2~0 c_~max3~0)) (.cse3 (<= c_~max3~0 c_~max2~0))) (and (forall ((~M~0 Int)) (or (forall ((v_ArrVal_800 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_800))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< c_~max1~0 .cse0)) (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse1 c_~max2~0) (not (< c_~max3~0 .cse1)) (= .cse1 .cse0)))))))) (< 0 ~M~0) (< ~M~0 0))) (or .cse3 (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (~M~0 Int) (v_ArrVal_802 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_800))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 ~M~0) (< c_~max3~0 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= .cse5 c_~max3~0) (not (< c_~max1~0 .cse5)) (< ~M~0 0)))))) (or .cse6 (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (~M~0 Int) (v_ArrVal_802 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_800))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 ~M~0) (< c_~max3~0 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= .cse8 c_~max2~0) (not (< c_~max1~0 .cse8)) (< ~M~0 0)))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_800 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_800))) (or (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (let ((.cse9 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse9 c_~max2~0) (not (< c_~max3~0 .cse9)) (= c_~max1~0 .cse9)))) (< c_~max1~0 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_800 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_800))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse11 c_~max2~0) (not (< c_~max1~0 .cse11)) (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (let ((.cse12 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse12)) (< c_~max2~0 .cse12)))))))))) (or (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (~M~0 Int) (v_ArrVal_802 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_800))) (let ((.cse15 (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< 0 ~M~0) (< ~M~0 0) (< c_~max1~0 (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (< c_~max3~0 .cse15)) (< c_~max2~0 .cse15))))) .cse16) (or (and (or .cse16 .cse6) (or (= c_~max1~0 c_~max3~0) .cse3)) (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (~M~0 Int) (v_ArrVal_802 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_800))) (or (< 0 ~M~0) (< c_~max3~0 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< ~M~0 0) (< c_~max1~0 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) is different from false [2022-11-25 23:45:59,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:59,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 84 [2022-11-25 23:45:59,123 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:45:59,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 1870 treesize of output 1774 [2022-11-25 23:45:59,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1753 treesize of output 1609 [2022-11-25 23:45:59,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1609 treesize of output 1321 [2022-11-25 23:45:59,212 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:45:59,213 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 1330 treesize of output 1260 [2022-11-25 23:46:03,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:03,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 64 [2022-11-25 23:46:03,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:03,136 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:03,149 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:46:03,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 83 treesize of output 67 [2022-11-25 23:46:03,165 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:46:03,166 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 47 treesize of output 37 [2022-11-25 23:46:03,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:03,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2022-11-25 23:46:03,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:03,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:03,262 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:46:03,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 75 treesize of output 63 [2022-11-25 23:46:03,284 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:46:03,285 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 43 treesize of output 37 [2022-11-25 23:46:03,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:03,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2022-11-25 23:46:03,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:03,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:03,360 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:46:03,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 75 treesize of output 63 [2022-11-25 23:46:03,378 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:46:03,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2022-11-25 23:46:03,441 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:46:03,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 1 [2022-11-25 23:46:03,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:03,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2022-11-25 23:46:03,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:03,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:03,473 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:46:03,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 51 treesize of output 43 [2022-11-25 23:46:03,488 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:46:03,489 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 23 treesize of output 19 [2022-11-25 23:46:03,524 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:46:03,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 1 [2022-11-25 23:46:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 23:46:03,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436439201] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:03,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [575802013] [2022-11-25 23:46:03,623 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:03,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:03,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-11-25 23:46:03,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055677015] [2022-11-25 23:46:03,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:03,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 23:46:03,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:03,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 23:46:03,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=648, Unknown=4, NotChecked=162, Total=930 [2022-11-25 23:46:03,625 INFO L87 Difference]: Start difference. First operand 491 states and 1585 transitions. Second operand has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:04,783 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse5 (= c_~max1~0 c_~max2~0))) (let ((.cse0 (or (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) .cse4))) (or (< c_~max2~0 .cse6) (not (< c_~max3~0 .cse6))))) .cse5)) (.cse1 (or (and (or .cse5 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) .cse4))))) (.cse2 (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) .cse4))) (or (<= .cse3 c_~max2~0) (= .cse3 c_~max1~0) (not (< c_~max3~0 .cse3))))))) (and .cse0 (or (and .cse0 .cse1 .cse2) (< c_thread1Thread1of1ForFork2_~i~0 c_~N~0)) .cse1 .cse2))) is different from false [2022-11-25 23:46:05,769 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max3~0))) (and (or (and .cse0 (<= (+ c_~max2~0 1) c_~max3~0)) (and .cse0 (= c_~max1~0 0) (= c_~max2~0 0)) (<= (+ c_thread3Thread1of1ForFork1_~i~2 1) c_~N~0)) (or (let ((.cse3 (= c_~max1~0 c_~max2~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) .cse2))) (or (< c_~max2~0 .cse1) (not (< c_~max3~0 .cse1))))) .cse3) (or (and (or .cse3 (< c_~max2~0 c_~max3~0)) (or .cse0 (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) .cse2)))) (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) .cse2))) (or (<= .cse4 c_~max2~0) (= .cse4 c_~max1~0) (not (< c_~max3~0 .cse4))))))) (< c_thread1Thread1of1ForFork2_~i~0 c_~N~0)))) is different from false [2022-11-25 23:46:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:08,462 INFO L93 Difference]: Finished difference Result 1123 states and 3470 transitions. [2022-11-25 23:46:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 23:46:08,462 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:46:08,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:08,466 INFO L225 Difference]: With dead ends: 1123 [2022-11-25 23:46:08,466 INFO L226 Difference]: Without dead ends: 1097 [2022-11-25 23:46:08,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=294, Invalid=1603, Unknown=15, NotChecked=440, Total=2352 [2022-11-25 23:46:08,467 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 388 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 37 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 394 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:08,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 129 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1241 Invalid, 31 Unknown, 394 Unchecked, 1.9s Time] [2022-11-25 23:46:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-11-25 23:46:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 623. [2022-11-25 23:46:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 622 states have (on average 3.3183279742765275) internal successors, (2064), 622 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 2064 transitions. [2022-11-25 23:46:08,490 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 2064 transitions. Word has length 23 [2022-11-25 23:46:08,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:08,490 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 2064 transitions. [2022-11-25 23:46:08,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 2064 transitions. [2022-11-25 23:46:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:46:08,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:08,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:08,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:08,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:08,700 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:08,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1500203485, now seen corresponding path program 16 times [2022-11-25 23:46:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:08,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780031463] [2022-11-25 23:46:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:08,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:09,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:09,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780031463] [2022-11-25 23:46:09,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780031463] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:09,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566841270] [2022-11-25 23:46:09,722 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:46:09,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:09,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:09,723 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:09,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 23:46:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:09,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 23:46:09,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:10,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:10,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:46:10,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:10,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:46:10,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:10,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:10,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2022-11-25 23:46:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:10,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:11,309 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_~max1~0 c_~max2~0)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_847 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_847) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_848) c_~A~0.base) .cse1))) (or (not (< c_~max3~0 .cse0)) (<= .cse0 c_~max2~0) (= .cse0 c_~max1~0)))) (or .cse2 (forall ((v_ArrVal_847 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_847) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_848) c_~A~0.base) .cse1))) (or (not (< c_~max3~0 .cse3)) (< c_~max2~0 .cse3))))) (or (and (or .cse2 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_847 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_847) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_848) c_~A~0.base) .cse1)))))) is different from false [2022-11-25 23:46:11,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:11,334 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 559 treesize of output 491 [2022-11-25 23:46:11,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 456 treesize of output 444 [2022-11-25 23:46:11,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 444 treesize of output 420 [2022-11-25 23:46:11,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 420 treesize of output 396 [2022-11-25 23:46:11,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 396 treesize of output 384 [2022-11-25 23:46:11,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 348 [2022-11-25 23:46:11,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 348 treesize of output 330 [2022-11-25 23:46:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:12,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566841270] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:12,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1845575535] [2022-11-25 23:46:12,169 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:12,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:12,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-25 23:46:12,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096381329] [2022-11-25 23:46:12,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:12,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 23:46:12,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:12,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 23:46:12,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=601, Unknown=3, NotChecked=50, Total=756 [2022-11-25 23:46:12,171 INFO L87 Difference]: Start difference. First operand 623 states and 2064 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 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-11-25 23:46:19,460 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 61 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:46:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:19,848 INFO L93 Difference]: Finished difference Result 819 states and 2599 transitions. [2022-11-25 23:46:19,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:46:19,848 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:46:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:19,852 INFO L225 Difference]: With dead ends: 819 [2022-11-25 23:46:19,852 INFO L226 Difference]: Without dead ends: 812 [2022-11-25 23:46:19,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=194, Invalid=997, Unknown=3, NotChecked=66, Total=1260 [2022-11-25 23:46:19,853 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 261 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:19,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 64 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 670 Invalid, 0 Unknown, 77 Unchecked, 0.8s Time] [2022-11-25 23:46:19,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-25 23:46:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 614. [2022-11-25 23:46:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 3.305057096247961) internal successors, (2026), 613 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 2026 transitions. [2022-11-25 23:46:19,872 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 2026 transitions. Word has length 23 [2022-11-25 23:46:19,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:19,873 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 2026 transitions. [2022-11-25 23:46:19,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 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-11-25 23:46:19,873 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 2026 transitions. [2022-11-25 23:46:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:46:19,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:19,875 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:19,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-25 23:46:20,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:20,088 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1869833503, now seen corresponding path program 17 times [2022-11-25 23:46:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:20,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717783356] [2022-11-25 23:46:20,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:20,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:20,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:20,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717783356] [2022-11-25 23:46:20,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717783356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:20,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18361628] [2022-11-25 23:46:20,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:46:20,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:20,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:20,200 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:20,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-25 23:46:20,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:46:20,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:46:20,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:46:20,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:20,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:20,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18361628] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:20,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1070764735] [2022-11-25 23:46:20,530 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:20,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:20,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2022-11-25 23:46:20,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172060599] [2022-11-25 23:46:20,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:20,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 23:46:20,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:20,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 23:46:20,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:46:20,533 INFO L87 Difference]: Start difference. First operand 614 states and 2026 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 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-11-25 23:46:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:21,487 INFO L93 Difference]: Finished difference Result 1091 states and 3236 transitions. [2022-11-25 23:46:21,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 23:46:21,487 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 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 24 [2022-11-25 23:46:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:21,494 INFO L225 Difference]: With dead ends: 1091 [2022-11-25 23:46:21,495 INFO L226 Difference]: Without dead ends: 1081 [2022-11-25 23:46:21,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 23:46:21,496 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 321 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:21,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 56 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:46:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-11-25 23:46:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 624. [2022-11-25 23:46:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 3.211878009630819) internal successors, (2001), 623 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 2001 transitions. [2022-11-25 23:46:21,519 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 2001 transitions. Word has length 24 [2022-11-25 23:46:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:21,519 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 2001 transitions. [2022-11-25 23:46:21,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 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-11-25 23:46:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 2001 transitions. [2022-11-25 23:46:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:46:21,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:21,522 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:21,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-25 23:46:21,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-25 23:46:21,728 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:21,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:21,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2134067297, now seen corresponding path program 18 times [2022-11-25 23:46:21,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:21,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431438495] [2022-11-25 23:46:21,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:21,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:21,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:21,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431438495] [2022-11-25 23:46:21,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431438495] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:21,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381042128] [2022-11-25 23:46:21,911 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:46:21,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:21,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:21,912 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:21,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-25 23:46:22,021 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:46:22,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:46:22,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 23:46:22,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:22,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:22,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381042128] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:22,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1785199906] [2022-11-25 23:46:22,275 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:22,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:22,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2022-11-25 23:46:22,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970292514] [2022-11-25 23:46:22,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:22,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 23:46:22,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:22,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 23:46:22,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:46:22,277 INFO L87 Difference]: Start difference. First operand 624 states and 2001 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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-11-25 23:46:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:23,433 INFO L93 Difference]: Finished difference Result 1176 states and 3360 transitions. [2022-11-25 23:46:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 23:46:23,433 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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 24 [2022-11-25 23:46:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:23,437 INFO L225 Difference]: With dead ends: 1176 [2022-11-25 23:46:23,437 INFO L226 Difference]: Without dead ends: 1018 [2022-11-25 23:46:23,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=388, Invalid=1018, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 23:46:23,438 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 376 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:23,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 81 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:46:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2022-11-25 23:46:23,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 645. [2022-11-25 23:46:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 3.124223602484472) internal successors, (2012), 644 states have internal predecessors, (2012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 2012 transitions. [2022-11-25 23:46:23,460 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 2012 transitions. Word has length 24 [2022-11-25 23:46:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:23,460 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 2012 transitions. [2022-11-25 23:46:23,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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-11-25 23:46:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 2012 transitions. [2022-11-25 23:46:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:46:23,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:23,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:23,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:23,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-25 23:46:23,669 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:23,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1258965022, now seen corresponding path program 1 times [2022-11-25 23:46:23,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:23,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512985415] [2022-11-25 23:46:23,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:23,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:23,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:23,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512985415] [2022-11-25 23:46:23,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512985415] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:23,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972552472] [2022-11-25 23:46:23,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:23,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:23,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:23,808 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:23,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-25 23:46:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:23,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 23:46:23,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:24,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:24,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972552472] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:24,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1030522122] [2022-11-25 23:46:24,124 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:24,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:24,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-11-25 23:46:24,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831523119] [2022-11-25 23:46:24,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:24,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 23:46:24,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:24,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 23:46:24,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:46:24,126 INFO L87 Difference]: Start difference. First operand 645 states and 2012 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 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-11-25 23:46:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:24,592 INFO L93 Difference]: Finished difference Result 774 states and 2297 transitions. [2022-11-25 23:46:24,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:46:24,592 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 23:46:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:24,596 INFO L225 Difference]: With dead ends: 774 [2022-11-25 23:46:24,596 INFO L226 Difference]: Without dead ends: 718 [2022-11-25 23:46:24,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2022-11-25 23:46:24,597 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 106 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:24,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 86 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:46:24,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-11-25 23:46:24,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 641. [2022-11-25 23:46:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 3.0890625) internal successors, (1977), 640 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1977 transitions. [2022-11-25 23:46:24,616 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1977 transitions. Word has length 24 [2022-11-25 23:46:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:24,616 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 1977 transitions. [2022-11-25 23:46:24,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 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-11-25 23:46:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1977 transitions. [2022-11-25 23:46:24,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:46:24,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:24,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:24,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:24,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:24,824 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:24,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1015988976, now seen corresponding path program 2 times [2022-11-25 23:46:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:24,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016228261] [2022-11-25 23:46:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:24,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:24,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:24,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016228261] [2022-11-25 23:46:24,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016228261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:24,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005004050] [2022-11-25 23:46:24,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:46:24,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:24,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:24,959 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:24,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-25 23:46:25,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:46:25,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:46:25,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 23:46:25,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:25,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:25,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005004050] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:25,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1731350225] [2022-11-25 23:46:25,339 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:25,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:25,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-11-25 23:46:25,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751476980] [2022-11-25 23:46:25,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:25,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:46:25,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:25,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:46:25,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:46:25,341 INFO L87 Difference]: Start difference. First operand 641 states and 1977 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 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-11-25 23:46:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:25,998 INFO L93 Difference]: Finished difference Result 832 states and 2415 transitions. [2022-11-25 23:46:25,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 23:46:25,998 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 23:46:25,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:26,003 INFO L225 Difference]: With dead ends: 832 [2022-11-25 23:46:26,003 INFO L226 Difference]: Without dead ends: 802 [2022-11-25 23:46:26,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:46:26,004 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 174 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:26,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 73 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:46:26,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-11-25 23:46:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 678. [2022-11-25 23:46:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 3.039881831610044) internal successors, (2058), 677 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 2058 transitions. [2022-11-25 23:46:26,024 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 2058 transitions. Word has length 24 [2022-11-25 23:46:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:26,024 INFO L495 AbstractCegarLoop]: Abstraction has 678 states and 2058 transitions. [2022-11-25 23:46:26,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 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-11-25 23:46:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 2058 transitions. [2022-11-25 23:46:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:46:26,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:26,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:26,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:26,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:26,233 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:26,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:26,233 INFO L85 PathProgramCache]: Analyzing trace with hash 124233368, now seen corresponding path program 3 times [2022-11-25 23:46:26,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:26,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020241981] [2022-11-25 23:46:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:26,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:26,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:26,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020241981] [2022-11-25 23:46:26,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020241981] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:26,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673533496] [2022-11-25 23:46:26,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:46:26,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:26,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:26,367 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:26,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-25 23:46:26,503 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:46:26,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:46:26,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:46:26,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:26,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:26,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673533496] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:26,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [512124310] [2022-11-25 23:46:26,726 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:26,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:26,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2022-11-25 23:46:26,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401300142] [2022-11-25 23:46:26,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:26,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:46:26,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:46:26,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:46:26,729 INFO L87 Difference]: Start difference. First operand 678 states and 2058 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 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-11-25 23:46:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:30,395 INFO L93 Difference]: Finished difference Result 2088 states and 5714 transitions. [2022-11-25 23:46:30,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-25 23:46:30,396 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 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 24 [2022-11-25 23:46:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:30,406 INFO L225 Difference]: With dead ends: 2088 [2022-11-25 23:46:30,406 INFO L226 Difference]: Without dead ends: 1966 [2022-11-25 23:46:30,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4068 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2117, Invalid=10093, Unknown=0, NotChecked=0, Total=12210 [2022-11-25 23:46:30,410 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 438 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:30,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 97 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-25 23:46:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2022-11-25 23:46:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 722. [2022-11-25 23:46:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 3.289875173370319) internal successors, (2372), 721 states have internal predecessors, (2372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 2372 transitions. [2022-11-25 23:46:30,446 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 2372 transitions. Word has length 24 [2022-11-25 23:46:30,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:30,446 INFO L495 AbstractCegarLoop]: Abstraction has 722 states and 2372 transitions. [2022-11-25 23:46:30,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 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-11-25 23:46:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 2372 transitions. [2022-11-25 23:46:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:46:30,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:30,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:30,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:30,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-25 23:46:30,655 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:30,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash 730512618, now seen corresponding path program 4 times [2022-11-25 23:46:30,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:30,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912099114] [2022-11-25 23:46:30,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:30,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:30,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:30,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912099114] [2022-11-25 23:46:30,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912099114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:30,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238265022] [2022-11-25 23:46:30,799 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:46:30,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:30,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:30,804 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:30,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-25 23:46:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:30,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 23:46:30,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:31,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:31,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238265022] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:31,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1796577824] [2022-11-25 23:46:31,201 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:31,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:31,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-11-25 23:46:31,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164861538] [2022-11-25 23:46:31,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:31,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:46:31,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:31,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:46:31,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:46:31,203 INFO L87 Difference]: Start difference. First operand 722 states and 2372 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:31,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:31,716 INFO L93 Difference]: Finished difference Result 836 states and 2608 transitions. [2022-11-25 23:46:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 23:46:31,716 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 23:46:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:31,721 INFO L225 Difference]: With dead ends: 836 [2022-11-25 23:46:31,721 INFO L226 Difference]: Without dead ends: 812 [2022-11-25 23:46:31,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2022-11-25 23:46:31,722 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 222 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:31,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 53 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:46:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-25 23:46:31,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 750. [2022-11-25 23:46:31,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 3.246995994659546) internal successors, (2432), 749 states have internal predecessors, (2432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 2432 transitions. [2022-11-25 23:46:31,744 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 2432 transitions. Word has length 24 [2022-11-25 23:46:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:31,744 INFO L495 AbstractCegarLoop]: Abstraction has 750 states and 2432 transitions. [2022-11-25 23:46:31,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 2432 transitions. [2022-11-25 23:46:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:46:31,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:31,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:31,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:31,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-25 23:46:31,953 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:31,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:31,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1511526348, now seen corresponding path program 5 times [2022-11-25 23:46:31,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:31,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547917325] [2022-11-25 23:46:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:31,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:32,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:32,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547917325] [2022-11-25 23:46:32,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547917325] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:32,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614709824] [2022-11-25 23:46:32,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:46:32,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:32,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:32,071 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:32,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-25 23:46:32,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:46:32,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:46:32,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 23:46:32,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:32,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:32,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614709824] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:32,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [59770011] [2022-11-25 23:46:32,401 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:32,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:32,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-11-25 23:46:32,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096809772] [2022-11-25 23:46:32,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:32,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 23:46:32,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:32,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 23:46:32,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:46:32,404 INFO L87 Difference]: Start difference. First operand 750 states and 2432 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:32,752 INFO L93 Difference]: Finished difference Result 722 states and 2309 transitions. [2022-11-25 23:46:32,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:46:32,752 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 23:46:32,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:32,755 INFO L225 Difference]: With dead ends: 722 [2022-11-25 23:46:32,756 INFO L226 Difference]: Without dead ends: 615 [2022-11-25 23:46:32,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:46:32,756 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 90 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:32,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 57 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:46:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-11-25 23:46:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2022-11-25 23:46:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 3.4022801302931596) internal successors, (2089), 614 states have internal predecessors, (2089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 2089 transitions. [2022-11-25 23:46:32,773 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 2089 transitions. Word has length 24 [2022-11-25 23:46:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:32,773 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 2089 transitions. [2022-11-25 23:46:32,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 2089 transitions. [2022-11-25 23:46:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:46:32,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:32,776 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:32,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:32,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-25 23:46:32,982 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:32,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:32,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2015594920, now seen corresponding path program 19 times [2022-11-25 23:46:32,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:32,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078658397] [2022-11-25 23:46:32,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:32,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:33,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:33,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078658397] [2022-11-25 23:46:33,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078658397] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:33,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596730302] [2022-11-25 23:46:33,088 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:46:33,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:33,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:33,090 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:33,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-25 23:46:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:33,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:46:33,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:33,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:33,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596730302] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:33,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1752539572] [2022-11-25 23:46:33,396 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:33,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:33,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-11-25 23:46:33,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007986329] [2022-11-25 23:46:33,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:33,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:46:33,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:33,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:46:33,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:46:33,399 INFO L87 Difference]: Start difference. First operand 615 states and 2089 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:33,561 INFO L93 Difference]: Finished difference Result 510 states and 1714 transitions. [2022-11-25 23:46:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:46:33,562 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 23:46:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:33,564 INFO L225 Difference]: With dead ends: 510 [2022-11-25 23:46:33,564 INFO L226 Difference]: Without dead ends: 510 [2022-11-25 23:46:33,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:46:33,565 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 127 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:33,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 17 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:46:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-25 23:46:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 351. [2022-11-25 23:46:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 3.3114285714285714) internal successors, (1159), 350 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1159 transitions. [2022-11-25 23:46:33,576 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1159 transitions. Word has length 24 [2022-11-25 23:46:33,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:33,576 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 1159 transitions. [2022-11-25 23:46:33,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1159 transitions. [2022-11-25 23:46:33,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:46:33,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:33,578 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:33,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:33,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-25 23:46:33,779 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:33,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:33,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1063785316, now seen corresponding path program 20 times [2022-11-25 23:46:33,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:33,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475386070] [2022-11-25 23:46:33,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:33,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:33,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:33,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475386070] [2022-11-25 23:46:33,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475386070] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:33,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154565764] [2022-11-25 23:46:33,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:46:33,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:33,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:33,948 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:33,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-25 23:46:34,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:46:34,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:46:34,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:46:34,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:34,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:34,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154565764] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:34,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [602801440] [2022-11-25 23:46:34,387 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:34,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:34,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-11-25 23:46:34,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135499744] [2022-11-25 23:46:34,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:34,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 23:46:34,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:34,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 23:46:34,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:46:34,392 INFO L87 Difference]: Start difference. First operand 351 states and 1159 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:34,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:34,666 INFO L93 Difference]: Finished difference Result 530 states and 1704 transitions. [2022-11-25 23:46:34,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:46:34,666 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 23:46:34,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:34,668 INFO L225 Difference]: With dead ends: 530 [2022-11-25 23:46:34,668 INFO L226 Difference]: Without dead ends: 530 [2022-11-25 23:46:34,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2022-11-25 23:46:34,669 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 200 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:34,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 23 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:46:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-11-25 23:46:34,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 366. [2022-11-25 23:46:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 3.3643835616438356) internal successors, (1228), 365 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1228 transitions. [2022-11-25 23:46:34,680 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1228 transitions. Word has length 25 [2022-11-25 23:46:34,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:34,680 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 1228 transitions. [2022-11-25 23:46:34,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1228 transitions. [2022-11-25 23:46:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:46:34,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:34,682 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:34,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:34,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-25 23:46:34,888 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:34,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1315252400, now seen corresponding path program 21 times [2022-11-25 23:46:34,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:34,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3979480] [2022-11-25 23:46:34,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:34,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:35,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:35,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3979480] [2022-11-25 23:46:35,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3979480] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:35,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023814679] [2022-11-25 23:46:35,047 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:46:35,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:35,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:35,048 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:35,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-25 23:46:35,172 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:46:35,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:46:35,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:46:35,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:35,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:35,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023814679] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:35,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [693552006] [2022-11-25 23:46:35,412 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:35,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:35,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-11-25 23:46:35,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007468331] [2022-11-25 23:46:35,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:35,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 23:46:35,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:35,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 23:46:35,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:46:35,415 INFO L87 Difference]: Start difference. First operand 366 states and 1228 transitions. Second operand has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 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-11-25 23:46:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:36,556 INFO L93 Difference]: Finished difference Result 970 states and 3114 transitions. [2022-11-25 23:46:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 23:46:36,557 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 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 25 [2022-11-25 23:46:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:36,560 INFO L225 Difference]: With dead ends: 970 [2022-11-25 23:46:36,560 INFO L226 Difference]: Without dead ends: 970 [2022-11-25 23:46:36,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=388, Invalid=1172, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 23:46:36,561 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 313 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:36,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 49 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:46:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-25 23:46:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 415. [2022-11-25 23:46:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 3.524154589371981) internal successors, (1459), 414 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1459 transitions. [2022-11-25 23:46:36,574 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1459 transitions. Word has length 25 [2022-11-25 23:46:36,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:36,574 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 1459 transitions. [2022-11-25 23:46:36,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 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-11-25 23:46:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1459 transitions. [2022-11-25 23:46:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:46:36,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:36,576 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:36,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:36,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:36,782 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:36,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:36,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1438598170, now seen corresponding path program 22 times [2022-11-25 23:46:36,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:36,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614884023] [2022-11-25 23:46:36,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:36,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:36,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:36,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614884023] [2022-11-25 23:46:36,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614884023] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:36,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367168776] [2022-11-25 23:46:36,975 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:46:36,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:36,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:36,980 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:37,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-25 23:46:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:37,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:46:37,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:37,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:37,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:37,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367168776] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:37,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [864283746] [2022-11-25 23:46:37,448 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:37,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:37,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-11-25 23:46:37,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473931370] [2022-11-25 23:46:37,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:37,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 23:46:37,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:37,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 23:46:37,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:46:37,451 INFO L87 Difference]: Start difference. First operand 415 states and 1459 transitions. Second operand has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 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-11-25 23:46:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:37,996 INFO L93 Difference]: Finished difference Result 641 states and 2170 transitions. [2022-11-25 23:46:37,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:46:37,996 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 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 25 [2022-11-25 23:46:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:37,999 INFO L225 Difference]: With dead ends: 641 [2022-11-25 23:46:37,999 INFO L226 Difference]: Without dead ends: 641 [2022-11-25 23:46:38,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2022-11-25 23:46:38,000 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 243 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:38,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 38 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:46:38,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-11-25 23:46:38,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 437. [2022-11-25 23:46:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 3.6055045871559632) internal successors, (1572), 436 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1572 transitions. [2022-11-25 23:46:38,015 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1572 transitions. Word has length 25 [2022-11-25 23:46:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:38,015 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 1572 transitions. [2022-11-25 23:46:38,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 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-11-25 23:46:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1572 transitions. [2022-11-25 23:46:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:46:38,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:38,017 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:38,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:38,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:38,223 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:38,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:38,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2001062472, now seen corresponding path program 23 times [2022-11-25 23:46:38,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:38,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129982749] [2022-11-25 23:46:38,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:38,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:38,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:38,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129982749] [2022-11-25 23:46:38,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129982749] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:38,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477819657] [2022-11-25 23:46:38,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:46:38,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:38,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:38,428 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:38,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-25 23:46:38,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:46:38,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:46:38,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:46:38,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:38,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:38,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477819657] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:38,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1595341402] [2022-11-25 23:46:38,971 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:38,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:38,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-11-25 23:46:38,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299471362] [2022-11-25 23:46:38,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:38,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 23:46:38,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:38,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 23:46:38,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-11-25 23:46:38,975 INFO L87 Difference]: Start difference. First operand 437 states and 1572 transitions. Second operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 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-11-25 23:46:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:39,387 INFO L93 Difference]: Finished difference Result 597 states and 2071 transitions. [2022-11-25 23:46:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:46:39,387 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 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 25 [2022-11-25 23:46:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:39,390 INFO L225 Difference]: With dead ends: 597 [2022-11-25 23:46:39,390 INFO L226 Difference]: Without dead ends: 597 [2022-11-25 23:46:39,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-11-25 23:46:39,391 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 242 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:39,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 27 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:46:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-11-25 23:46:39,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 431. [2022-11-25 23:46:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 3.5790697674418603) internal successors, (1539), 430 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1539 transitions. [2022-11-25 23:46:39,405 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1539 transitions. Word has length 25 [2022-11-25 23:46:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:39,405 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 1539 transitions. [2022-11-25 23:46:39,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 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-11-25 23:46:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1539 transitions. [2022-11-25 23:46:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:46:39,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:39,407 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:39,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:39,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-25 23:46:39,607 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:39,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:39,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1103402900, now seen corresponding path program 24 times [2022-11-25 23:46:39,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:39,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478182325] [2022-11-25 23:46:39,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:39,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:39,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:39,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478182325] [2022-11-25 23:46:39,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478182325] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:39,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026126289] [2022-11-25 23:46:39,758 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:46:39,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:39,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:39,761 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:39,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-25 23:46:39,920 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:46:39,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:46:39,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:46:39,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:40,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:40,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026126289] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:40,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1434510535] [2022-11-25 23:46:40,131 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:40,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:40,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-25 23:46:40,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508701499] [2022-11-25 23:46:40,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:40,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:46:40,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:40,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:46:40,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:46:40,133 INFO L87 Difference]: Start difference. First operand 431 states and 1539 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-11-25 23:46:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:41,073 INFO L93 Difference]: Finished difference Result 485 states and 1691 transitions. [2022-11-25 23:46:41,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 23:46:41,074 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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 25 [2022-11-25 23:46:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:41,075 INFO L225 Difference]: With dead ends: 485 [2022-11-25 23:46:41,075 INFO L226 Difference]: Without dead ends: 485 [2022-11-25 23:46:41,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 23:46:41,076 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 171 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:41,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 66 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:46:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-11-25 23:46:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 437. [2022-11-25 23:46:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 3.591743119266055) internal successors, (1566), 436 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1566 transitions. [2022-11-25 23:46:41,089 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1566 transitions. Word has length 25 [2022-11-25 23:46:41,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:41,089 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 1566 transitions. [2022-11-25 23:46:41,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-11-25 23:46:41,089 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1566 transitions. [2022-11-25 23:46:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:46:41,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:41,091 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:41,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:41,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-25 23:46:41,297 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:41,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1650447670, now seen corresponding path program 25 times [2022-11-25 23:46:41,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:41,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961268040] [2022-11-25 23:46:41,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:41,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:41,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:41,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961268040] [2022-11-25 23:46:41,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961268040] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:41,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224370157] [2022-11-25 23:46:41,467 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:46:41,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:41,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:41,469 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:41,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-25 23:46:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:41,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:46:41,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:41,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:41,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224370157] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:41,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2072256719] [2022-11-25 23:46:41,892 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:41,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:41,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-11-25 23:46:41,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102193652] [2022-11-25 23:46:41,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:41,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 23:46:41,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:41,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 23:46:41,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:46:41,894 INFO L87 Difference]: Start difference. First operand 437 states and 1566 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:42,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:42,632 INFO L93 Difference]: Finished difference Result 619 states and 2111 transitions. [2022-11-25 23:46:42,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:46:42,632 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 23:46:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:42,634 INFO L225 Difference]: With dead ends: 619 [2022-11-25 23:46:42,634 INFO L226 Difference]: Without dead ends: 619 [2022-11-25 23:46:42,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=288, Invalid=704, Unknown=0, NotChecked=0, Total=992 [2022-11-25 23:46:42,635 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 226 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:42,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 53 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:46:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-11-25 23:46:42,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 455. [2022-11-25 23:46:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.649779735682819) internal successors, (1657), 454 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:42,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1657 transitions. [2022-11-25 23:46:42,645 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1657 transitions. Word has length 25 [2022-11-25 23:46:42,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:42,645 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 1657 transitions. [2022-11-25 23:46:42,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:42,645 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1657 transitions. [2022-11-25 23:46:42,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:46:42,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:42,647 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:42,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:42,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:42,847 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:42,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:42,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1789212972, now seen corresponding path program 26 times [2022-11-25 23:46:42,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:42,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439683552] [2022-11-25 23:46:42,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:42,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:43,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:43,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439683552] [2022-11-25 23:46:43,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439683552] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:43,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968505655] [2022-11-25 23:46:43,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:46:43,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:43,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:43,006 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:43,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-25 23:46:43,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:46:43,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:46:43,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:46:43,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:43,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:43,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968505655] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:43,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [351637619] [2022-11-25 23:46:43,480 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:43,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:43,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-11-25 23:46:43,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139578927] [2022-11-25 23:46:43,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:43,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 23:46:43,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 23:46:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-11-25 23:46:43,481 INFO L87 Difference]: Start difference. First operand 455 states and 1657 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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-11-25 23:46:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:44,008 INFO L93 Difference]: Finished difference Result 589 states and 2045 transitions. [2022-11-25 23:46:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:46:44,009 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 23:46:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:44,011 INFO L225 Difference]: With dead ends: 589 [2022-11-25 23:46:44,011 INFO L226 Difference]: Without dead ends: 589 [2022-11-25 23:46:44,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2022-11-25 23:46:44,013 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 209 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:44,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 32 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:46:44,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-11-25 23:46:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 431. [2022-11-25 23:46:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 3.5790697674418603) internal successors, (1539), 430 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1539 transitions. [2022-11-25 23:46:44,027 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1539 transitions. Word has length 25 [2022-11-25 23:46:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:44,027 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 1539 transitions. [2022-11-25 23:46:44,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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-11-25 23:46:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1539 transitions. [2022-11-25 23:46:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:46:44,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:44,028 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:44,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:44,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:44,229 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:44,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1162481836, now seen corresponding path program 27 times [2022-11-25 23:46:44,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:44,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229335649] [2022-11-25 23:46:44,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:44,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:44,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:44,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229335649] [2022-11-25 23:46:44,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229335649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:44,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953106232] [2022-11-25 23:46:44,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:46:44,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:44,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:44,397 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:44,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-25 23:46:44,537 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:46:44,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:46:44,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:46:44,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:44,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:44,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953106232] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:44,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1259250520] [2022-11-25 23:46:44,783 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:44,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:44,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-11-25 23:46:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304454912] [2022-11-25 23:46:44,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:44,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 23:46:44,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 23:46:44,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:46:44,784 INFO L87 Difference]: Start difference. First operand 431 states and 1539 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 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-11-25 23:46:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:47,112 INFO L93 Difference]: Finished difference Result 789 states and 2711 transitions. [2022-11-25 23:46:47,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-25 23:46:47,112 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 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 25 [2022-11-25 23:46:47,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:47,115 INFO L225 Difference]: With dead ends: 789 [2022-11-25 23:46:47,115 INFO L226 Difference]: Without dead ends: 789 [2022-11-25 23:46:47,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1065, Invalid=2595, Unknown=0, NotChecked=0, Total=3660 [2022-11-25 23:46:47,116 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 269 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:47,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 83 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:46:47,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-11-25 23:46:47,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 455. [2022-11-25 23:46:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.649779735682819) internal successors, (1657), 454 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1657 transitions. [2022-11-25 23:46:47,127 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1657 transitions. Word has length 25 [2022-11-25 23:46:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:47,128 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 1657 transitions. [2022-11-25 23:46:47,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 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-11-25 23:46:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1657 transitions. [2022-11-25 23:46:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:46:47,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:47,129 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:47,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:47,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-25 23:46:47,330 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:47,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:47,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2017788490, now seen corresponding path program 28 times [2022-11-25 23:46:47,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:47,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143289212] [2022-11-25 23:46:47,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:47,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:47,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143289212] [2022-11-25 23:46:47,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143289212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:47,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941715649] [2022-11-25 23:46:47,515 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:46:47,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:47,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:47,517 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:47,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-25 23:46:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:47,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:46:47,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:47,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:47,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:48,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:48,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941715649] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:48,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1845008124] [2022-11-25 23:46:48,128 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:48,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:48,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-11-25 23:46:48,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429688630] [2022-11-25 23:46:48,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:48,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 23:46:48,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:48,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 23:46:48,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-11-25 23:46:48,130 INFO L87 Difference]: Start difference. First operand 455 states and 1657 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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-11-25 23:46:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:48,830 INFO L93 Difference]: Finished difference Result 773 states and 2674 transitions. [2022-11-25 23:46:48,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:46:48,830 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 23:46:48,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:48,835 INFO L225 Difference]: With dead ends: 773 [2022-11-25 23:46:48,836 INFO L226 Difference]: Without dead ends: 773 [2022-11-25 23:46:48,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=294, Invalid=762, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 23:46:48,838 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 254 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:48,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 38 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:46:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-11-25 23:46:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 443. [2022-11-25 23:46:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.6018099547511313) internal successors, (1592), 442 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1592 transitions. [2022-11-25 23:46:48,854 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1592 transitions. Word has length 25 [2022-11-25 23:46:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:48,854 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 1592 transitions. [2022-11-25 23:46:48,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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-11-25 23:46:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1592 transitions. [2022-11-25 23:46:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:46:48,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:48,856 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:48,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:49,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-25 23:46:49,062 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:49,062 INFO L85 PathProgramCache]: Analyzing trace with hash -699837076, now seen corresponding path program 29 times [2022-11-25 23:46:49,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:49,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646123561] [2022-11-25 23:46:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:49,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:49,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:49,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646123561] [2022-11-25 23:46:49,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646123561] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:49,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029574461] [2022-11-25 23:46:49,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:46:49,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:49,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:49,200 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:49,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-25 23:46:49,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:46:49,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:46:49,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:46:49,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:49,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:46:49,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029574461] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:49,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [309756916] [2022-11-25 23:46:49,618 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:46:49,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:49,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-11-25 23:46:49,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310034048] [2022-11-25 23:46:49,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:49,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 23:46:49,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:49,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 23:46:49,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:46:49,621 INFO L87 Difference]: Start difference. First operand 443 states and 1592 transitions. Second operand has 20 states, 20 states have (on average 2.05) 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-11-25 23:46:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:49,934 INFO L93 Difference]: Finished difference Result 563 states and 1962 transitions. [2022-11-25 23:46:49,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:46:49,935 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 23:46:49,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:49,937 INFO L225 Difference]: With dead ends: 563 [2022-11-25 23:46:49,938 INFO L226 Difference]: Without dead ends: 563 [2022-11-25 23:46:49,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:46:49,938 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 222 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:49,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 26 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:46:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-11-25 23:46:49,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 455. [2022-11-25 23:46:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.5704845814977975) internal successors, (1621), 454 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1621 transitions. [2022-11-25 23:46:49,953 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1621 transitions. Word has length 25 [2022-11-25 23:46:49,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:49,954 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 1621 transitions. [2022-11-25 23:46:49,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) 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-11-25 23:46:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1621 transitions. [2022-11-25 23:46:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 23:46:49,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:49,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:49,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:50,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-25 23:46:50,162 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:46:50,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:50,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1685659997, now seen corresponding path program 6 times [2022-11-25 23:46:50,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:50,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634807808] [2022-11-25 23:46:50,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:50,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:52,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:52,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:52,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634807808] [2022-11-25 23:46:52,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634807808] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:52,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246925614] [2022-11-25 23:46:52,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:46:52,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:52,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:52,035 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:52,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-25 23:46:52,215 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:46:52,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:46:52,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 23:46:52,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:52,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:52,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:46:53,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:53,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:53,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:53,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 81 [2022-11-25 23:46:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:54,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:55,788 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse65 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse23 (+ c_~max2~0 1))) (let ((.cse0 (<= .cse23 c_~max3~0)) (.cse13 (<= c_~max3~0 c_~max2~0)) (.cse33 (= c_~max1~0 c_~max2~0)) (.cse6 (+ c_~A~0.offset .cse65)) (.cse5 (+ c_~A~0.offset .cse65 4)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse6)) (.cse4 (select .cse2 .cse5))) (or (not (< c_~max1~0 .cse1)) (< c_~max3~0 (select .cse2 .cse3)) (not (< .cse1 .cse4)) (= .cse4 c_~max2~0)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse7 (select .cse10 .cse6)) (.cse9 (select .cse10 .cse3)) (.cse8 (select .cse10 .cse5))) (or (not (< c_~max1~0 .cse7)) (not (< .cse7 .cse8)) (<= .cse9 c_~max2~0) (not (< c_~max3~0 .cse9)) (= .cse9 .cse8))))) (or (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse6))) (or (not (< c_~max1~0 .cse11)) (< c_~max3~0 (select .cse12 .cse3)) (= .cse11 c_~max3~0) (< .cse11 (select .cse12 .cse5)))))) .cse13) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse6)) (.cse16 (select .cse15 .cse3))) (or (not (< c_~max1~0 .cse14)) (< .cse14 (select .cse15 .cse5)) (= .cse14 c_~max2~0) (= .cse14 .cse16) (not (< c_~max3~0 .cse16)))))) (or .cse0 (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse18 (select .cse17 .cse5))) (or (< c_~max3~0 (select .cse17 .cse3)) (not (< c_~max1~0 .cse18)) (< c_~max1~0 (select .cse17 .cse6)) (= .cse18 c_~max2~0)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse21 (select .cse20 .cse3)) (.cse19 (select .cse20 .cse5))) (or (not (< c_~max1~0 .cse19)) (< c_~max1~0 (select .cse20 .cse6)) (not (< c_~max3~0 .cse21)) (= .cse21 .cse19) (= .cse19 c_~max2~0))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse22 (select .cse25 .cse6)) (.cse24 (select .cse25 .cse3))) (or (not (< c_~max1~0 .cse22)) (<= .cse23 .cse24) (< .cse22 (select .cse25 .cse5)) (= .cse22 c_~max2~0) (not (< c_~max3~0 .cse24)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse27 (select .cse26 .cse5))) (or (< c_~max3~0 (select .cse26 .cse3)) (not (< c_~max1~0 .cse27)) (< c_~max1~0 (select .cse26 .cse6)) (= .cse27 c_~max2~0) (= .cse27 c_~max3~0))))) (or (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse28 (select .cse29 .cse6)) (.cse30 (select .cse29 .cse5))) (or (not (< c_~max1~0 .cse28)) (< c_~max3~0 (select .cse29 .cse3)) (not (< .cse28 .cse30)) (= .cse30 c_~max3~0))))) .cse13) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse31 (select .cse32 .cse3))) (or (= .cse31 c_~max1~0) (<= .cse31 c_~max2~0) (< c_~max1~0 (select .cse32 .cse6)) (not (< c_~max3~0 .cse31)) (< c_~max1~0 (select .cse32 .cse5)))))) (or (and (= c_~max1~0 c_~max3~0) .cse0) (and .cse33 .cse13) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (or (< c_~max3~0 (select .cse34 .cse3)) (< c_~max1~0 (select .cse34 .cse6)) (< c_~max1~0 (select .cse34 .cse5)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse35 (select .cse36 .cse6)) (.cse37 (select .cse36 .cse3))) (or (not (< c_~max1~0 .cse35)) (< .cse35 (select .cse36 .cse5)) (= .cse35 .cse37) (<= .cse37 c_~max2~0) (not (< c_~max3~0 .cse37)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse39 (select .cse40 .cse3)) (.cse38 (select .cse40 .cse5))) (or (not (< c_~max1~0 .cse38)) (<= .cse39 c_~max2~0) (< c_~max1~0 (select .cse40 .cse6)) (not (< c_~max3~0 .cse39)) (= .cse39 .cse38))))) (or .cse0 (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse41 (select .cse42 .cse6))) (or (not (< c_~max1~0 .cse41)) (< c_~max3~0 (select .cse42 .cse3)) (< .cse41 (select .cse42 .cse5)) (= .cse41 c_~max2~0)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse46 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse43 (select .cse46 .cse6)) (.cse44 (select .cse46 .cse3)) (.cse45 (select .cse46 .cse5))) (or (not (< c_~max1~0 .cse43)) (<= .cse23 .cse44) (not (< .cse43 .cse45)) (not (< c_~max3~0 .cse44)) (= .cse45 c_~max2~0))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse50 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse47 (select .cse50 .cse6)) (.cse49 (select .cse50 .cse3)) (.cse48 (select .cse50 .cse5))) (or (not (< c_~max1~0 .cse47)) (not (< .cse47 .cse48)) (not (< c_~max3~0 .cse49)) (= .cse49 .cse48) (= .cse48 c_~max2~0))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse51 (select .cse52 .cse6))) (or (not (< c_~max1~0 .cse51)) (< c_~max3~0 (select .cse52 .cse3)) (= .cse51 c_~max3~0) (< .cse51 (select .cse52 .cse5)) (= .cse51 c_~max2~0))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse53 (select .cse55 .cse3)) (.cse54 (select .cse55 .cse5))) (or (<= .cse23 .cse53) (not (< c_~max1~0 .cse54)) (< c_~max1~0 (select .cse55 .cse6)) (not (< c_~max3~0 .cse53)) (= .cse54 c_~max2~0))))) (or .cse13 (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse56 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse57 (select .cse56 .cse5))) (or (< c_~max3~0 (select .cse56 .cse3)) (not (< c_~max1~0 .cse57)) (< c_~max1~0 (select .cse56 .cse6)) (= .cse57 c_~max3~0)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse58 (select .cse59 .cse6)) (.cse60 (select .cse59 .cse5))) (or (not (< c_~max1~0 .cse58)) (< c_~max3~0 (select .cse59 .cse3)) (not (< .cse58 .cse60)) (= .cse60 c_~max2~0) (= .cse60 c_~max3~0))))) (or .cse33 (and (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse62 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse61 (select .cse62 .cse3))) (or (= .cse61 c_~max1~0) (< c_~max1~0 (select .cse62 .cse6)) (not (< c_~max3~0 .cse61)) (< c_~max1~0 (select .cse62 .cse5)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse64 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse63 (select .cse64 .cse3))) (or (<= .cse23 .cse63) (< c_~max1~0 (select .cse64 .cse6)) (not (< c_~max3~0 .cse63)) (< c_~max1~0 (select .cse64 .cse5))))))))))) is different from false [2022-11-25 23:46:56,235 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~max2~0 1))) (let ((.cse15 (= c_~max1~0 c_~max2~0)) (.cse14 (<= .cse8 c_~max3~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ c_~A~0.offset 4)) (.cse16 (<= c_~max3~0 c_~max2~0))) (and (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse4)) (.cse2 (select .cse1 .cse3))) (or (not (< c_~max1~0 .cse0)) (= c_~max2~0 .cse0) (< c_~max1~0 (select .cse1 c_~A~0.offset)) (= .cse2 .cse0) (not (< c_~max3~0 .cse2)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse5 (select .cse7 c_~A~0.offset)) (.cse6 (select .cse7 .cse4))) (or (not (< .cse5 .cse6)) (< c_~max3~0 (select .cse7 .cse3)) (= c_~max2~0 .cse6) (not (< c_~max1~0 .cse5)) (= c_~max3~0 .cse6))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse4)) (.cse10 (select .cse12 c_~A~0.offset)) (.cse9 (select .cse12 .cse3))) (or (<= .cse8 .cse9) (not (< .cse10 .cse11)) (= c_~max2~0 .cse11) (not (< c_~max1~0 .cse10)) (not (< c_~max3~0 .cse9)))))) (or (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (or (< c_~max3~0 (select .cse13 .cse3)) (< c_~max1~0 (select .cse13 .cse4)) (< c_~max1~0 (select .cse13 c_~A~0.offset))))) (and (= c_~max1~0 c_~max3~0) .cse14) (and .cse15 .cse16)) (or .cse14 (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse4))) (or (not (< c_~max1~0 .cse17)) (< c_~max3~0 (select .cse18 .cse3)) (= c_~max2~0 .cse17) (< c_~max1~0 (select .cse18 c_~A~0.offset))))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse20 (select .cse21 c_~A~0.offset)) (.cse19 (select .cse21 .cse3))) (or (= .cse19 .cse20) (not (< c_~max1~0 .cse20)) (= c_~max2~0 .cse20) (< .cse20 (select .cse21 .cse4)) (not (< c_~max3~0 .cse19)))))) (or .cse16 (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse4))) (or (not (< c_~max1~0 .cse22)) (< c_~max3~0 (select .cse23 .cse3)) (< c_~max1~0 (select .cse23 c_~A~0.offset)) (= c_~max3~0 .cse22)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse24 (select .cse25 .cse4))) (or (not (< c_~max1~0 .cse24)) (< c_~max3~0 (select .cse25 .cse3)) (= c_~max2~0 .cse24) (< c_~max1~0 (select .cse25 c_~A~0.offset)) (= c_~max3~0 .cse24))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse26 (select .cse29 c_~A~0.offset)) (.cse27 (select .cse29 .cse4)) (.cse28 (select .cse29 .cse3))) (or (not (< .cse26 .cse27)) (= c_~max2~0 .cse27) (not (< c_~max1~0 .cse26)) (= .cse28 .cse27) (not (< c_~max3~0 .cse28)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse30 (select .cse33 c_~A~0.offset)) (.cse31 (select .cse33 .cse4)) (.cse32 (select .cse33 .cse3))) (or (not (< .cse30 .cse31)) (not (< c_~max1~0 .cse30)) (<= .cse32 c_~max2~0) (= .cse32 .cse31) (not (< c_~max3~0 .cse32)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse34 (select .cse36 .cse4)) (.cse35 (select .cse36 .cse3))) (or (not (< c_~max1~0 .cse34)) (<= .cse8 .cse35) (= c_~max2~0 .cse34) (< c_~max1~0 (select .cse36 c_~A~0.offset)) (not (< c_~max3~0 .cse35)))))) (or .cse16 (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse38 (select .cse37 c_~A~0.offset))) (or (< c_~max3~0 (select .cse37 .cse3)) (not (< c_~max1~0 .cse38)) (< .cse38 (select .cse37 .cse4)) (= c_~max3~0 .cse38)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse40 (select .cse41 c_~A~0.offset)) (.cse39 (select .cse41 .cse3))) (or (= .cse39 .cse40) (not (< c_~max1~0 .cse40)) (< .cse40 (select .cse41 .cse4)) (<= .cse39 c_~max2~0) (not (< c_~max3~0 .cse39)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse42 (select .cse43 .cse4)) (.cse44 (select .cse43 .cse3))) (or (not (< c_~max1~0 .cse42)) (< c_~max1~0 (select .cse43 c_~A~0.offset)) (<= .cse44 c_~max2~0) (= .cse44 .cse42) (not (< c_~max3~0 .cse44)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse46 (select .cse47 c_~A~0.offset)) (.cse45 (select .cse47 .cse3))) (or (<= .cse8 .cse45) (not (< c_~max1~0 .cse46)) (= c_~max2~0 .cse46) (< .cse46 (select .cse47 .cse4)) (not (< c_~max3~0 .cse45)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse48 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse49 (select .cse48 c_~A~0.offset))) (or (< c_~max3~0 (select .cse48 .cse3)) (not (< c_~max1~0 .cse49)) (= c_~max2~0 .cse49) (< .cse49 (select .cse48 .cse4)) (= c_~max3~0 .cse49))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse50 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse51 (select .cse50 .cse3))) (or (< c_~max1~0 (select .cse50 .cse4)) (= .cse51 c_~max1~0) (< c_~max1~0 (select .cse50 c_~A~0.offset)) (<= .cse51 c_~max2~0) (not (< c_~max3~0 .cse51)))))) (or .cse14 (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse54 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse53 (select .cse54 .cse4)) (.cse52 (select .cse54 c_~A~0.offset))) (or (not (< .cse52 .cse53)) (< c_~max3~0 (select .cse54 .cse3)) (= c_~max2~0 .cse53) (not (< c_~max1~0 .cse52))))))) (or .cse15 (and (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse56 (select .cse55 .cse3))) (or (< c_~max1~0 (select .cse55 .cse4)) (= .cse56 c_~max1~0) (< c_~max1~0 (select .cse55 c_~A~0.offset)) (not (< c_~max3~0 .cse56)))))) (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse58 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse57 (select .cse58 .cse3))) (or (<= .cse8 .cse57) (< c_~max1~0 (select .cse58 .cse4)) (< c_~max1~0 (select .cse58 c_~A~0.offset)) (not (< c_~max3~0 .cse57)))))))) (or .cse14 (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse60 (select .cse59 c_~A~0.offset))) (or (< c_~max3~0 (select .cse59 .cse3)) (not (< c_~max1~0 .cse60)) (= c_~max2~0 .cse60) (< .cse60 (select .cse59 .cse4))))))) (or (forall ((v_ArrVal_1733 (Array Int Int))) (let ((.cse63 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1733) c_~A~0.base))) (let ((.cse61 (select .cse63 c_~A~0.offset)) (.cse62 (select .cse63 .cse4))) (or (not (< .cse61 .cse62)) (< c_~max3~0 (select .cse63 .cse3)) (not (< c_~max1~0 .cse61)) (= c_~max3~0 .cse62))))) .cse16)))) is different from false [2022-11-25 23:46:58,889 INFO L321 Elim1Store]: treesize reduction 12, result has 77.4 percent of original size [2022-11-25 23:46:58,890 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 1954 treesize of output 1508 [2022-11-25 23:46:58,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:58,978 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 1445 treesize of output 1442 [2022-11-25 23:46:59,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:59,034 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 1421 treesize of output 1424 [2022-11-25 23:46:59,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:59,096 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 1403 treesize of output 1408 [2022-11-25 23:46:59,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:59,158 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 1387 treesize of output 1392 [2022-11-25 23:46:59,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:59,218 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 1371 treesize of output 1370 [2022-11-25 23:46:59,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:59,289 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 1349 treesize of output 1346 [2022-11-25 23:46:59,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:59,381 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 1325 treesize of output 1328 [2022-11-25 23:46:59,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:59,448 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 1307 treesize of output 1316 [2022-11-25 23:46:59,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:59,518 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 1295 treesize of output 1300 [2022-11-25 23:46:59,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:59,588 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 1279 treesize of output 1272 [2022-11-25 23:46:59,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:59,664 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 1251 treesize of output 1242 [2022-11-25 23:46:59,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:59,753 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 1221 treesize of output 1220 [2022-11-25 23:46:59,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:59,853 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 1199 treesize of output 1192 [2022-11-25 23:46:59,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:59,939 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 1171 treesize of output 1176 [2022-11-25 23:47:00,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:47:00,029 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 1155 treesize of output 1158 [2022-11-25 23:49:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:49:16,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246925614] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:49:16,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1800986766] [2022-11-25 23:49:16,812 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:49:16,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:49:16,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 34 [2022-11-25 23:49:16,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184236196] [2022-11-25 23:49:16,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:49:16,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 23:49:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:16,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 23:49:16,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1020, Unknown=2, NotChecked=130, Total=1260 [2022-11-25 23:49:16,815 INFO L87 Difference]: Start difference. First operand 455 states and 1621 transitions. Second operand has 36 states, 35 states have (on average 2.0) internal successors, (70), 35 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:28,971 INFO L93 Difference]: Finished difference Result 822 states and 2701 transitions. [2022-11-25 23:49:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 23:49:28,972 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.0) internal successors, (70), 35 states have internal predecessors, (70), 0 states have call successors, (0), 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-11-25 23:49:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:28,974 INFO L225 Difference]: With dead ends: 822 [2022-11-25 23:49:28,974 INFO L226 Difference]: Without dead ends: 801 [2022-11-25 23:49:28,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=337, Invalid=2975, Unknown=2, NotChecked=226, Total=3540 [2022-11-25 23:49:28,975 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 300 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 33 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:28,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 102 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2568 Invalid, 8 Unknown, 224 Unchecked, 4.3s Time] [2022-11-25 23:49:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-11-25 23:49:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 560. [2022-11-25 23:49:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 3.5008944543828266) internal successors, (1957), 559 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1957 transitions. [2022-11-25 23:49:28,988 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1957 transitions. Word has length 26 [2022-11-25 23:49:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:28,988 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 1957 transitions. [2022-11-25 23:49:28,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.0) internal successors, (70), 35 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1957 transitions. [2022-11-25 23:49:28,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 23:49:28,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:28,990 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:49:28,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-11-25 23:49:29,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-25 23:49:29,196 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:49:29,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1031319725, now seen corresponding path program 7 times [2022-11-25 23:49:29,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:29,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507383711] [2022-11-25 23:49:29,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:29,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:49:31,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:31,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507383711] [2022-11-25 23:49:31,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507383711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:49:31,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733768185] [2022-11-25 23:49:31,005 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:49:31,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:49:31,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:49:31,006 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:49:31,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-25 23:49:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:31,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-25 23:49:31,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:49:31,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:31,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:49:32,445 INFO L321 Elim1Store]: treesize reduction 12, result has 77.4 percent of original size [2022-11-25 23:49:32,446 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 134 treesize of output 120 [2022-11-25 23:49:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:49:33,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:49:34,811 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse45 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse18 (= c_~max1~0 c_~max2~0)) (.cse9 (<= c_~max3~0 c_~max2~0)) (.cse19 (< c_~max2~0 c_~max3~0)) (.cse6 (+ c_~A~0.offset .cse45 4)) (.cse4 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse5 (+ c_~A~0.offset .cse45))) (and (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse6)) (.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (<= .cse0 c_~max2~0) (not (< .cse1 .cse2)) (= .cse2 .cse0) (not (< c_~max1~0 .cse1)) (not (< c_~max3~0 .cse0)))))) (or (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse5))) (or (< .cse7 (select .cse8 .cse6)) (not (< c_~max1~0 .cse7)) (< c_~max3~0 (select .cse8 .cse4)) (= .cse7 c_~max3~0))))) .cse9) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse11 (select .cse10 .cse4))) (or (< c_~max1~0 (select .cse10 .cse6)) (<= .cse11 c_~max2~0) (= c_~max1~0 .cse11) (< c_~max1~0 (select .cse10 .cse5)) (not (< c_~max3~0 .cse11)))))) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse5)) (.cse12 (select .cse14 .cse4))) (or (< c_~max2~0 .cse12) (= .cse13 c_~max2~0) (< .cse13 (select .cse14 .cse6)) (not (< c_~max1~0 .cse13)) (not (< c_~max3~0 .cse12)))))) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse6)) (.cse16 (select .cse17 .cse4))) (or (= .cse15 c_~max2~0) (< c_~max2~0 .cse16) (not (< c_~max1~0 .cse15)) (< c_~max1~0 (select .cse17 .cse5)) (not (< c_~max3~0 .cse16)))))) (or (and (or .cse18 .cse19) (or (= c_~max1~0 c_~max3~0) .cse9)) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (or (< c_~max1~0 (select .cse20 .cse6)) (< c_~max3~0 (select .cse20 .cse4)) (< c_~max1~0 (select .cse20 .cse5)))))) (or .cse18 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse4))) (or (< c_~max2~0 .cse21) (< c_~max1~0 (select .cse22 .cse6)) (< c_~max1~0 (select .cse22 .cse5)) (not (< c_~max3~0 .cse21))))))) (or (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse23 (select .cse24 .cse6))) (or (= .cse23 c_~max2~0) (not (< c_~max1~0 .cse23)) (< c_~max3~0 (select .cse24 .cse4)) (< c_~max1~0 (select .cse24 .cse5)))))) .cse19) (or (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse25 (select .cse27 .cse6)) (.cse26 (select .cse27 .cse5))) (or (= .cse25 c_~max3~0) (not (< .cse26 .cse25)) (not (< c_~max1~0 .cse26)) (< c_~max3~0 (select .cse27 .cse4)))))) .cse9) (or .cse9 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse28 (select .cse29 .cse6))) (or (not (< c_~max1~0 .cse28)) (= .cse28 c_~max3~0) (< c_~max3~0 (select .cse29 .cse4)) (< c_~max1~0 (select .cse29 .cse5))))))) (or (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse30 (select .cse31 .cse5))) (or (= .cse30 c_~max2~0) (< .cse30 (select .cse31 .cse6)) (not (< c_~max1~0 .cse30)) (< c_~max3~0 (select .cse31 .cse4)))))) .cse19) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse32 (select .cse34 .cse6)) (.cse33 (select .cse34 .cse4))) (or (not (< c_~max1~0 .cse32)) (<= .cse33 c_~max2~0) (= .cse32 .cse33) (< c_~max1~0 (select .cse34 .cse5)) (not (< c_~max3~0 .cse33)))))) (or .cse19 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse35 (select .cse37 .cse6)) (.cse36 (select .cse37 .cse5))) (or (= .cse35 c_~max2~0) (not (< .cse36 .cse35)) (not (< c_~max1~0 .cse36)) (< c_~max3~0 (select .cse37 .cse4))))))) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse38 (select .cse41 .cse6)) (.cse40 (select .cse41 .cse5)) (.cse39 (select .cse41 .cse4))) (or (= .cse38 c_~max2~0) (< c_~max2~0 .cse39) (not (< .cse40 .cse38)) (not (< c_~max1~0 .cse40)) (not (< c_~max3~0 .cse39)))))) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse44 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse43 (select .cse44 .cse5)) (.cse42 (select .cse44 .cse4))) (or (<= .cse42 c_~max2~0) (= .cse43 .cse42) (< .cse43 (select .cse44 .cse6)) (not (< c_~max1~0 .cse43)) (not (< c_~max3~0 .cse42))))))))) is different from false [2022-11-25 23:49:35,125 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse32 (= c_~max1~0 c_~max2~0)) (.cse18 (<= c_~max3~0 c_~max2~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ c_~A~0.offset 4)) (.cse11 (< c_~max2~0 c_~max3~0))) (and (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse4)) (.cse0 (select .cse2 .cse3))) (or (<= .cse0 c_~max2~0) (= .cse1 .cse0) (not (< c_~max1~0 .cse1)) (< c_~max1~0 (select .cse2 c_~A~0.offset)) (not (< c_~max3~0 .cse0)))))) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse4)) (.cse7 (select .cse8 c_~A~0.offset)) (.cse5 (select .cse8 .cse3))) (or (<= .cse5 c_~max2~0) (= .cse6 .cse5) (not (< .cse7 .cse6)) (not (< c_~max1~0 .cse7)) (not (< c_~max3~0 .cse5)))))) (or (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse4))) (or (= .cse9 c_~max2~0) (not (< c_~max1~0 .cse9)) (< c_~max1~0 (select .cse10 c_~A~0.offset)) (< c_~max3~0 (select .cse10 .cse3)))))) .cse11) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse13 (select .cse14 c_~A~0.offset)) (.cse12 (select .cse14 .cse3))) (or (<= .cse12 c_~max2~0) (< .cse13 (select .cse14 .cse4)) (= .cse13 .cse12) (not (< c_~max1~0 .cse13)) (not (< c_~max3~0 .cse12)))))) (or (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse4)) (.cse16 (select .cse17 c_~A~0.offset))) (or (= .cse15 c_~max3~0) (not (< .cse16 .cse15)) (< c_~max3~0 (select .cse17 .cse3)) (not (< c_~max1~0 .cse16)))))) .cse18) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse4)) (.cse19 (select .cse21 .cse3))) (or (< c_~max2~0 .cse19) (= .cse20 c_~max2~0) (not (< c_~max1~0 .cse20)) (< c_~max1~0 (select .cse21 c_~A~0.offset)) (not (< c_~max3~0 .cse19)))))) (or (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse22 (select .cse23 c_~A~0.offset))) (or (< .cse22 (select .cse23 .cse4)) (= .cse22 c_~max2~0) (< c_~max3~0 (select .cse23 .cse3)) (not (< c_~max1~0 .cse22)))))) .cse11) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse25 (select .cse27 .cse4)) (.cse26 (select .cse27 c_~A~0.offset)) (.cse24 (select .cse27 .cse3))) (or (< c_~max2~0 .cse24) (= .cse25 c_~max2~0) (not (< .cse26 .cse25)) (not (< c_~max1~0 .cse26)) (not (< c_~max3~0 .cse24)))))) (or .cse18 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse28 (select .cse29 .cse4))) (or (= .cse28 c_~max3~0) (not (< c_~max1~0 .cse28)) (< c_~max1~0 (select .cse29 c_~A~0.offset)) (< c_~max3~0 (select .cse29 .cse3))))))) (or .cse18 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse30 (select .cse31 c_~A~0.offset))) (or (< .cse30 (select .cse31 .cse4)) (= .cse30 c_~max3~0) (< c_~max3~0 (select .cse31 .cse3)) (not (< c_~max1~0 .cse30))))))) (or .cse32 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse33 (select .cse34 .cse3))) (or (< c_~max2~0 .cse33) (< c_~max1~0 (select .cse34 .cse4)) (< c_~max1~0 (select .cse34 c_~A~0.offset)) (not (< c_~max3~0 .cse33))))))) (or (and (or .cse32 .cse11) (or (= c_~max1~0 c_~max3~0) .cse18)) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (or (< c_~max1~0 (select .cse35 .cse4)) (< c_~max1~0 (select .cse35 c_~A~0.offset)) (< c_~max3~0 (select .cse35 .cse3)))))) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse36 (select .cse37 .cse3))) (or (<= .cse36 c_~max2~0) (= c_~max1~0 .cse36) (< c_~max1~0 (select .cse37 .cse4)) (< c_~max1~0 (select .cse37 c_~A~0.offset)) (not (< c_~max3~0 .cse36)))))) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse39 (select .cse40 c_~A~0.offset)) (.cse38 (select .cse40 .cse3))) (or (< c_~max2~0 .cse38) (< .cse39 (select .cse40 .cse4)) (= .cse39 c_~max2~0) (not (< c_~max1~0 .cse39)) (not (< c_~max3~0 .cse38)))))) (or (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse41 (select .cse43 .cse4)) (.cse42 (select .cse43 c_~A~0.offset))) (or (= .cse41 c_~max2~0) (not (< .cse42 .cse41)) (< c_~max3~0 (select .cse43 .cse3)) (not (< c_~max1~0 .cse42)))))) .cse11))) is different from false [2022-11-25 23:49:36,462 INFO L321 Elim1Store]: treesize reduction 12, result has 77.4 percent of original size [2022-11-25 23:49:36,463 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 1931 treesize of output 1485 [2022-11-25 23:49:36,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:36,540 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 1422 treesize of output 1427 [2022-11-25 23:49:36,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:36,607 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 1406 treesize of output 1411 [2022-11-25 23:49:36,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:36,672 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 1390 treesize of output 1395 [2022-11-25 23:49:36,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:36,742 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 1374 treesize of output 1379 [2022-11-25 23:49:36,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:36,809 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 1358 treesize of output 1357 [2022-11-25 23:49:36,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:36,878 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 1336 treesize of output 1327 [2022-11-25 23:49:36,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:36,949 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 1306 treesize of output 1305 [2022-11-25 23:49:37,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:37,024 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 1284 treesize of output 1281 [2022-11-25 23:49:37,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:37,108 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 1260 treesize of output 1253 [2022-11-25 23:49:37,200 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:37,200 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 1232 treesize of output 1241 [2022-11-25 23:49:37,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:37,279 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 1220 treesize of output 1223 [2022-11-25 23:49:37,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:37,363 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 1202 treesize of output 1195 [2022-11-25 23:49:37,448 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:37,449 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 1174 treesize of output 1171 [2022-11-25 23:49:37,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:37,535 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 1150 treesize of output 1153 [2022-11-25 23:49:37,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:49:37,625 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 1132 treesize of output 1135 [2022-11-25 23:52:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:52:25,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733768185] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:52:25,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [148952373] [2022-11-25 23:52:25,187 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 23:52:25,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:52:25,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 38 [2022-11-25 23:52:25,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567366355] [2022-11-25 23:52:25,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:52:25,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-25 23:52:25,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:52:25,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-25 23:52:25,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1269, Unknown=2, NotChecked=146, Total=1560 [2022-11-25 23:52:25,188 INFO L87 Difference]: Start difference. First operand 560 states and 1957 transitions. Second operand has 40 states, 39 states have (on average 2.0) internal successors, (78), 39 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:52:28,813 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse26 (= c_~max1~0 c_~max2~0)) (.cse27 (<= c_~max3~0 c_~max2~0)) (.cse20 (< c_~max2~0 c_~max3~0)) (.cse18 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse19 (+ c_~A~0.offset 4))) (let ((.cse0 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse58 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse57 (select .cse58 .cse19)) (.cse56 (select .cse58 .cse18))) (or (<= .cse56 c_~max2~0) (= .cse57 .cse56) (not (< c_~max1~0 .cse57)) (< c_~max1~0 (select .cse58 c_~A~0.offset)) (not (< c_~max3~0 .cse56))))))) (.cse1 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse53 (select .cse55 .cse19)) (.cse54 (select .cse55 c_~A~0.offset)) (.cse52 (select .cse55 .cse18))) (or (<= .cse52 c_~max2~0) (= .cse53 .cse52) (not (< .cse54 .cse53)) (not (< c_~max1~0 .cse54)) (not (< c_~max3~0 .cse52))))))) (.cse2 (or (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse50 (select .cse51 .cse19))) (or (= .cse50 c_~max2~0) (not (< c_~max1~0 .cse50)) (< c_~max1~0 (select .cse51 c_~A~0.offset)) (< c_~max3~0 (select .cse51 .cse18)))))) .cse20)) (.cse3 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse49 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse48 (select .cse49 c_~A~0.offset)) (.cse47 (select .cse49 .cse18))) (or (<= .cse47 c_~max2~0) (< .cse48 (select .cse49 .cse19)) (= .cse48 .cse47) (not (< c_~max1~0 .cse48)) (not (< c_~max3~0 .cse47))))))) (.cse4 (or (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse46 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse44 (select .cse46 .cse19)) (.cse45 (select .cse46 c_~A~0.offset))) (or (= .cse44 c_~max3~0) (not (< .cse45 .cse44)) (< c_~max3~0 (select .cse46 .cse18)) (not (< c_~max1~0 .cse45)))))) .cse27)) (.cse5 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse42 (select .cse43 .cse19)) (.cse41 (select .cse43 .cse18))) (or (< c_~max2~0 .cse41) (= .cse42 c_~max2~0) (not (< c_~max1~0 .cse42)) (< c_~max1~0 (select .cse43 c_~A~0.offset)) (not (< c_~max3~0 .cse41))))))) (.cse6 (or (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse39 (select .cse40 c_~A~0.offset))) (or (< .cse39 (select .cse40 .cse19)) (= .cse39 c_~max2~0) (< c_~max3~0 (select .cse40 .cse18)) (not (< c_~max1~0 .cse39)))))) .cse20)) (.cse7 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse36 (select .cse38 .cse19)) (.cse37 (select .cse38 c_~A~0.offset)) (.cse35 (select .cse38 .cse18))) (or (< c_~max2~0 .cse35) (= .cse36 c_~max2~0) (not (< .cse37 .cse36)) (not (< c_~max1~0 .cse37)) (not (< c_~max3~0 .cse35))))))) (.cse8 (or .cse27 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse33 (select .cse34 .cse19))) (or (= .cse33 c_~max3~0) (not (< c_~max1~0 .cse33)) (< c_~max1~0 (select .cse34 c_~A~0.offset)) (< c_~max3~0 (select .cse34 .cse18)))))))) (.cse9 (or .cse27 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse31 (select .cse32 c_~A~0.offset))) (or (< .cse31 (select .cse32 .cse19)) (= .cse31 c_~max3~0) (< c_~max3~0 (select .cse32 .cse18)) (not (< c_~max1~0 .cse31)))))))) (.cse10 (or .cse26 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse29 (select .cse30 .cse18))) (or (< c_~max2~0 .cse29) (< c_~max1~0 (select .cse30 .cse19)) (< c_~max1~0 (select .cse30 c_~A~0.offset)) (not (< c_~max3~0 .cse29)))))))) (.cse11 (or (and (or .cse26 .cse20) (or (= c_~max1~0 c_~max3~0) .cse27)) (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (or (< c_~max1~0 (select .cse28 .cse19)) (< c_~max1~0 (select .cse28 c_~A~0.offset)) (< c_~max3~0 (select .cse28 .cse18))))))) (.cse12 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse24 (select .cse25 .cse18))) (or (<= .cse24 c_~max2~0) (= c_~max1~0 .cse24) (< c_~max1~0 (select .cse25 .cse19)) (< c_~max1~0 (select .cse25 c_~A~0.offset)) (not (< c_~max3~0 .cse24))))))) (.cse13 (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse22 (select .cse23 c_~A~0.offset)) (.cse21 (select .cse23 .cse18))) (or (< c_~max2~0 .cse21) (< .cse22 (select .cse23 .cse19)) (= .cse22 c_~max2~0) (not (< c_~max1~0 .cse22)) (not (< c_~max3~0 .cse21))))))) (.cse14 (or (forall ((v_ArrVal_1782 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse19)) (.cse16 (select .cse17 c_~A~0.offset))) (or (= .cse15 c_~max2~0) (not (< .cse16 .cse15)) (< c_~max3~0 (select .cse17 .cse18)) (not (< c_~max1~0 .cse16)))))) .cse20))) (and .cse0 .cse1 .cse2 .cse3 (or (< c_thread2Thread1of1ForFork0_~i~1 c_~M~0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) is different from false [2022-11-25 23:52:49,525 WARN L233 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 136 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:53:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:53:02,962 INFO L93 Difference]: Finished difference Result 1135 states and 3548 transitions. [2022-11-25 23:53:02,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-25 23:53:02,963 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.0) internal successors, (78), 39 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 23:53:02,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:53:02,967 INFO L225 Difference]: With dead ends: 1135 [2022-11-25 23:53:02,967 INFO L226 Difference]: Without dead ends: 1114 [2022-11-25 23:53:02,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1515 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=587, Invalid=5274, Unknown=3, NotChecked=456, Total=6320 [2022-11-25 23:53:02,969 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 354 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 3356 mSolverCounterSat, 41 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3356 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:53:02,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 117 Invalid, 3706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3356 Invalid, 11 Unknown, 298 Unchecked, 6.7s Time] [2022-11-25 23:53:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2022-11-25 23:53:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 631. [2022-11-25 23:53:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 630 states have (on average 3.503174603174603) internal successors, (2207), 630 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 2207 transitions. [2022-11-25 23:53:02,989 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 2207 transitions. Word has length 26 [2022-11-25 23:53:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:53:02,989 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 2207 transitions. [2022-11-25 23:53:02,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.0) internal successors, (78), 39 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 2207 transitions. [2022-11-25 23:53:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 23:53:02,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:53:02,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:53:03,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-25 23:53:03,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-25 23:53:03,198 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 23:53:03,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:53:03,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1444359251, now seen corresponding path program 8 times [2022-11-25 23:53:03,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:53:03,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224765536] [2022-11-25 23:53:03,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:53:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:53:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:53:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:53:04,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:53:04,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224765536] [2022-11-25 23:53:04,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224765536] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:53:04,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330622999] [2022-11-25 23:53:04,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:53:04,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:53:04,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:53:04,904 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:53:04,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fd9e17-180b-47aa-918f-971e146ba9a8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-25 23:53:05,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:53:05,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:53:05,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-25 23:53:05,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:53:05,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:53:05,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:53:05,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:53:05,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:53:05,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:53:06,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:53:06,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 196 treesize of output 280 [2022-11-25 23:53:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:53:36,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:53:40,514 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~max2~0 1))) (let ((.cse21 (<= .cse7 c_~max3~0)) (.cse10 (<= c_~max3~0 c_~max2~0)) (.cse36 (= c_~max1~0 c_~max2~0)) (.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (or (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse2))) (or (not (< c_~max1~0 .cse0)) (< c_~max3~0 (select .cse1 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (= .cse0 c_~max3~0) (= .cse0 c_~max2~0) (< .cse0 (select .cse1 (+ c_~A~0.offset (* 4 v_subst_1)))))))) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0))) (< (+ v_subst_1 1) c_~N~0))) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse3 (select .cse5 .cse2))) (or (not (< c_~max1~0 .cse3)) (forall ((v_subst_3 Int)) (let ((.cse4 (select .cse5 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (= c_~max2~0 .cse4) (not (< v_subst_3 c_~N~0)) (not (< .cse3 .cse4)) (< (+ v_subst_3 1) c_~N~0)))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse6 (select .cse5 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< c_~max3~0 .cse6)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (<= .cse7 .cse6)))))))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (thread3Thread1of1ForFork1_~i~2 Int) (v_subst_1 Int)) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse2))) (or (not (< v_subst_1 c_~N~0)) (not (< c_~max1~0 .cse8)) (< c_~max3~0 (select .cse9 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (< (+ v_subst_1 1) c_~N~0) (= .cse8 c_~max3~0) (< .cse8 (select .cse9 (+ c_~A~0.offset (* 4 v_subst_1)))))))) .cse10) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse11 .cse2)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse12 (select .cse11 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (not (< c_~max1~0 .cse12)) (= .cse12 c_~max2~0) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse13 (select .cse11 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< c_~max3~0 .cse13)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (<= .cse7 .cse13))))))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (or (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse2))) (or (not (< c_~max1~0 .cse14)) (< c_~max3~0 (select .cse15 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (forall ((v_subst_2 Int)) (let ((.cse16 (select .cse15 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (< (+ v_subst_2 1) c_~N~0) (= .cse16 c_~max3~0) (not (< v_subst_2 c_~N~0)) (not (< .cse14 .cse16))))))))))) (forall ((v_thread1Thread1of1ForFork2_~i~0_180 Int)) (or (< (+ v_thread1Thread1of1ForFork2_~i~0_180 1) c_~N~0) (not (< v_thread1Thread1of1ForFork2_~i~0_180 c_~N~0)) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse17 (+ (* v_thread1Thread1of1ForFork2_~i~0_180 4) c_~A~0.offset))) (< c_~max1~0 (select .cse17 .cse2)) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse18 (select .cse17 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< c_~max3~0 .cse18)) (= c_~max1~0 .cse18) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (<= .cse18 c_~max2~0))))))))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_181 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse20 (select .cse19 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_181 4))))) (or (< c_~max1~0 (select .cse19 .cse2)) (< c_~max3~0 (select .cse19 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< c_~max1~0 .cse20)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (not (< v_thread1Thread1of1ForFork2_~i~0_181 c_~N~0)) (< (+ v_thread1Thread1of1ForFork2_~i~0_181 1) c_~N~0) (= .cse20 c_~max2~0))))) .cse21) (or .cse21 (forall ((v_ArrVal_1835 (Array Int Int)) (thread3Thread1of1ForFork1_~i~2 Int) (v_subst_1 Int)) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse2))) (or (not (< v_subst_1 c_~N~0)) (not (< c_~max1~0 .cse22)) (< c_~max3~0 (select .cse23 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (< (+ v_subst_1 1) c_~N~0) (= .cse22 c_~max2~0) (< .cse22 (select .cse23 (+ c_~A~0.offset (* 4 v_subst_1))))))))) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse24 (select .cse26 .cse2))) (or (not (< c_~max1~0 .cse24)) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse25 (select .cse26 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< c_~max3~0 .cse25)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (= .cse24 .cse25) (<= .cse25 c_~max2~0)))) (< .cse24 (select .cse26 (+ c_~A~0.offset (* 4 v_subst_1)))))))) (< (+ v_subst_1 1) c_~N~0))) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (< (+ v_subst_1 1) c_~N~0) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse27 (select .cse28 .cse2))) (or (not (< c_~max1~0 .cse27)) (= .cse27 c_~max2~0) (< .cse27 (select .cse28 (+ c_~A~0.offset (* 4 v_subst_1)))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse29 (select .cse28 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< c_~max3~0 .cse29)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (<= .cse7 .cse29)))))))))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (or (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse30 .cse2)) (< c_~max3~0 (select .cse30 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse31 (select .cse30 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (not (< c_~max1~0 .cse31)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0)) (= .cse31 c_~max3~0))))))))) (or .cse21 (forall ((v_ArrVal_1835 (Array Int Int)) (v_subst_3 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse32 (select .cse33 .cse2)) (.cse34 (select .cse33 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (not (< c_~max1~0 .cse32)) (< c_~max3~0 (select .cse33 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (= c_~max2~0 .cse34) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (not (< v_subst_3 c_~N~0)) (not (< .cse32 .cse34)) (< (+ v_subst_3 1) c_~N~0)))))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_180 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse35 (+ (* v_thread1Thread1of1ForFork2_~i~0_180 4) c_~A~0.offset))) (< (+ v_thread1Thread1of1ForFork2_~i~0_180 1) c_~N~0) (< c_~max1~0 (select .cse35 .cse2)) (< c_~max3~0 (select .cse35 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< v_thread1Thread1of1ForFork2_~i~0_180 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0)))) (and (= c_~max1~0 c_~max3~0) .cse21) (and .cse36 .cse10)) (or .cse36 (forall ((v_ArrVal_1835 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_180 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse38 (select .cse37 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (< c_~max1~0 (select .cse37 (+ (* v_thread1Thread1of1ForFork2_~i~0_180 4) c_~A~0.offset))) (< (+ v_thread1Thread1of1ForFork2_~i~0_180 1) c_~N~0) (< c_~max1~0 (select .cse37 .cse2)) (not (< c_~max3~0 .cse38)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< v_thread1Thread1of1ForFork2_~i~0_180 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (<= .cse7 .cse38))))))))) is different from false [2022-11-25 23:53:41,151 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse29 (+ c_~max2~0 1))) (let ((.cse2 (<= .cse29 c_~max3~0)) (.cse22 (<= c_~max3~0 c_~max2~0)) (.cse21 (= c_~max1~0 c_~max2~0))) (and (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (< (+ v_subst_1 1) c_~N~0) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (or (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (not (< c_~max1~0 .cse0)) (< c_~max3~0 (select .cse1 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (< .cse0 (select .cse1 (+ c_~A~0.offset (* 4 v_subst_1)))) (= .cse0 c_~max3~0) (= c_~max2~0 .cse0))))) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0))))) (or .cse2 (forall ((v_ArrVal_1835 (Array Int Int)) (thread3Thread1of1ForFork1_~i~2 Int) (v_subst_1 Int)) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse3 (select .cse4 c_~A~0.offset))) (or (not (< v_subst_1 c_~N~0)) (not (< c_~max1~0 .cse3)) (< c_~max3~0 (select .cse4 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (< .cse3 (select .cse4 (+ c_~A~0.offset (* 4 v_subst_1)))) (< (+ v_subst_1 1) c_~N~0) (= c_~max2~0 .cse3)))))) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse5 (select .cse7 c_~A~0.offset))) (or (not (< c_~max1~0 .cse5)) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse6 (select .cse7 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< c_~max3~0 .cse6)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (= .cse5 .cse6) (<= .cse6 c_~max2~0)))) (< .cse5 (select .cse7 (+ c_~A~0.offset (* 4 v_subst_1)))))))) (< (+ v_subst_1 1) c_~N~0))) (or .cse2 (forall ((v_ArrVal_1835 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_181 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse9 (select .cse8 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_181 4))))) (or (< c_~max1~0 (select .cse8 c_~A~0.offset)) (< c_~max3~0 (select .cse8 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< c_~max1~0 .cse9)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (not (< v_thread1Thread1of1ForFork2_~i~0_181 c_~N~0)) (< (+ v_thread1Thread1of1ForFork2_~i~0_181 1) c_~N~0) (= .cse9 c_~max2~0)))))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_subst_3 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse10 (select .cse11 c_~A~0.offset)) (.cse12 (select .cse11 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (not (< c_~max1~0 .cse10)) (< c_~max3~0 (select .cse11 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< .cse10 .cse12)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (= c_~max2~0 .cse12) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (not (< v_subst_3 c_~N~0)) (< (+ v_subst_3 1) c_~N~0))))) .cse2) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (or (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse13 c_~A~0.offset)) (< c_~max3~0 (select .cse13 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse14 (select .cse13 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (not (< c_~max1~0 .cse14)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0)) (= .cse14 c_~max3~0))))))) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (or (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse15 (select .cse16 c_~A~0.offset))) (or (not (< c_~max1~0 .cse15)) (< c_~max3~0 (select .cse16 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (forall ((v_subst_2 Int)) (let ((.cse17 (select .cse16 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (not (< .cse15 .cse17)) (< (+ v_subst_2 1) c_~N~0) (= .cse17 c_~max3~0) (not (< v_subst_2 c_~N~0))))))))))) (forall ((v_thread1Thread1of1ForFork2_~i~0_180 Int)) (or (< (+ v_thread1Thread1of1ForFork2_~i~0_180 1) c_~N~0) (not (< v_thread1Thread1of1ForFork2_~i~0_180 c_~N~0)) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse18 c_~A~0.offset)) (< c_~max1~0 (select .cse18 (+ (* v_thread1Thread1of1ForFork2_~i~0_180 4) c_~A~0.offset))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse19 (select .cse18 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< c_~max3~0 .cse19)) (= c_~max1~0 .cse19) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (<= .cse19 c_~max2~0))))))))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_180 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse20 c_~A~0.offset)) (< c_~max1~0 (select .cse20 (+ (* v_thread1Thread1of1ForFork2_~i~0_180 4) c_~A~0.offset))) (< (+ v_thread1Thread1of1ForFork2_~i~0_180 1) c_~N~0) (< c_~max3~0 (select .cse20 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< v_thread1Thread1of1ForFork2_~i~0_180 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0)))) (and (= c_~max1~0 c_~max3~0) .cse2) (and .cse21 .cse22)) (or .cse22 (forall ((v_ArrVal_1835 (Array Int Int)) (thread3Thread1of1ForFork1_~i~2 Int) (v_subst_1 Int)) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse23 (select .cse24 c_~A~0.offset))) (or (not (< v_subst_1 c_~N~0)) (not (< c_~max1~0 .cse23)) (< c_~max3~0 (select .cse24 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (< .cse23 (select .cse24 (+ c_~A~0.offset (* 4 v_subst_1)))) (= .cse23 c_~max3~0) (< (+ v_subst_1 1) c_~N~0)))))) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse25 (select .cse27 c_~A~0.offset))) (or (not (< c_~max1~0 .cse25)) (forall ((v_subst_3 Int)) (let ((.cse26 (select .cse27 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (not (< .cse25 .cse26)) (= c_~max2~0 .cse26) (not (< v_subst_3 c_~N~0)) (< (+ v_subst_3 1) c_~N~0)))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse28 (select .cse27 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< c_~max3~0 .cse28)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (<= .cse29 .cse28)))))))) (or .cse21 (forall ((v_ArrVal_1835 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_180 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse31 (select .cse30 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (< c_~max1~0 (select .cse30 c_~A~0.offset)) (< c_~max1~0 (select .cse30 (+ (* v_thread1Thread1of1ForFork2_~i~0_180 4) c_~A~0.offset))) (< (+ v_thread1Thread1of1ForFork2_~i~0_180 1) c_~N~0) (not (< c_~max3~0 .cse31)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< v_thread1Thread1of1ForFork2_~i~0_180 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (<= .cse29 .cse31)))))) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse32 c_~A~0.offset)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse33 (select .cse32 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (not (< c_~max1~0 .cse33)) (= .cse33 c_~max2~0) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse34 (select .cse32 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< c_~max3~0 .cse34)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (<= .cse29 .cse34))))))) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse35 (select .cse36 c_~A~0.offset))) (or (not (< c_~max1~0 .cse35)) (< .cse35 (select .cse36 (+ c_~A~0.offset (* 4 v_subst_1)))) (= c_~max2~0 .cse35) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse37 (select .cse36 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< c_~max3~0 .cse37)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (<= .cse29 .cse37)))))))) (< (+ v_subst_1 1) c_~N~0)))))) is different from false [2022-11-25 23:54:05,771 WARN L233 SmtUtils]: Spent 21.57s on a formula simplification. DAG size of input: 234 DAG size of output: 222 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:54:39,955 WARN L233 SmtUtils]: Spent 27.92s on a formula simplification that was a NOOP. DAG size: 219 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:54:43,578 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~max2~0 1))) (let ((.cse29 (<= c_~max3~0 c_~max2~0)) (.cse8 (= c_~max1~0 c_~max3~0)) (.cse88 (= c_~max1~0 c_~max2~0)) (.cse68 (<= .cse3 c_~max3~0))) (and (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (or (forall ((v_thread1Thread1of1ForFork2_~i~0_180 Int)) (or (< (+ v_thread1Thread1of1ForFork2_~i~0_180 1) c_~N~0) (not (< v_thread1Thread1of1ForFork2_~i~0_180 c_~N~0)) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse0 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse0 c_~A~0.offset)) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse1 (select .cse0 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (<= .cse1 c_~max2~0) (not (< c_~max3~0 .cse1)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (= c_~max1~0 .cse1)))) (< c_~max1~0 (select .cse0 (+ (* v_thread1Thread1of1ForFork2_~i~0_180 4) c_~A~0.offset)))))))) (< c_~max2~0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (or (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (< (+ v_subst_1 1) c_~N~0) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse5 (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse6 (select .cse5 c_~A~0.offset))) (or (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse4 (select .cse5 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (<= .cse3 .cse4) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< c_~max3~0 .cse4)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0)))) (< .cse6 (select .cse5 (+ c_~A~0.offset (* 4 v_subst_1)))) (= .cse6 c_~max2~0) (not (< c_~max1~0 .cse6)))))))) (< c_~max2~0 (select (select .cse7 c_~A~0.base) c_~A~0.offset))))) (or .cse8 (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_180 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse10 (select (select .cse11 c_~A~0.base) c_~A~0.offset)) (.cse9 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse9 c_~A~0.offset)) (< (+ v_thread1Thread1of1ForFork2_~i~0_180 1) c_~N~0) (not (< c_~max2~0 .cse10)) (<= c_~max3~0 .cse10) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< v_thread1Thread1of1ForFork2_~i~0_180 c_~N~0)) (< c_~max1~0 (select .cse9 (+ (* v_thread1Thread1of1ForFork2_~i~0_180 4) c_~A~0.offset))) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (< c_~max3~0 (select .cse9 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse12 (select (select .cse16 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse12)) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse14 (select (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse13 (select .cse14 c_~A~0.offset))) (or (< .cse13 (select .cse14 (+ c_~A~0.offset (* 4 v_subst_1)))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse15 (select .cse14 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (= .cse15 .cse13) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< c_~max3~0 .cse15)) (<= .cse15 .cse12) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0)))) (not (< c_~max1~0 .cse13)))))) (< (+ v_subst_1 1) c_~N~0))))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (or (< c_~max2~0 (select (select .cse17 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse20 (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse19 (select .cse20 c_~A~0.offset))) (or (forall ((v_subst_3 Int)) (let ((.cse18 (select .cse20 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (= .cse18 c_~max2~0) (not (< v_subst_3 c_~N~0)) (not (< .cse19 .cse18)) (< (+ v_subst_3 1) c_~N~0)))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse21 (select .cse20 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (<= .cse3 .cse21) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< c_~max3~0 .cse21)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0)))) (not (< c_~max1~0 .cse19))))))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (or (not (< c_~max2~0 (select (select .cse22 c_~A~0.base) c_~A~0.offset))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (or (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse23 (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse25 (select .cse23 c_~A~0.offset))) (or (< c_~max3~0 (select .cse23 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (forall ((v_subst_2 Int)) (let ((.cse24 (select .cse23 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)) (= .cse24 c_~max3~0) (not (< .cse25 .cse24))))) (not (< c_~max1~0 .cse25))))))))))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (or (forall ((v_thread1Thread1of1ForFork2_~i~0_180 Int)) (or (< (+ v_thread1Thread1of1ForFork2_~i~0_180 1) c_~N~0) (not (< v_thread1Thread1of1ForFork2_~i~0_180 c_~N~0)) (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse27 (select (select .cse28 c_~A~0.base) c_~A~0.offset)) (.cse26 (select (store .cse28 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse26 c_~A~0.offset)) (not (< c_~max2~0 .cse27)) (= .cse27 c_~max1~0) (<= (+ .cse27 1) c_~max3~0) (< c_~max1~0 (select .cse26 (+ (* v_thread1Thread1of1ForFork2_~i~0_180 4) c_~A~0.offset))) (< c_~max3~0 (select .cse26 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))))))))) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0))) (or .cse29 (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (thread3Thread1of1ForFork1_~i~2 Int) (v_subst_1 Int)) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse31 (select (store .cse32 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse30 (select .cse31 c_~A~0.offset))) (or (not (< v_subst_1 c_~N~0)) (= .cse30 c_~max3~0) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< .cse30 (select .cse31 (+ c_~A~0.offset (* 4 v_subst_1)))) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (< (+ v_subst_1 1) c_~N~0) (< c_~max2~0 (select (select .cse32 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select .cse31 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< c_~max1~0 .cse30)))))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse33 (select (select .cse36 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse33)) (forall ((v_thread1Thread1of1ForFork2_~i~0_180 Int)) (or (< (+ v_thread1Thread1of1ForFork2_~i~0_180 1) c_~N~0) (not (< v_thread1Thread1of1ForFork2_~i~0_180 c_~N~0)) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse34 (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse34 c_~A~0.offset)) (< c_~max1~0 (select .cse34 (+ (* v_thread1Thread1of1ForFork2_~i~0_180 4) c_~A~0.offset))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse35 (select .cse34 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< c_~max3~0 .cse35)) (<= .cse35 .cse33) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (= c_~max1~0 .cse35))))))))))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse37 (select (select .cse40 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse37)) (<= (+ .cse37 1) c_~max3~0) (forall ((v_ArrVal_1835 (Array Int Int)) (thread3Thread1of1ForFork1_~i~2 Int) (v_subst_1 Int)) (let ((.cse39 (select (store .cse40 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse38 (select .cse39 c_~A~0.offset))) (or (not (< v_subst_1 c_~N~0)) (= .cse37 .cse38) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< .cse38 (select .cse39 (+ c_~A~0.offset (* 4 v_subst_1)))) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (< (+ v_subst_1 1) c_~N~0) (< c_~max3~0 (select .cse39 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< c_~max1~0 .cse38)))))))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse41 (select (select .cse45 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse41)) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse42 (select (store .cse45 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse42 c_~A~0.offset)) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse43 (select .cse42 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< c_~max3~0 .cse43)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (<= (+ .cse41 1) .cse43)))) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse44 (select .cse42 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (not (< c_~max1~0 .cse44)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (= .cse41 .cse44) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0)))))))))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse46 (select (select .cse49 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse46)) (<= c_~max3~0 .cse46) (forall ((v_ArrVal_1835 (Array Int Int)) (thread3Thread1of1ForFork1_~i~2 Int) (v_subst_1 Int)) (let ((.cse48 (select (store .cse49 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse47 (select .cse48 c_~A~0.offset))) (or (not (< v_subst_1 c_~N~0)) (= .cse47 c_~max3~0) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< .cse47 (select .cse48 (+ c_~A~0.offset (* 4 v_subst_1)))) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (< (+ v_subst_1 1) c_~N~0) (< c_~max3~0 (select .cse48 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< c_~max1~0 .cse47)))))))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse52 (select (select .cse53 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_181 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse51 (select (store .cse53 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse50 (select .cse51 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_181 4))))) (or (not (< c_~max1~0 .cse50)) (< c_~max1~0 (select .cse51 c_~A~0.offset)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (= .cse52 .cse50) (not (< v_thread1Thread1of1ForFork2_~i~0_181 c_~N~0)) (< (+ v_thread1Thread1of1ForFork2_~i~0_181 1) c_~N~0) (< c_~max3~0 (select .cse51 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))))))) (not (< c_~max2~0 .cse52)) (<= (+ .cse52 1) c_~max3~0))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse54 (select (select .cse59 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse54)) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse57 (select (store .cse59 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse55 (select .cse57 c_~A~0.offset))) (or (forall ((v_subst_3 Int)) (let ((.cse56 (select .cse57 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (not (< v_subst_3 c_~N~0)) (not (< .cse55 .cse56)) (= .cse54 .cse56) (< (+ v_subst_3 1) c_~N~0)))) (not (< c_~max1~0 .cse55)) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse58 (select .cse57 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< c_~max3~0 .cse58)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (<= (+ .cse54 1) .cse58)))))))))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (or (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse60 (select (store .cse63 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse60 c_~A~0.offset)) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse61 (select .cse60 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (<= .cse3 .cse61) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< c_~max3~0 .cse61)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0)))) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse62 (select .cse60 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (= .cse62 c_~max2~0) (not (< c_~max1~0 .cse62)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0)))))))) (< c_~max2~0 (select (select .cse63 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse64 (select (select .cse67 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse64)) (= .cse64 c_~max1~0) (forall ((v_ArrVal_1835 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_180 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse65 (select (store .cse67 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse66 (select .cse65 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (< c_~max1~0 (select .cse65 c_~A~0.offset)) (< (+ v_thread1Thread1of1ForFork2_~i~0_180 1) c_~N~0) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< v_thread1Thread1of1ForFork2_~i~0_180 c_~N~0)) (< c_~max1~0 (select .cse65 (+ (* v_thread1Thread1of1ForFork2_~i~0_180 4) c_~A~0.offset))) (not (< c_~max3~0 .cse66)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (<= (+ .cse64 1) .cse66))))))))) (or .cse68 (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (thread3Thread1of1ForFork1_~i~2 Int) (v_subst_1 Int)) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse70 (select (store .cse71 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse69 (select .cse70 c_~A~0.offset))) (or (not (< v_subst_1 c_~N~0)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< .cse69 (select .cse70 (+ c_~A~0.offset (* 4 v_subst_1)))) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (< (+ v_subst_1 1) c_~N~0) (= .cse69 c_~max2~0) (< c_~max2~0 (select (select .cse71 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select .cse70 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< c_~max1~0 .cse69)))))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (or (< c_~max2~0 (select (select .cse72 c_~A~0.base) c_~A~0.offset)) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (< (+ v_subst_1 1) c_~N~0) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse74 (select (store .cse72 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse73 (select .cse74 c_~A~0.offset))) (or (< .cse73 (select .cse74 (+ c_~A~0.offset (* 4 v_subst_1)))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse75 (select .cse74 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (= .cse75 .cse73) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (<= .cse75 c_~max2~0) (not (< c_~max3~0 .cse75)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0)))) (not (< c_~max1~0 .cse73))))))))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (or (< c_~max2~0 (select (select .cse76 c_~A~0.base) c_~A~0.offset)) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (or (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse77 (select (store .cse76 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse77 c_~A~0.offset)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse78 (select .cse77 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (= .cse78 c_~max3~0) (not (< c_~max1~0 .cse78)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))) (< c_~max3~0 (select .cse77 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))))) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0)))))) (or .cse68 (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_subst_3 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse81 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse82 (select (store .cse81 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse79 (select .cse82 (+ c_~A~0.offset (* 4 v_subst_3)))) (.cse80 (select .cse82 c_~A~0.offset))) (or (= .cse79 c_~max2~0) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (not (< v_subst_3 c_~N~0)) (not (< .cse80 .cse79)) (< c_~max2~0 (select (select .cse81 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select .cse82 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< c_~max1~0 .cse80)) (< (+ v_subst_3 1) c_~N~0))))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse83 (select (select .cse87 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse83)) (forall ((v_subst_1 Int)) (or (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse85 (select (store .cse87 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse84 (select .cse85 c_~A~0.offset))) (or (= .cse83 .cse84) (< .cse84 (select .cse85 (+ c_~A~0.offset (* 4 v_subst_1)))) (not (< c_~max1~0 .cse84)) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse86 (select .cse85 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< c_~max3~0 .cse86)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (<= (+ .cse83 1) .cse86)))))))) (not (< v_subst_1 c_~N~0)) (< (+ v_subst_1 1) c_~N~0))))))) (or (and .cse8 .cse68) (and .cse88 .cse29) (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_180 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse90 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse89 (select (store .cse90 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse89 c_~A~0.offset)) (< (+ v_thread1Thread1of1ForFork2_~i~0_180 1) c_~N~0) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< v_thread1Thread1of1ForFork2_~i~0_180 c_~N~0)) (< c_~max1~0 (select .cse89 (+ (* v_thread1Thread1of1ForFork2_~i~0_180 4) c_~A~0.offset))) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (< c_~max2~0 (select (select .cse90 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select .cse89 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))))))) (or .cse8 (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_180 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse93 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse92 (select (select .cse93 c_~A~0.base) c_~A~0.offset)) (.cse91 (select (store .cse93 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse91 c_~A~0.offset)) (< (+ v_thread1Thread1of1ForFork2_~i~0_180 1) c_~N~0) (not (< c_~max2~0 .cse92)) (= .cse92 c_~max1~0) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< v_thread1Thread1of1ForFork2_~i~0_180 c_~N~0)) (< c_~max1~0 (select .cse91 (+ (* v_thread1Thread1of1ForFork2_~i~0_180 4) c_~A~0.offset))) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (< c_~max3~0 (select .cse91 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse94 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (or (< c_~max2~0 (select (select .cse94 c_~A~0.base) c_~A~0.offset)) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (or (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse95 (select (store .cse94 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse97 (select .cse95 c_~A~0.offset))) (or (< c_~max3~0 (select .cse95 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (forall ((v_subst_2 Int)) (let ((.cse96 (select .cse95 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)) (= .cse96 c_~max3~0) (not (< .cse97 .cse96))))) (not (< c_~max1~0 .cse97))))))))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse102 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse98 (select (select .cse102 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse98)) (forall ((v_ArrVal_1835 (Array Int Int)) (v_subst_3 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse101 (select (store .cse102 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse100 (select .cse101 (+ c_~A~0.offset (* 4 v_subst_3)))) (.cse99 (select .cse101 c_~A~0.offset))) (or (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (not (< v_subst_3 c_~N~0)) (not (< .cse99 .cse100)) (= .cse98 .cse100) (< c_~max3~0 (select .cse101 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4)))) (not (< c_~max1~0 .cse99)) (< (+ v_subst_3 1) c_~N~0))))) (<= (+ .cse98 1) c_~max3~0))))) (forall ((v_ArrVal_1834 (Array Int Int))) (let ((.cse103 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (or (not (< c_~max2~0 (select (select .cse103 c_~A~0.base) c_~A~0.offset))) (forall ((thread3Thread1of1ForFork1_~i~2 Int)) (or (forall ((v_ArrVal_1835 (Array Int Int))) (let ((.cse104 (select (store .cse103 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (or (< c_~max1~0 (select .cse104 c_~A~0.offset)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse105 (select .cse104 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (= .cse105 c_~max3~0) (not (< c_~max1~0 .cse105)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))) (< c_~max3~0 (select .cse104 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))))) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0)))))) (or .cse88 (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_180 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse108 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse106 (select (store .cse108 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse107 (select .cse106 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))) (or (< c_~max1~0 (select .cse106 c_~A~0.offset)) (< (+ v_thread1Thread1of1ForFork2_~i~0_180 1) c_~N~0) (<= .cse3 .cse107) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (not (< v_thread1Thread1of1ForFork2_~i~0_180 c_~N~0)) (< c_~max1~0 (select .cse106 (+ (* v_thread1Thread1of1ForFork2_~i~0_180 4) c_~A~0.offset))) (not (< c_~max3~0 .cse107)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (< c_~max2~0 (select (select .cse108 c_~A~0.base) c_~A~0.offset)))))))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_181 Int) (thread3Thread1of1ForFork1_~i~2 Int)) (let ((.cse111 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1834))) (let ((.cse110 (select (store .cse111 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1835) c_~A~0.base))) (let ((.cse109 (select .cse110 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_181 4))))) (or (not (< c_~max1~0 .cse109)) (< c_~max1~0 (select .cse110 c_~A~0.offset)) (not (< thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (= .cse109 c_~max2~0) (not (< v_thread1Thread1of1ForFork2_~i~0_181 c_~N~0)) (< c_~max2~0 (select (select .cse111 c_~A~0.base) c_~A~0.offset)) (< (+ v_thread1Thread1of1ForFork2_~i~0_181 1) c_~N~0) (< c_~max3~0 (select .cse110 (+ c_~A~0.offset (* thread3Thread1of1ForFork1_~i~2 4))))))))) .cse68)))) is different from false [2022-11-25 23:56:08,984 WARN L233 SmtUtils]: Spent 1.30m on a formula simplification that was a NOOP. DAG size: 269 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:56:27,531 WARN L233 SmtUtils]: Spent 18.01s on a formula simplification that was a NOOP. DAG size: 175 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-25 23:56:27,531 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:56:27,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 28 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 28 new quantified variables, introduced 28 case distinctions, treesize of input 5882 treesize of output 7425 [2022-11-25 23:56:32,801 INFO L217 Elim1Store]: Index analysis took 2194 ms [2022-11-25 23:56:32,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 27 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 25208 treesize of output 27717